The last fifteen years have seen a flurry of exciting developments in Fourier restriction theory, leading to significant new applications in diverse fields. This timely text brings the reader from the classical results to state-of-the-art advances in multilinear restriction theory, the Bourgain-Guth induction on scales and the polynomial method. Also discussed in the second part are decoupling for curved manifolds and a wide variety of applications in geometric analysis, PDEs (Strichartz estimates on tori, local smoothing for the wave equation) and number theory (exponential sum estimates and the proof of the Main Conjecture for Vinogradov's Mean Value Theorem). More than 100 exercises in the text help reinforce these important but often difficult ideas, making it suitable for graduate students as well as specialists. Written by an author at the forefront of the modern theory, this book will be of interest to everybody working in harmonic analysis.

This graduate-level text provides coverage for a one-semester course in algebraic number theory. It explores the general theory of factorization of ideals in Dedekind domains as well as the number field case. Detailed calculations illustrate the use of Kummer's theorem on lifting of prime ideals in extension fields.
The author provides sufficient details for students to navigate the intricate proofs of the Dirichlet unit theorem and the Minkowski bounds on element and ideal norms. Additional topics include the factorization of prime ideals in Galois extensions and local as well as global fields, including the Artin-Whaples approximation theorem and Hensel's lemma. The text concludes with three helpful appendixes. Geared toward mathematics majors, this course requires a background in graduate-level algebra and a familiarity with integral extensions and localization.

The theme of this book is the characterization of certain multiplicative and additive arithmetical functions by combining methods from number theory with some simple ideas from functional and harmonic analysis. The authors achieve this goal by considering convolutions of arithmetical functions, elementary mean-value theorems, and properties of related multiplicative functions. They also prove the mean-value theorems of Wirsing and Halasz and study the pointwise convergence of the Ramanujan expansion. Finally, some applications to power series with multiplicative coefficients are included, along with exercises and an extensive bibliography.

In this tract, Professor Moreno develops the theory of algebraic curves over finite fields, their zeta and L-functions, and, for the first time, the theory of algebraic geometric Goppa codes on algebraic curves. Among the applications considered are: the problem of counting the number of solutions of equations over finite fields; Bombieri's proof of the Reimann hypothesis for function fields, with consequences for the estimation of exponential sums in one variable; Goppa's theory of error-correcting codes constructed from linear systems on algebraic curves; there is also a new proof of the TsfasmanSHVladutSHZink theorem. The prerequisites needed to follow this book are few, and it can be used for graduate courses for mathematics students. Electrical engineers who need to understand the modern developments in the theory of error-correcting codes will also benefit from studying this work.

Many classical and modern results and quadratic forms are brought together in this book. The treatment is self-contained and of a totally elementary nature requiring only a basic knowledge of rings, fields, polynomials, and matrices, such that the works of Pfister, Hilbert, Hurwitz and others are easily accessible to non-experts and undergraduates alike. The author deals with many different approaches to the study of squares; from the classical works of the late 19th century, to areas of current research. Anyone with an interest in algebra or number theory will find this a most fascinating volume.

First printed in 1967, this book has been essential reading for aspiring algebraic number theorists for more than forty years. It contains the lecture notes from an instructional conference held in Brighton in 1965, which was a milestone event that introduced class field theory as a standard tool of mathematics. There are landmark contributions from Serre and Tate. The book is a standard text for taught courses in algebraic number theory. This Second Edition includes a valuable list of errata compiled by mathematicians who have read and used the text over the years.

Peter Giblin describes, in the context of an introduction to the theory of numbers, some of the more elementary methods for factorization and primality testing; that is, methods independent of a knowledge of other areas of mathematics. Indeed everything is developed from scratch so the mathematical prerequisites are minimal. An essential feature of the book is the large number of computer programs (written in Pascal) and a wealth of computational exercises and projects, in addition to more usual theory exercises. The theoretical development includes continued fractions and quadratic residues, directed always towards the two fundamental problems of primality testing and factorization. There is time, all the same, to include a number of topics and projects of a purely "recreational" nature.

Mathematicians solve equations, or try to. But sometimes the solutions are not as interesting as the beautiful symmetric patterns that lead to them. Written in a friendly style for a general audience, "Fearless Symmetry" is the first popular math book to discuss these elegant and mysterious patterns and the ingenious techniques mathematicians use to uncover them.

Hidden symmetries were first discovered nearly two hundred years ago by French mathematician evariste Galois. They have been used extensively in the oldest and largest branch of mathematics--number theory--for such diverse applications as acoustics, radar, and codes and ciphers. They have also been employed in the study of Fibonacci numbers and to attack well-known problems such as Fermat's Last Theorem, Pythagorean Triples, and the ever-elusive Riemann Hypothesis. Mathematicians are still devising techniques for teasing out these mysterious patterns, and their uses are limited only by the imagination.

The first popular book to address representation theory and reciprocity laws, "Fearless Symmetry" focuses on how mathematicians solve equations and prove theorems. It discusses rules of math and why they are just as important as those in any games one might play. The book starts with basic properties of integers and permutations and reaches current research in number theory. Along the way, it takes delightful historical and philosophical digressions. Required reading for all math buffs, the book will appeal to anyone curious about popular mathematics and its myriad contributions to everyday life."

This book is a comprehensive and systematic account of the theory of p-adic and classical modular forms and the theory of the special values of arithmetic L-functions and p-adic L-functions. The approach is basically algebraic, and the treatment is elementary. No deep knowledge from algebraic geometry and representation theory is required. The author's main tool in dealing with these problems is taken from cohomology theory over Riemann surfaces, which is also explained in detail in the book. He also gives a concise but thorough treatment of analytic continuation and functional equation. Graduate students wishing to know more about L-functions will find this a unique introduction to this fascinating branch of mathematics.

This book originates from graduate courses given in Cambridge and London. It provides a brisk, thorough treatment of the foundations of algebraic number theory, and builds on that to introduce more advanced ideas. Throughout, the authors emphasise the systematic development of techniques for the explicit calculation of the basic invariants, such as rings of integers, class groups, and units. Moreover they combine, at each stage of development, theory with explicit computations and applications, and provide motivation in terms of classical number-theoretic problems. A number of special topics are included that can be treated at this level but can usually only be found in research monographs or original papers, for instance: module theory of Dedekind domains; tame and wild ramifications; Gauss series and Gauss periods; binary quadratic forms; and Brauer relations. This is the only textbook at this level which combines clean, modern algebraic techniques together with a substantial arithmetic content. It will be indispensable for all practising and would-be algebraic number theorists.

The study of special cases of elliptic curves goes back to Diophantos and Fermat, and today it is still one of the liveliest centers of research in number theory. This book, addressed to beginning graduate students, introduces basic theory from a contemporary viewpoint but with an eye to the historical background. The central portion deals with curves over the rationals: the Mordell-Wei finite basis theorem, points of finite order (Nagell-Lutz), etc. The treatment is structured by the local-global standpoint and culminates in the description of the Tate-Shafarevich group as the obstruction to a Hasse principle. In an introductory section the Hasse principle for conics is discussed. The book closes with sections on the theory over finite fields (the "Riemann hypothesis for function fields") and recently developed uses of elliptic curves for factoring large integers. Prerequisites are kept to a minimum; an acquaintance with the fundamentals of Galois theory is assumed, but no knowledge either of algebraic number theory or algebraic geometry is needed. The p-adic numbers are introduced from scratch. Many examples and exercises are included for the reader, and those new to elliptic curves, whether they are graduate students or specialists from other fields, will find this a valuable introduction.

This volume is an outgrowth of the LMS Durham Symposium on L-functions, held in July 1989. The symposium consisted of several short courses, aimed at presenting rigorous but non-technical expositions of the latest research areas, and a number of individual lectures on specific topics. The contributors are all outstanding figures in the area of algebraic number theory and this volume will be of lasting value to students and researchers working in the area.

The book is based on lecture notes of a course 'from elementary number theory to an introduction to matrix theory' given at the Technion to gifted high school students. It is problem based, and covers topics in undergraduate mathematics that can be introduced in high school through solving challenging problems. These topics include Number theory, Set Theory, Group Theory, Matrix Theory, and applications to cryptography and search engines.

This book is a self-contained account of the one- and two-dimensional van der Corput method and its use in estimating exponential sums. These arise in many problems in analytic number theory. It is the first cohesive account of much of this material and will be welcomed by graduates and professionals in analytic number theory. The authors show how the method can be applied to problems such as upper bounds for the Riemann-Zeta function. the Dirichlet divisor problem, the distribution of square free numbers, and the Piatetski-Shapiro prime number theorem.

Originally published in 1934 in the Cambridge Tracts, this volume presents the theory of the distribution of the prime numbers in the series of natural numbers. The major part of the book is devoted to the analytical theory founded on the zeta-function of Riemann. Despite being out of print for a long time, this Tract still remains unsurpassed as an introduction to the field, combining an economy of detail with a clarity of exposition which eases the novice into this area.

In this volume, originally published in 1990, are included papers presented at two meetings; one a workshop on Number Theory and Cryptography, and the other, the annual meeting of the Australian Mathematical Society. Questions in number theory are of military and commercial importance for the security of communication, as they are related to codes and code-breaking. Papers in the volume range from problems in pure mathematics whose study has been intensified by this connection, through interesting theoretical and combinatorial problems which arise in the implementation, to practical questions that come from banking and telecommunications. The contributors are prominent within their field. The whole volume will be an attractive purchase for all number theorists, 'pure' or 'applied'.

This volume contains selected contributions from a very successful meeting on Number Theory and Dynamical Systems held at the University of York in 1987. There are close and surprising connections between number theory and dynamical systems. One emerged last century from the study of the stability of the solar system where problems of small divisors associated with the near resonance of planetary frequencies arose. Previously the question of the stability of the solar system was answered in more general terms by the celebrated KAM theorem, in which the relationship between near resonance (and so Diophantine approximation) and stability is of central importance. Other examples of the connections involve the work of Szemeredi and Furstenberg, and Sprindzuk. As well as containing results on the relationship between number theory and dynamical systems, the book also includes some more speculative and exploratory work which should stimulate interest in different approaches to old problems.

In this, one of the first books to appear in English on the theory of numbers, the eminent mathematician Hermann Weyl explores fundamental concepts in arithmetic. The book begins with the definitions and properties of algebraic fields, which are relied upon throughout. The theory of divisibility is then discussed, from an axiomatic viewpoint, rather than by the use of ideals. There follows an introduction to "p"-adic numbers and their uses, which are so important in modern number theory, and the book culminates with an extensive examination of algebraic number fields.

Weyl's own modest hope, that the work "will be of some use," has more than been fulfilled, for the book's clarity, succinctness, and importance rank it as a masterpiece of mathematical exposition.

Written by a noted expert on logic and set theory, this study of basic number systems explores natural numbers, integers, rational numbers, real numbers, and complex numbers. Geared toward undergraduate and beginning graduate students, it requires minimal mathematical training. Several helpful appendixes supplement the text. The author is Professor of Mathematics at Queens College in New York.

A cipher is a scheme for creating coded messages for the secure exchange of information. Throughout history, many different coding schemes have been devised. One of the oldest and simplest mathematical systems was used by Julius Caesar. This is where ""Mathematical Ciphers"" begins. Building on that simple system, Young moves on to more complicated schemes, ultimately ending with the RSA cipher, which is used to provide security for the Internet. This book is structured differently from most mathematics texts. It does not begin with a mathematical topic, but rather with a cipher. The mathematics is developed as it is needed; the applications motivate the mathematics. As is typical in mathematics textbooks, most chapters end with exercises. Many of these problems are similar to solved examples and are designed to assist the reader in mastering the basic material.A few of the exercises are one-of-a-kind, intended to challenge the interested reader. Implementing encryption schemes is considerably easier with the use of the computer. For all the ciphers introduced in this book, JavaScript programs are available from the Web. In addition to developing various encryption schemes, this book also introduces the reader to number theory. Here, the study of integers and their properties is placed in the exciting and modern context of cryptology. ""Mathematical Ciphers"" can be used as a textbook for an introductory course in mathematics for all majors. The only prerequisite is high school mathematics.

Based upon the renowned author's Cambridge lectures, the text simplifies the complexities of the basic elements of number theory and stimulates the reader to pursue further study.

Diophantine equations over number fields have formed one of the most important and fruitful areas of mathematics throughout civilisation. In recent years increasing interest has been aroused in the analogous area of equations over function fields. However, although considerable progress has been made by previous authors, none has attempted the central problem of providing methods for the actual solution of such equations. The latter is the purpose and achievement of this volume: algorithms are provided for the complete resolution of various families of equations, such as those of Thue, hyperelliptic and genus one type. The results are achieved by means of an original fundamental inequality, first announced by the author in 1982. Several specific examples are included as illustrations of the general method and as a testimony to its efficiency. Furthermore, bounds are obtained on the solutions which improve on those obtained previously by other means. Extending the equality to a different setting, namely that of positive characteristic, enables the various families of equations to be resolved in that circumstance. Finally, by applying the inequality in a different manner, simple bounds are determined on their solutions in rational functions of the general superelliptic equation. This book represents a self-contained account of a new approach to the subject, and one which plainly has not reached the full extent of its application. It also provides a more direct on the problems than any previous book. Little expert knowledge is required to follow the theory presented, and it will appeal to professional mathematicians, research students and the enthusiastic undergraduate.

N. N. Vorob'ev's Criteria for Divisibility introduces the high school or early college student to a specific number-theoretic topic and explains the general mathematical structures which underlie the particular concepts discussed. Vorob'ev discusses the ideas of well-ordered sets, partial and linear orderings, equivalence relations, equivalence classes, algorithms, and the relationship between the determinability of algorithms defined on the integers and the well-ordering principle. All this is done comprehensively with the help of a unique plan for study which encourages the student to skip large sections of the book on first reading and return to them later. The more general and conceptually challenging material appears in small print, so that the student must have a good grasp of the number-theoretic concepts on which the generalizations are based before making the step to generalization. The booklet provides both specific knowledge in a particular field of mathematical investigation and a fine basis on which to continue studies in mathematics.

Number theory is one of the oldest branches of mathematics that is primarily concerned with positive integers. While it has long been studied for its beauty and elegance as a branch of pure mathematics, it has seen a resurgence in recent years with the advent of the digital world for its modern applications in both computer science and cryptography. Number Theory: Step by Step is an undergraduate-level introduction to number theory that assumes no prior knowledge, but works to gradually increase the reader's confidence and ability to tackle more difficult material. The strength of the text is in its large number of examples and the step-by-step explanation of each topic as it is introduced to help aid understanding the abstract mathematics of number theory. It is compiled in such a way that allows self-study, with explicit solutions to all the set of problems freely available online via the companion website. Punctuating the text are short and engaging historical profiles that add context for the topics covered and provide a dynamic background for the subject matter.

Undergraduate text uses combinatorial approach to accommodate both math majors and liberal arts students. Multiplicativity-divisibility, quadratic congruences, additivity, more.