Home
»
Computational Aspects of Modular Forms and Galois Representations
Computational Aspects of Modular Forms and Galois Representations
Regular price
€100.99
603 verified reviews
100% verified
In stock with our UK publisher. 14-28 days
Delivery/Collection within 10-20 working days
Shipping & Delivery
Our Delivery Time Frames Explained
2-4 Working Days: Available in-stock
14-28 Working Days: On Backorder
Will Deliver When Available: On Pre-Order or Reprinting
We ship your order once all items have arrived at our warehouse and are processed. Need those 2-4 day shipping items sooner? Just place a separate order for them!
Close
A32=Franz Merkl
A32=Johan Bosman
A32=Robin de Jong
Absolute value
Accuracy and precision
Addition
Age Group_Uncategorized
Age Group_Uncategorized
Agence nationale de la recherche
Algorithm
Approximation
Arakelov theory
automatic-update
B01=Bas Edixhoven
B01=Jean-Marc Couveignes
Bosman
Calculation
Category1=Non-Fiction
Category=PBH
Category=PBMW
Characteristic polynomial
Coefficient
Cohomology
Combination
Complex number
Computation
Conjugacy class
COP=United States
Cusp form
Delivery_Delivery within 10-20 working days
Determinant
Differential form
Discriminant
Division by zero
Divisor
Divisor (algebraic geometry)
Eigenform
Eigenvalues and eigenvectors
Elliptic curve
Embedding
eq_isMigrated=2
eq_nobargain
Equation
Exponential function
Factorization
Finite field
Frobenius endomorphism
GRH
Hecke algebra
Hecke operator
Holomorphic function
Integer
Irreducible component
Jacobian variety
Language_English
Line bundle
Linear combination
Logarithm
Maximal ideal
Minimal polynomial (field theory)
Modular curve
Modular form
Monic polynomial
Morphism
Natural number
Numerical analysis
PA=Available
Polynomial
Power series
Price_€50 to €100
Prime factor
Prime number
PS=Active
Real number
Residue field
Riemann surface
Ring of integers
Schoof's algorithm
Scientific notation
Series expansion
softlaunch
Special case
Subgroup
Tangent space
Theorem
Time complexity
Turing machine
Upper and lower bounds
Variable (mathematics)
Weil pairing
Product details
- ISBN 9780691142029
- Weight: 595g
- Dimensions: 152 x 235mm
- Publication Date: 20 Jun 2011
- Publisher: Princeton University Press
- Publication City/Country: US
- Product Form: Paperback
- Language: English
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.
Bas Edixhoven is professor of mathematics at the University of Leiden. Jean-Marc Couveignes is professor of mathematics at the University of Toulouse le Mirail. Robin de Jong is assistant professor at the University of Leiden. Franz Merkl is professor of applied mathematics at the University of Munich. Johan Bosman is a postdoctoral researcher at the Institut fur Experimentelle Mathematik in Essen, Germany.
Computational Aspects of Modular Forms and Galois Representations
€100.99
