This book is mainly devoted to some computational and algorithmic problems in finite fields such as, for example, polynomial factorization, finding irreducible and primitive polynomials, the distribution of these primitive polynomials and of primitive points on elliptic curves, constructing bases of various types and new applications of finite fields to other areas of mathematics. For completeness we in clude two special chapters on some recent advances and applications of the theory of congruences (optimal coefficients, congruential pseudo-random number gener ators, modular arithmetic, etc.) and computational number theory (primality testing, factoring integers, computation in algebraic number theory, etc.). The problems considered here have many applications in Computer Science, Cod ing Theory, Cryptography, Numerical Methods, and so on. There are a few books devoted to more general questions, but the results contained in this book have not till now been collected under one cover. In the present work the author has attempted to point out new links among different areas of the theory of finite fields. It contains many very important results which previously could be found only in widely scattered and hardly available conference proceedings and journals. In particular, we extensively review results which originally appeared only in Russian, and are not well known to mathematicians outside the former USSR."

The book introduces new techniques that imply rigorous lower bounds on the com plexity of some number-theoretic and cryptographic problems. It also establishes certain attractive pseudorandom properties of various cryptographic primitives. These methods and techniques are based on bounds of character sums and num bers of solutions of some polynomial equations over finite fields and residue rings. Other number theoretic techniques such as sieve methods and lattice reduction algorithms are used as well. The book also contains a number of open problems and proposals for further research. The emphasis is on obtaining unconditional rigorously proved statements. The bright side of this approach is that the results do not depend on any assumptions or conjectures. On the downside, the results are much weaker than those which are widely believed to be true. We obtain several lower bounds, exponential in terms of logp, on the degrees and orders of o polynomials; o algebraic functions; o Boolean functions; o linear recurrence sequences; coinciding with values of the discrete logarithm modulo a prime p at sufficiently many points (the number of points can be as small as pI/2+O: ). These functions are considered over the residue ring modulo p and over the residue ring modulo an arbitrary divisor d of p - 1. The case of d = 2 is of special interest since it corresponds to the representation of the rightmost bit of the discrete logarithm and defines whether the argument is a quadratic residue."

This book, part of the seriesContributions in Mathematical and Computational Sciences, reviews recent developments in the theory of vertex operator algebras (VOAs) and their applications to mathematics and physics.

The mathematical theory of VOAs originated from the famous monstrous moonshine conjectures of J.H. Conway and S.P. Norton, which predicted a deep relationship between the characters of the largest simple finite sporadic group, the Monster and the theory of modular forms inspired by the observations of J. MacKay and J. Thompson.

The contributions are based on lectures delivered at the 2011 conference on Conformal Field Theory, Automorphic Forms and Related Topics, organized by the editors as part of a special program offered at Heidelberg University that summer under the sponsorship of the Mathematics Center Heidelberg (MATCH)."

This book is about the development of reciprocity laws, starting from conjectures of Euler and discussing the contributions of Legendre, Gauss, Dirichlet, Jacobi, and Eisenstein. Readers knowledgeable in basic algebraic number theory and Galois theory will find detailed discussions of the reciprocity laws for quadratic, cubic, quartic, sextic and octic residues, rational reciprocity laws, and Eisenstein's reciprocity law. An extensive bibliography will be of interest to readers interested in the history of reciprocity laws or in the current research in this area.

The SCAN conference, the International Symposium on Scientific Com puting, Computer Arithmetic and Validated Numerics, takes place bian nually under the joint auspices of GAMM (Gesellschaft fiir Angewandte Mathematik und Mechanik) and IMACS (International Association for Mathematics and Computers in Simulation). SCAN-98 attracted more than 100 participants from 21 countries all over the world. During the four days from September 22 to 25, nine highlighted, plenary lectures and over 70 contributed talks were given. These figures indicate a large participation, which was partly caused by the attraction of the organizing country, Hungary, but also the effec tive support system have contributed to the success. The conference was substantially supported by the Hungarian Research Fund OTKA, GAMM, the National Technology Development Board OMFB and by the J6zsef Attila University. Due to this funding, it was possible to subsidize the participation of over 20 scientists, mainly from Eastern European countries. It is important that the possibly first participation of 6 young researchers was made possible due to the obtained support. The number of East-European participants was relatively high. These results are especially valuable, since in contrast to the usual 2 years period, the present meeting was organized just one year after the last SCAN-xx conference."

From the 28th of February through the 3rd of March, 2001, the Department of Math ematics of the University of Florida hosted a conference on the many aspects of the field of Ordered Algebraic Structures. Officially, the title was "Conference on Lattice Ordered Groups and I-Rings," but its subject matter evolved beyond the limitations one might associate with such a label. This volume is officially the proceedings of that conference, although, likewise, it is more accurate to view it as a complement to that event. The conference was the fourth in wh at has turned into aseries of similar conferences, on Ordered Algebraic Structures, held in consecutive years. The first, held at the University of Florida in Spring, 1998, was a modest and informal affair. The fifth is in the final planning stages at this writing, for March 7-9, 2002, at Vanderbilt University. And although these events remain modest and reasonably informal, their scope has broadened, as they have succeeded in attracting mathematicians from other, related fields, as weIl as from more distant lands."

This book describes the latest Russian research covering the structure and algorithmic properties of Boolean algebras from the algebraic and model-theoretic points of view. A significantly revised version of the author's Countable Boolean Algebras (Nauka, Novosibirsk, 1989), the text presents new results as well as a selection of open questions on Boolean algebras. Other current features include discussions of the Kottonen algebras in enrichments by ideals and automorphisms, and the properties of the automorphism groups.

Introduction to Cyclotomic Fields is a carefully written exposition of a central area of number theory that can be used as a second course in algebraic number theory. Starting at an elementary level, the volume covers p-adic L-functions, class numbers, cyclotomic units, Fermat's Last Theorem, and Iwasawa's theory of Z_p-extensions, leading the reader to an understanding of modern research literature. Many exercises are included. The second edition includes a new chapter on the work of Thaine, Kolyvagin, and Rubin, including a proof of the Main Conjecture. There is also a chapter giving other recent developments, including primality testing via Jacobi sums and Sinnott's proof of the vanishing of Iwasawa's f-invariant.

This book contains nineteen papers from among the twenty-five papers presented at the Second International Conference on Fibonacci Numbers and Their Applications. These papers have been selected after a careful review by well known referee's in the field, and they range from elementary number theory to probability and statistics. The Fibonacci numbers are their unifying bond. It is anticipated that this book will be useful to research workers and graduate students interested in the Fibonacci numbers and their applications. October 1987 The Editors Gerald E. Bergum South Dakota State University Brookings, South Dakota, U.S.A. Andreas N. Philippou University of Patras Patras, Greece Alwyn F. Horadam University of New England Armidale, N.S.W., Australia xiii THE ORGANIZING COMMITTEES LOCAL COMMITTEE INTERN A TIONAL COMMITTEE Bergum, G., Chairman Philippou, A. (Greece), Chairman Edgar, H., Co-chalrman Horadam, A. (Australia), Co-chalrman Bergum, G. (U.s.A.) Thoro, D. Kiss, P. (Hungary) Johnson, M. Long, C. (U.S.A.) Lange, L.

The contributions in this book focus on a variety of topics related to discrepancy theory, comprising Fourier techniques to analyze discrepancy, low discrepancy point sets for quasi-Monte Carlo integration, probabilistic discrepancy bounds, dispersion of point sets, pair correlation of sequences, integer points in convex bodies, discrepancy with respect to geometric shapes other than rectangular boxes, and also open problems in discrepany theory.

Starting with a simple formulation accessible to all mathematicians, this second edition is designed to provide a thorough introduction to nonstandard analysis. Nonstandard analysis is now a well-developed, powerful instrument for solving open problems in almost all disciplines of mathematics; it is often used as a 'secret weapon' by those who know the technique. This book illuminates the subject with some of the most striking applications in analysis, topology, functional analysis, probability and stochastic analysis, as well as applications in economics and combinatorial number theory. The first chapter is designed to facilitate the beginner in learning this technique by starting with calculus and basic real analysis. The second chapter provides the reader with the most important tools of nonstandard analysis: the transfer principle, Keisler's internal definition principle, the spill-over principle, and saturation. The remaining chapters of the book study different fields for applications; each begins with a gentle introduction before then exploring solutions to open problems. All chapters within this second edition have been reworked and updated, with several completely new chapters on compactifications and number theory. Nonstandard Analysis for the Working Mathematician will be accessible to both experts and non-experts, and will ultimately provide many new and helpful insights into the enterprise of mathematics.

This handbook focuses on some important topics from Number Theory and Discrete Mathematics. These include the sum of divisors function with the many old and new issues on Perfect numbers; Euler's totient and its many facets; the M bius function along with its generalizations, extensions, and applications; the arithmetic functions related to the divisors or the digits of a number; the Stirling, Bell, Bernoulli, Euler and Eulerian numbers, with connections to various fields of pure or applied mathematics. Each chapter is a survey and can be viewed as an encyclopedia of the considered field, underlining the interconnections of Number Theory with Combinatorics, Numerical mathematics, Algebra, or Probability Theory.

This reference work will be useful to specialists in number theory and discrete mathematics as well as mathematicians or scientists who need access to some of these results in other fields of research.

Multiple Dirichlet Series, L-functions and Automorphic Forms gives the latest advances in the rapidly developing subject of Multiple Dirichlet Series, an area with origins in the theory of automorphic forms that exhibits surprising and deep connections to crystal graphs and mathematical physics. As such, it represents a new way in which areas including number theory, combinatorics, statistical mechanics, and quantum groups are seen to fit together. The volume also includes papers on automorphic forms and L-functions and related number-theoretic topics. This volume will be a valuable resource for graduate students and researchers in number theory, combinatorics, representation theory, mathematical physics, and special functions. Contributors: J. Beineke, B. Brubaker, D. Bump, G. Chinta, G. Cornelissen, C.A. Diaconu, S. Frechette, S. Friedberg, P. Garrett, D. Goldfeld, P.E. Gunnells, B. Heim, J. Hundley, D. Ivanov, Y. Komori, A.V. Kontorovich, O. Lorscheid, K. Matsumoto, P.J. McNamara, S.J. Patterson, M. Suzuki, H. Tsumura.

This book provides a complete exposition of equidistribution and counting problems weighted by a potential function of common perpendicular geodesics in negatively curved manifolds and simplicial trees. Avoiding any compactness assumptions, the authors extend the theory of Patterson-Sullivan, Bowen-Margulis and Oh-Shah (skinning) measures to CAT(-1) spaces with potentials. The work presents a proof for the equidistribution of equidistant hypersurfaces to Gibbs measures, and the equidistribution of common perpendicular arcs between, for instance, closed geodesics. Using tools from ergodic theory (including coding by topological Markov shifts, and an appendix by Buzzi that relates weak Gibbs measures and equilibrium states for them), the authors further prove the variational principle and rate of mixing for the geodesic flow on metric and simplicial trees-again without the need for any compactness or torsionfree assumptions. In a series of applications, using the Bruhat-Tits trees over non-Archimedean local fields, the authors subsequently prove further important results: the Mertens formula and the equidistribution of Farey fractions in function fields, the equidistribution of quadratic irrationals over function fields in their completions, and asymptotic counting results of the representations by quadratic norm forms. One of the book's main benefits is that the authors provide explicit error terms throughout. Given its scope, it will be of interest to graduate students and researchers in a wide range of fields, for instance ergodic theory, dynamical systems, geometric group theory, discrete subgroups of locally compact groups, and the arithmetic of function fields.

A unique synthesis of the three existing Fourier-analytic treatments of quadratic reciprocity.
The relative quadratic case was first settled by Hecke in 1923, then recast by Weil in 1964 into the language of unitary group representations. The analytic proof of the general n-th order case is still an open problem today, going back to the end of Hecke's famous treatise of 1923. The Fourier-Analytic Proof of Quadratic Reciprocity provides number theorists interested in analytic methods applied to reciprocity laws with a unique opportunity to explore the works of Hecke, Weil, and Kubota.
This work brings together for the first time in a single volume the three existing formulations of the Fourier-analytic proof of quadratic reciprocity. It shows how Weil's groundbreaking representation-theoretic treatment is in fact equivalent to Hecke's classical approach, then goes a step further, presenting Kubota's algebraic reformulation of the Hecke-Weil proof. Extensive commutative diagrams for comparing the Weil and Kubota architectures are also featured.
The author clearly demonstrates the value of the analytic approach, incorporating some of the most powerful tools of modern number theory, including adA]les, metaplectric groups, and representations. Finally, he points out that the critical common factor among the three proofs is Poisson summation, whose generalization may ultimately provide the resolution for Hecke's open problem.

Elementary Number Theory, 6th Edition, blends classical theory with modern applications and is notable for its outstanding exercise sets. A full range of exercises, from basic to challenging, helps students explore key concepts and push their understanding to new heights. Computational exercises and computer projects are also available. Reflecting many years of professor feedback, this edition offers new examples, exercises, and applications, while incorporating advancements and discoveries in number theory made in the past few years.

Featuring the work of twenty-three internationally-recognized experts, this volume explores the trace formula, spectra of locally symmetric spaces, p-adic families, and other recent techniques from harmonic analysis and representation theory. Each peer-reviewed submission in this volume, based on the Simons Foundation symposium on families of automorphic forms and the trace formula held in Puerto Rico in January-February 2014, is the product of intensive research collaboration by the participants over the course of the seven-day workshop. The goal of each session in the symposium was to bring together researchers with diverse specialties in order to identify key difficulties as well as fruitful approaches being explored in the field. The respective themes were counting cohomological forms, p-adic trace formulas, Hecke fields, slopes of modular forms, and orbital integrals.

The contents of this volume range from expository papers on several aspects of number theory, intended for general readers (Steinhaus property of planar regions; experiments with computers; Diophantine approximation; number field sieve), to a collection of research papers for specialists, which are at prestigious journal level. Thus, Number Theory and Its Applications leads the reader in many ways not only to the state of the art of number theory but also to its rich garden.

The Guinness Book made records immensely popular. This book is devoted, at first glance, to present records concerning prime numbers. But it is much more. It explores the interface between computations and the theory of prime numbers. The book contains an up-to-date historical presentation of the main problems about prime numbers, as well as many fascinating topics, including primality testing. It is written in a language without secrets, and thoroughly accessible to everyone. The new edition has been significantly improved due to a smoother presentation, many new topics and updated records.

While the theory of transcendental numbers is a fundamental and important branch of number theory, most mathematicians know only its most elementary results. The aim of "Making Transcendence Transparent" is to provide the reader with an understanding of the basic principles and tools of transcendence theory and an intuitive framework within which the major results can be appreciated and their proofs can be understood. The book includes big picture overviews of the over-arching ideas, and general points of attack in particular arguments, so the reader will enjoy and appreciate the panoramic view of transcendence. It is designed to appeal to interested mathematicians, graduate students, and advanced undergraduates.

The purpose of this book is to describe the classical problems in additive number theory, and to introduce the circle method and the sieve method, which are the basic analytical and combinatorial tools to attack these problems. This book is intended for students who want to learn additive number theory, not for experts who already know it. The prerequisites for this book are undergraduate courses in number theory and real analysis.

Many classical problems in additive number theory are direct problems, in which one starts with a set "A" of natural numbers and an integer "H -> 2," and tries to describe the structure of the sumset "hA" consisting of all sums of "h" elements of "A." By contrast, in an inverse problem, one starts with a sumset "hA," and attempts to describe the structure of the underlying set "A." In recent years there has been ramrkable progress in the study of inverse problems for finite sets of integers. In particular, there are important and beautiful inverse theorems due to Freiman, Kneser, Plunnecke, Vosper, and others. This volume includes their results, and culminates with an elegant proof by Ruzsa of the deep theorem of Freiman that a finite set of integers with a small sumset must be a large subset of an "n"-dimensional arithmetic progression.

"

This book reproduces, with minor changes, the notes prepared for a course given at Brigham Young University during the academic year 1984-1985. It is intended to be an introduction to the theory of numbers. The audience consisted largely of undergraduate students with no more background than high school mathematics. The presentation was thus kept as elementary and self-contained as possible. However, because the discussion was, generally, carried far enough to introduce the audience to some areas of current research, the book should also be useful to graduate students. The only prerequisite to reading the book is an interest in and aptitude for mathe matics. Though the topics may seem unrelated, the study of diophantine equations has been our main goal. I am indebted to several mathematicians whose published as well as unpublished work has been freely used throughout this book. In particular, the Phillips Lectures at Haverford College given by Professor John T. Tate have been an important source of material for the book. Some parts of Chapter 5 on algebraic curves are, for example, based on these lectures."

The last one hundred years have seen many important achievements in the classical part of number theory. After the proof of the Prime Number Theorem in 1896, a quick development of analytical tools led to the invention of various new methods, like Brun's sieve method and the circle method of Hardy, Littlewood and Ramanujan; developments in topics such as prime and additive number theory, and the solution of Fermat's problem. Rational Number Theory in the 20th Century: From PNT to FLT offers a short survey of 20th century developments in classical number theory, documenting between the proof of the Prime Number Theorem and the proof of Fermat's Last Theorem. The focus lays upon the part of number theory that deals with properties of integers and rational numbers. Chapters are divided into five time periods, which are then further divided into subject areas. With the introduction of each new topic, developments are followed through to the present day. This book will appeal to graduate researchers and student in number theory, however the presentation of main results without technicalities will make this accessible to anyone with an interest in the area.