Moduli theory is the study of how objects, typically in algebraic geometry but sometimes in other areas of mathematics, vary in families and is fundamental to an understanding of the objects themselves. First formalised in the 1960s, it represents a significant topic of modern mathematical research with strong connections to many areas of mathematics (including geometry, topology and number theory) and other disciplines such as theoretical physics. This book, which arose from a programme at the Isaac Newton Institute in Cambridge, is an ideal way for graduate students and more experienced researchers to become acquainted with the wealth of ideas and problems in moduli theory and related areas. The reader will find articles on both fundamental material and cutting-edge research topics, such as: algebraic stacks; BPS states and the P = W conjecture; stability conditions; derived differential geometry; and counting curves in algebraic varieties, all written by leading experts.

The notes in this volume correspond to advanced courses held at the Centre de Recerca Matematica as part of the research program in Arithmetic Geometry in the 2009-2010 academic year.

The notes by Laurent Berger provide an introduction to "p"-adic Galois representations and Fontaine rings, which are especially useful for describing many local deformation rings at "p" that arise naturally in Galois deformation theory.

The notes by Gebhard Bockle offer a comprehensive course on Galois deformation theory, starting from the foundational results of Mazur and discussing in detail the theory of pseudo-representations and their deformations, local deformations at places l p and local deformations at "p" which are flat. In the last section, the results of Bockle and Kisin on presentations of global deformation rings over local ones are discussed.

The notes by Mladen Dimitrov present the basics of the arithmetic theory of Hilbert modular forms and varieties, with an emphasis on the study of the images of the attached Galois representations, on modularity lifting theorems over totally real number fields, and on the cohomology of Hilbert modular varieties with integral coefficients.

The notes by Lassina Dembele and John Voight describe methods for performing explicit computations in spaces of Hilbert modular forms. These methods depend on the Jacquet-Langlands correspondence and on computations in spaces of quaternionic modular forms, both for the case of definite and indefinite quaternion algebras. Several examples are given, and applications to modularity of Galois representations are discussed.

The notes by Tim Dokchitser describe the proof, obtained by the author in a joint project with Vladimir Dokchitser, of the parity conjecture for elliptic curves over number fields under the assumption of finiteness of the Tate-Shafarevich group. The statement of the Birch and Swinnerton-Dyer conjecture is included, as well as a detailed study of local and global root numbers of elliptic curves and their classification."

Adapted from a modular undergraduate course on computational mathematics, Concise Computer Mathematics delivers an easily accessible, self-contained introduction to the basic notions of mathematics necessary for a computer science degree. The text reflects the need to quickly introduce students from a variety of educational backgrounds to a number of essential mathematical concepts. The material is divided into four units: discrete mathematics (sets, relations, functions), logic (Boolean types, truth tables, proofs), linear algebra (vectors, matrices and graphics), and special topics (graph theory, number theory, basic elements of calculus). The chapters contain a brief theoretical presentation of the topic, followed by a selection of problems (which are direct applications of the theory) and additional supplementary problems (which may require a bit more work). Each chapter ends with answers or worked solutions for all of the problems.

This book provides a lucid exposition of the connections between non-commutative geometry and the famous Riemann Hypothesis, focusing on the theory of one-dimensional varieties over a finite field. The reader will encounter many important aspects of the theory, such as Bombieri's proof of the Riemann Hypothesis for function fields, along with an explanation of the connections with Nevanlinna theory and non-commutative geometry. The connection with non-commutative geometry is given special attention, with a complete determination of the Weil terms in the explicit formula for the point counting function as a trace of a shift operator on the additive space, and a discussion of how to obtain the explicit formula from the action of the idele class group on the space of adele classes. The exposition is accessible at the graduate level and above, and provides a wealth of motivation for further research in this area.

Peter Gustav Lejeune Dirichlet (1805-59) may be considered the father of modern number theory. He studied in Paris, coming under the influence of mathematicians like Fourier and Legendre, and then taught at Berlin and Goettingen universities, where he was the successor to Gauss. This book contains lectures on number theory given by Dirichlet in 1856-7. They include his famous proofs of the class number theorem for binary quadratic forms and the existence of an infinity of primes in every appropriate arithmetical progression. The material was first published in 1863 by Richard Dedekind (1831-1916), professor at Braunschweig, who had been a junior colleague of Dirichlet at Goettingen. The second edition appeared in 1871; this reissue is of the third, revised and expanded, edition of 1879; a fourth edition appeared as late as 1894. The appendices contain further work by both Dirichlet and Dedekind.

Arithmetic algebraic geometry is in a fascinating stage of growth, providing a rich variety of applications of new tools to both old and new problems. Representative of these recent developments is the notion of Arakelov geometry, a way of "completing" a variety over the ring of integers of a number field by adding fibres over the Archimedean places. Another is the appearance of the relations between arithmetic geometry and Nevanlinna theory, or more precisely between diophantine approximation theory and the value distribution theory of holomorphic maps. Research mathematicians and graduate students in algebraic geometry and number theory will find a valuable and lively view of the field in this state-of-the-art selection.

This text offers a collection of survey and research papers by leading specialists in the field documenting the current understanding of higher dimensional varieties. Recently, it has become clear that ideas from many branches of mathematics can be successfully employed in the study of rational and integral points. This book will be very valuable for researchers from these various fields who have an interest in arithmetic applications, specialists in arithmetic geometry itself, and graduate students wishing to pursue research in this area.

This modern introduction to the foundations of logic and mathematics not only takes theory into account, but also treats in some detail applications that have a substantial impact on everyday life (loans and mortgages, bar codes, public-key cryptography). A first college-level introduction to logic, proofs, sets, number theory, and graph theory, and an excellent self-study reference and resource for instructors.

A look at solving problems in three areas of classical elementary mathematics: equations and systems of equations of various kinds, algebraic inequalities, and elementary number theory, in particular divisibility and diophantine equations. In each topic, brief theoretical discussions are followed by carefully worked out examples of increasing difficulty, and by exercises which range from routine to rather more challenging problems. While it emphasizes some methods that are not usually covered in beginning university courses, the book nevertheless teaches techniques and skills which are useful beyond the specific topics covered here. With approximately 330 examples and 760 exercises.

Prime numbers are the multiplicative building blocks of natural numbers. Understanding their overall influence and especially their distribution gives rise to central questions in mathematics and physics. In particular their finer distribution is closely connected with the Riemann hypothesis, the most important unsolved problem in the mathematical world. Assuming only subjects covered in a standard degree in mathematics, the authors comprehensively cover all the topics met in first courses on multiplicative number theory and the distribution of prime numbers. They bring their extensive and distinguished research expertise to bear in preparing the student for intelligent reading of the more advanced research literature. This 2006 text, which is based on courses taught successfully over many years at Michigan, Imperial College and Pennsylvania State, is enriched by comprehensive historical notes and references as well as over 500 exercises.

From the original hard cover edition:

In the modern age of almost universal computer usage, practically every individual in a technologically developed society has routine access to the most up-to-date cryptographic technology that exists, the so-called RSA public-key cryptosystem. A major component of this system is the factorization of large numbers into their primes. Thus an ancient number-theory concept now plays a crucial role in communication among millions of people who may have little or no knowledge of even elementary mathematics.

Hans Riesel's highly successful first edition of this book has now been enlarged and updated with the goal of satisfying the needs of researchers, students, practitioners of cryptography, and non-scientific readers with a mathematical inclination. It includes important advances in computational prime number theory and in factorization as well as re-computed and enlarged tables, accompanied by new tables reflecting current research by both the author and his coworkers and by independent researchers.

The book treats four fundamental problems: the number of primes below a given limit, the approximate number of primes, the recognition of primes and the factorization of large numbers. The author provides explicit algorithms and computer programs, and has attempted to discuss as many of the classically important results as possible, as well as the most recent discoveries. The programs include are written in PASCAL to allow readers to translate the programs into the language of their own computers.

The independent structure of each chapter of the book makes it highly readable for a wide variety of mathematicians, students of applied number theory, and others interested in both study and research in number theory and cryptography. "

The study of arithmetic differential operators is a novel and promising area of mathematics. This complete introduction to the subject starts with the basics: a discussion of p-adic numbers and some of the classical differential analysis on the field of p-adic numbers leading to the definition of arithmetic differential operators on this field. Buium's theory of arithmetic jet spaces is then developed succinctly in order to define arithmetic operators in general. Features of the book include a comparison of the behaviour of these operators over the p-adic integers and their behaviour over the unramified completion, and a discussion of the relationship between characteristic functions of p-adic discs and arithmetic differential operators that disappears as soon as a single root of unity is adjoined to the p-adic integers. This book is essential reading for researchers and graduate students who want a first introduction to arithmetic differential operators over the p-adic integers.

The theory of finite fields encompasses algebra, combinatorics, and number theory and has furnished widespread applications in other areas of mathematics and computer science. This book is a collection of selected topics in the theory of finite fields and related areas. The topics include basic facts about finite fields, polynomials over finite fields, Gauss sums, algebraic number theory and cyclotomic fields, zeros of polynomials over finite fields, and classical groups over finite fields. The book is mostly self-contained, and the material covered is accessible to readers with the knowledge of graduate algebra; the only exception is a section on function fields. Each chapter is supplied with a set of exercises. The book can be adopted as a text for a second year graduate course or used as a reference by researchers.

This self-contained introduction to modern cryptography emphasizes the mathematics behind the theory of public key cryptosystems and digital signature schemes. The book focuses on these key topics while developing the mathematical tools needed for the construction and security analysis of diverse cryptosystems. Only basic linear algebra is required of the reader; techniques from algebra, number theory, and probability are introduced and developed as required. This text provides an ideal introduction for mathematics and computer science students to the mathematical foundations of modern cryptography. The book includes an extensive bibliography and index; supplementary materials are available online. The book covers a variety of topics that are considered central to mathematical cryptography. Key topics include: classical cryptographic constructions, such as Diffie-Hellmann key exchange, discrete logarithm-based cryptosystems, the RSA cryptosystem, and digital signatures; fundamental mathematical tools for cryptography, including primality testing, factorization algorithms, probability theory, information theory, and collision algorithms; an in-depth treatment of important cryptographic innovations, such as elliptic curves, elliptic curve and pairing-based cryptography, lattices, lattice-based cryptography, and the NTRU cryptosystem. The second edition of An Introduction to Mathematical Cryptography includes a significant revision of the material on digital signatures, including an earlier introduction to RSA, Elgamal, and DSA signatures, and new material on lattice-based signatures and rejection sampling. Many sections have been rewritten or expanded for clarity, especially in the chapters on information theory, elliptic curves, and lattices, and the chapter of additional topics has been expanded to include sections on digital cash and homomorphic encryption. Numerous new exercises have been included.

This book was first published in 1952. It is largely devoted to the object of proving the Vinogradov-Goldbach theorem: that every sufficiently large odd number is the sum of three primes. In the course of proving this, T. Estermann, formerly Professor of Mathematics at the University of London, supplies numerous theories and results on characters and primes in arithmetic progressions. The author also ensures that the proofs presented to the reader are both clear and remarkably concise. The volume at hand addresses the Riemann zeta function, primes in arithmetical progression, and the ways in which odd numbers can be represented as the sum of three primes. At the end of the book is an index and a seven-page section of theorems and formulae for reference. This volume is both interesting and accessible, and will appeal to all with an enthusiasm for mathematics and problem solving.

Number theory is one of the oldest and most appealing areas of mathematics. Computation has always played a role in number theory, a role which has increased dramatically in the last 20 or 30 years, both because of the advent of modern computers, and because of the discovery of surprising and powerful algorithms. As a consequence, algorithmic number theory has gradually emerged as an important and distinct field with connections to computer science and cryptography as well as other areas of mathematics. This 2008 text provides a comprehensive introduction to algorithmic number theory for beginning graduate students, written by the leading experts in the field. It includes several articles that cover the essential topics in this area, and in addition, there are contributions pointing in broader directions, including cryptography, computational class field theory, zeta functions and L-series, discrete logarithm algorithms, and quantum computing.

An undergraduate-level introduction to number theory, with the emphasis on fully explained proofs and examples. Exercises, together with their solutions are integrated into the text, and the first few chapters assume only basic school algebra. Elementary ideas about groups and rings are then used to study groups of units, quadratic residues and arithmetic functions with applications to enumeration and cryptography. The final part, suitable for third-year students, uses ideas from algebra, analysis, calculus and geometry to study Dirichlet series and sums of squares. In particular, the last chapter gives a concise account of Fermat's Last Theorem, from its origin in the ancient Babylonian and Greek study of Pythagorean triples to its recent proof by Andrew Wiles.

1. People were already interested in prime numbers in ancient times, and the first result concerning the distribution of primes appears in Euclid's Elemen ta, where we find a proof of their infinitude, now regarded as canonical. One feels that Euclid's argument has its place in The Book, often quoted by the late Paul ErdOs, where the ultimate forms of mathematical arguments are preserved. Proofs of most other results on prime number distribution seem to be still far away from their optimal form and the aim of this book is to present the development of methods with which such problems were attacked in the course of time. This is not a historical book since we refrain from giving biographical details of the people who have played a role in this development and we do not discuss the questions concerning why each particular person became in terested in primes, because, usually, exact answers to them are impossible to obtain. Our idea is to present the development of the theory of the distribu tion of prime numbers in the period starting in antiquity and concluding at the end of the first decade of the 20th century. We shall also present some later developments, mostly in short comments, although the reader will find certain exceptions to that rule. The period of the last 80 years was full of new ideas (we mention only the applications of trigonometrical sums or the advent of various sieve methods) and certainly demands a separate book."

In this book, the author writes freely and often humorously about his life, beginning with his earliest childhood days. He describes his survival of American bombing raids when he was a teenager in Japan, his emergence as a researcher in a post-war university system that was seriously deficient, and his life as a mature mathematician in Princeton and in the international academic community. Every page of this memoir contains personal observations and striking stories. Such luminaries as Chevalley, Oppenheimer, Siegel, and Weil figure prominently in its anecdotes.

Goro Shimura is Professor Emeritus of Mathematics at Princeton University. In 1996, he received the Leroy P. Steele Prize for Lifetime Achievement from the American Mathematical Society. He is the author of Elementary Dirichlet Series and Modular Forms (Springer 2007), Arithmeticity in the Theory of Automorphic Forms (AMS 2000), and Introduction to the Arithmetic Theory of Automorphic Functions (Princeton University Press 1971)."

V. I. Arnold reveals some unexpected connections between such apparently unrelated theories as Galois fields, dynamical systems, ergodic theory, statistics, chaos and the geometry of projective structures on finite sets. The author blends experimental results with examples and geometrical explorations to make these findings accessible to a broad range of mathematicians, from undergraduate students to experienced researchers.

This easy-to-read 2010 book demonstrates how a simple geometric idea reveals fascinating connections and results in number theory, the mathematics of polyhedra, combinatorial geometry, and group theory. Using a systematic paper-folding procedure it is possible to construct a regular polygon with any number of sides. This remarkable algorithm has led to interesting proofs of certain results in number theory, has been used to answer combinatorial questions involving partitions of space, and has enabled the authors to obtain the formula for the volume of a regular tetrahedron in around three steps, using nothing more complicated than basic arithmetic and the most elementary plane geometry. All of these ideas, and more, reveal the beauty of mathematics and the interconnectedness of its various branches. Detailed instructions, including clear illustrations, enable the reader to gain hands-on experience constructing these models and to discover for themselves the patterns and relationships they unearth.

The first edition of this work has become the standard introduction to the theory of p-adic numbers at both the advanced undergraduate and beginning graduate level. This second edition includes a deeper treatment of p-adic functions in Ch. 4 to include the Iwasawa logarithm and the p-adic gamma-function, the rearrangement and addition of some exercises, the inclusion of an extensive appendix of answers and hints to the exercises, as well as numerous clarifications.

Pell's equation is part of a central area of algebraic number theory that treats quadratic forms and the structure of the rings of integers in algebraic number fields. It is an ideal topic to lead college students, as well as some talented and motivated high school students, to a better appreciation of the power of mathematical technique. Even at the specific level of quadratic diophantine equations, there are unsolved problems, and the higher degree analogues of Pell's equation, particularly beyond the third, do not appear to have been well studied. In this focused exercise book, the topic is motivated and developed through sections of exercises which will allow the readers to recreate known theory and provide a focus for their algebraic practice. There are several explorations that encourage the reader to embark on their own research. A high school background in mathematics is all that is needed to get into this book, and teachers and others interested in mathematics who do not have (or have forgotten) a background in advanced mathematics may find that it is a suitable vehicle for keeping up an independent interest in the subject.

The theory of sets of multiples, a subject which lies at the intersection of analytic and probabilistic number theory, has seen much development since the publication of Sequences by Halberstam and Roth nearly thirty years ago. The area is rich in problems, many of them still unsolved or arising from current work. The author sets out to give a coherent, essentially self-contained account of the existing theory and at the same time to bring the reader to the frontiers of research. One of the fascinations of the theory is the variety of methods applicable to it, which include Fourier analysis, group theory, high and ultra-low moments, probability and elementary inequalities, as well as several branches of number theory. This Tract is the first devoted to the subject, and will be of value to research workers or graduate students in number theory.