Mardigian Library
Ask a QuestionMy Library Account
Search Library Catalog - Books, DVDs & More
Limit to available
More Searches
Limit results to available items
Find more results:
Search MelCat
More Information
Computational aspects of modular forms and Galois representations : how one can compute in polynomial time the value of Ramanujan's tau at a prime / edited by Bas Edixhoven and Jean-Marc Couveignes
Alternate Title How one can compute in polynomial time the value of Ramanujan's tau at a prime
Princeton : Princeton University Press, c2011
book jacket
Location Call Number Status
 4th Floor  QA247 .C638 2011    DUE 09-15-15
Subject(s) Galois modules (Algebra)
Class field theory
Physical Description xi, 425 p. ; 25 cm
Note Includes bibliographical references (p. [403]-421) and index
Contents Introduction, main results, context / by B. Edixhoven -- Modular curves, modular forms, lattices, Galois representations / by B. Edixhoven -- First description of the algorithms / by J.-M. Couveignes and . Edixhoven -- Short introduction to heights and Arakelov theory / by B. Edixhoven and R. de Jong -- Computing complex zeros of polynomials and power series / by J.-M. Couveignes -- Computations with modular forms and Galois representations / by J. Bosman -- Polynomials for projective representations of level one forms / by J. Bosman -- Description of X₁(5l) / by B. Edixhoven -- Applying Arakelov theory / by B. Edixhoven and R. de Jong -- An upper bound for green functions on Riemann surfaces / by F. Merkl -- Bounds for Arakelov invariants of modular curves / by B. Edixhoven and R. de Jong -- Approximating Vf (sic) over the complex numbers / by J.-M Couveignes -- Computing Vf (sic) modulo p (sic) / by J.-M. Couveignes -- Computing the residual Galois representations / by B. Edixhoven -- Computing coefficients of modular forms / by B. Edixhoven
Summary "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"-- Provided by publisher
"This book represents a major step forward from explicit class field theory, and it could be described as the start of the 'explicit Langlands program'"-- Provided by publisher
Series Annals of mathematics studies ; 176
Alternate Author Edixhoven, B. (Bas), 1962-
Couveignes, Jean-Marc

Mardigian Library, 4901 Evergreen Rd.
Dearborn, MI 48128-1491 313-593-5400 fax 313-593-5561
The Regents of the University of Michigan | Non-Discrimination Policy
Copyright © The University of Michigan - Dearborn • 4901 Evergreen Road • Dearborn, Michigan 48128 • 313-593-5000
The University of Michigan - Ann Arbor | The University of Michigan - Flint | SITEMAP | DIRECTORY | CONTACT