Computational aspects of modular forms and Galois representations
From MaRDI portal
Publication:6477155
arXivmath/0605244MaRDI QIDQ6477155FDOQ6477155
Authors: Bas Edixhoven, Jean-Marc Couveignes, Robin de Jong, Franz Merkl, Johan Bosman 
Publication date: 9 May 2006
Abstract: This is a book about computational aspects of modular forms and the Galois representations attached to them. The main result is the following: Galois representations over finite fields attached to modular forms of level one can, in almost all cases, be computed in polynomial time in the weight and the size of the finite field. As a consequence, coefficients of modular forms can be computed fast via congruences, as in Schoof's algorithm for the number of points of elliptic curves over finite fields. The most important feature of the proof of the main result is that exact computations involving systems of polynomial equations in many variables are avoided by approximations and height bounds, i.e., bounds for the accuracy that is necessary to derive exact values from the approximations.
Galois representations (11F80) Algebraic number theory computations (11Y40) Modular and Shimura varieties (14G35) Arithmetic varieties and schemes; Arakelov theory; heights (14G40) Arithmetic aspects of modular and Shimura varieties (11G18)
This page was built for publication: Computational aspects of modular forms and Galois representations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6477155)
