This marvellous and highly original book fills a significant gap in the extensive literature on classical modular forms. This is not just yet another introductory text to this theory, though it could certainly be used as such in conjunction with more traditional treatments. Its novelty lies in its computational emphasis throughout: Stein not only defines what modular forms are, but shows in illuminating detail how one can compute everything about them in practice. This is illustrated throughout the book with examples from his own (entirely free) software package SAGE, which really bring the subject to life while not detracting in any way from its theoretical beauty. The author is the leading expert in computations with modular forms, and what he says on this subject is all tried and tested and based on his extensive experience. As well as being an invaluable companion to those learning the theory in a more traditional way, this book will be a great help to those who wish to use modular forms in applications, such as in the explicit solution of Diophantine equations. There is also a useful Appendix by Gunnells on extensions to more general modular forms, which has enough in it to inspire many PhD theses for years to come. While the book's main readership will be graduate students in number theory, it will also be accessible to advanced undergraduates and useful to both specialists and non-specialists in number theory. --John E. Cremona, University of Nottingham William Stein is an associate professor of mathematics at the University of Washington at Seattle. He earned a PhD in mathematics from UC Berkeley and has held positions at Harvard University and UC San Diego. His current research interests lie in modular forms, elliptic curves, and computational mathematics.

This volume contains articles related to the work of the Simons Collaboration “Arithmetic Geometry, Number Theory, and Computation.” The papers present mathematical results and algorithms necessary for the development of large-scale databases like the L-functions and Modular Forms Database (LMFDB). The authors aim to develop systematic tools for analyzing Diophantine properties of curves, surfaces, and abelian varieties over number fields and finite fields. The articles also explore examples important for future research. Specific topics include● algebraic varieties over finite fields● the Chabauty-Coleman method● modular forms● rational points on curves of small genus● S-unit equations and integral points.

This volume contains original research articles, survey articles and lecture notes related to the Computations with Modular Forms 2011 Summer School and Conference, held at the University of Heidelberg. A key theme of the Conference and Summer School was the interplay between theory, algorithms and experiment. The 14 papers offer readers both, instructional courses on the latest algorithms for computing modular and automorphic forms, as well as original research articles reporting on the latest developments in the field. The three Summer School lectures provide an introduction to modern algorithms together with some theoretical background for computations of and with modular forms, including computing cohomology of arithmetic groups, algebraic automorphic forms, and overconvergent modular symbols. The 11 Conference papers cover a wide range of themes related to computations with modular forms, including lattice methods for algebraic modular forms on classical groups, a generalization of the Maeda conjecture, an efficient algorithm for special values of p-adic Rankin triple product L-functions, arithmetic aspects and experimental data of Bianchi groups, a theoretical study of the real Jacobian of modular curves, results on computing weight one modular forms, and more.

Modular Forms is a graduate student-level introduction to the classical theory of modular forms and computations involving modular forms, including modular functions and the theory of Hecke operators. It also includes applications of modular forms to various subjects, such as the theory of quadratic forms, the proof of Fermat's Last Theorem and the approximation of π. The text gives a balanced overview of both the theoretical and computational sides of its subject, allowing a variety of courses to be taught from it.This second edition has been revised and updated. New material on the future of modular forms as well as a chapter about longer-form projects for students has also been added.

Modular forms are tremendously important in various areas of mathematics, from number theory and algebraic geometry to combinatorics and lattices. Their Fourier coefficients, with Ramanujan's tau-function as a typical example, have deep arithmetic significance. Prior to this book, the fastest known algorithms for computing these Fourier coefficients took exponential time, except in some special cases. The case of elliptic curves (Schoof's algorithm) was at the birth of elliptic curve cryptography around 1985. This book gives an algorithm for computing coefficients of modular forms of level one in polynomial time. For example, Ramanujan's tau of a prime number p can be computed in time bounded by a fixed power of the logarithm of p. Such fast computation of Fourier coefficients is itself based on the main result of the book: the computation, in polynomial time, of Galois representations over finite fields attached to modular forms by the Langlands program. Because these Galois representations typically have a nonsolvable image, this result is a major step forward from explicit class field theory, and it could be described as the start of the explicit Langlands program. The computation of the Galois representations uses their realization, following Shimura and Deligne, in the torsion subgroup of Jacobian varieties of modular curves. The main challenge is then to perform the necessary computations in time polynomial in the dimension of these highly nonlinear algebraic varieties. Exact computations involving systems of polynomial equations in many variables take exponential time. This is avoided by numerical approximations with a precision that suffices to derive exact results from them. Bounds for the required precision--in other words, bounds for the height of the rational numbers that describe the Galois representation to be computed--are obtained from Arakelov theory. Two types of approximations are treated: one using complex uniformization and another one using geometry over finite fields. The book begins with a concise and concrete introduction that makes its accessible to readers without an extensive background in arithmetic geometry. And the book includes a chapter that describes actual computations.

This volume collects lecture notes and research articles from the International Autumn School on Computational Number Theory, which was held at the Izmir Institute of Technology from October 30th to November 3rd, 2017 in Izmir, Turkey. Written by experts in computational number theory, the chapters cover a variety of the most important aspects of the field. By including timely research and survey articles, the text also helps pave a path to future advancements. Topics include: Modular forms L-functions The modular symbols algorithm Diophantine equations Nullstellensatz Eisenstein series Notes from the International Autumn School on Computational Number Theory will offer graduate students an invaluable introduction to computational number theory. In addition, it provides the state-of-the-art of the field, and will thus be of interest to researchers interested in the field as well.