{ "id": "math/0605244", "version": "v3", "published": "2006-05-09T23:00:51.000Z", "updated": "2010-03-20T21:49:02.000Z", "title": "Computational aspects of modular forms and Galois representations", "authors": [ "Bas Edixhoven", "Jean-Marc Couveignes", "Robin de Jong", "Franz Merkl", "Johan Bosman" ], "comment": "438 pages. This book is to appear in the series 'Annals of Mathematics Studies' of Princeton University Press, after reviewing and more typesetting. Comments are very welcome. Main changes: we have added deterministic algorithms based on computations with complex numbers, we treat forms of level one and general weight.", "categories": [ "math.NT", "math.AG" ], "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.", "revisions": [ { "version": "v3", "updated": "2010-03-20T21:49:02.000Z" } ], "analyses": { "subjects": [ "11Y40", "11F80", "11G18", "14G35", "14G40" ], "keywords": [ "modular forms", "galois representations", "computational aspects", "finite field", "main result" ], "note": { "typesetting": "TeX", "pages": 438, "language": "en", "license": "arXiv", "status": "editable", "adsabs": "2006math......5244E" } } }