Computational aspects of modular forms and Galois representations: how one can compute in polynomial time the value of Ramanujan's tau at a prime
Gespeichert in:
Format: | Elektronisch E-Book |
---|---|
Sprache: | English |
Veröffentlicht: |
Princeton
Princeton University Press
©2011
|
Schriftenreihe: | Annals of mathematics studies
no. 176 |
Schlagworte: | |
Online-Zugang: | FAW01 FAW02 Volltext |
Beschreibung: | "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 book represents a major step forward from explicit class field theory, and it could be described as the start of the 'explicit Langlands program'"-- Includes bibliographical references (pages 403-421) and index Introduction, main results, context / Bas Edixhoven -- Modular curves, modular forms, lattices, Galois representations / Bas Edixhoven -- First description of the algorithms / Jean-Marc Couveignes and Bas Edixhoven -- Short introduction to heights and Arakelov theory / Bas Edixhoven and Robin de Jong -- Computing complex zeros of polynomials and power series / Jean-Marc Couveignes -- Computations with modular forms and Galois representations / Johan Bosman -- Polynomials for projective representations of level one forms / Johan Bosman -- Description of X₁(5l) / Bas Edixhoven -- Applying Arakelov theory / Bas Edixhoven and Robin de Jong -- An upper bound for Green functions on Riemann surfaces / Franz Merkl -- Bounds for Arakelov invariants of modular curves / Bas Edixhoven and Robin de Jong -- Approximating V[subscript f] over the complex numbers / Jean-Marc Couveignes -- Computing V[subscript f] modulo p / Jean-Marc Couveignes -- Computing the residual Galois representations / Bas Edixhoven -- Computing coefficients of modular forms / Bas Edixhoven |
Beschreibung: | 1 Online-Ressource (xi, 425 pages) |
ISBN: | 1400839009 9781400839001 |
Internformat
MARC
LEADER | 00000nmm a2200000zcb4500 | ||
---|---|---|---|
001 | BV043152961 | ||
003 | DE-604 | ||
005 | 00000000000000.0 | ||
007 | cr|uuu---uuuuu | ||
008 | 151126s2011 |||| o||u| ||||||eng d | ||
020 | |a 1400839009 |c electronic bk. |9 1-4008-3900-9 | ||
020 | |a 9781400839001 |c electronic bk. |9 978-1-4008-3900-1 | ||
035 | |a (OCoLC)729386470 | ||
035 | |a (DE-599)BVBBV043152961 | ||
040 | |a DE-604 |b ger |e aacr | ||
041 | 0 | |a eng | |
049 | |a DE-1046 |a DE-1047 | ||
082 | 0 | |a 512/.32 |2 22 | |
084 | |a SI 830 |0 (DE-625)143195: |2 rvk | ||
084 | |a SK 230 |0 (DE-625)143225: |2 rvk | ||
245 | 1 | 0 | |a Computational aspects of modular forms and Galois representations |b how one can compute in polynomial time the value of Ramanujan's tau at a prime |c edited by Jean-Marc Couveignes and Bas Edixhoven |
264 | 1 | |a Princeton |b Princeton University Press |c ©2011 | |
300 | |a 1 Online-Ressource (xi, 425 pages) | ||
336 | |b txt |2 rdacontent | ||
337 | |b c |2 rdamedia | ||
338 | |b cr |2 rdacarrier | ||
490 | 0 | |a Annals of mathematics studies |v no. 176 | |
500 | |a "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. | ||
500 | |a 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. | ||
500 | |a 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"-- | ||
500 | |a "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'"-- | ||
500 | |a Includes bibliographical references (pages 403-421) and index | ||
500 | |a Introduction, main results, context / Bas Edixhoven -- Modular curves, modular forms, lattices, Galois representations / Bas Edixhoven -- First description of the algorithms / Jean-Marc Couveignes and Bas Edixhoven -- Short introduction to heights and Arakelov theory / Bas Edixhoven and Robin de Jong -- Computing complex zeros of polynomials and power series / Jean-Marc Couveignes -- Computations with modular forms and Galois representations / Johan Bosman -- Polynomials for projective representations of level one forms / Johan Bosman -- Description of X₁(5l) / Bas Edixhoven -- Applying Arakelov theory / Bas Edixhoven and Robin de Jong -- An upper bound for Green functions on Riemann surfaces / Franz Merkl -- Bounds for Arakelov invariants of modular curves / Bas Edixhoven and Robin de Jong -- Approximating V[subscript f] over the complex numbers / Jean-Marc Couveignes -- Computing V[subscript f] modulo p / Jean-Marc Couveignes -- Computing the residual Galois representations / Bas Edixhoven -- Computing coefficients of modular forms / Bas Edixhoven | ||
650 | 4 | |a Galois modules (Algebra) | |
650 | 4 | |a Class field theory | |
650 | 7 | |a MATHEMATICS / Advanced |2 bisacsh | |
650 | 7 | |a MATHEMATICS / Geometry / Algebraic |2 bisacsh | |
650 | 7 | |a MATHEMATICS / Algebra / Intermediate |2 bisacsh | |
650 | 7 | |a MATHEMATICS / Number Theory |2 bisacsh | |
650 | 7 | |a Class field theory |2 fast | |
650 | 7 | |a Galois modules (Algebra) |2 fast | |
650 | 4 | |a Galois modules (Algebra) | |
650 | 4 | |a Class field theory | |
650 | 0 | 7 | |a Modulform |0 (DE-588)4128299-1 |2 gnd |9 rswk-swf |
650 | 0 | 7 | |a Galois-Darstellung |0 (DE-588)4221407-5 |2 gnd |9 rswk-swf |
689 | 0 | 0 | |a Modulform |0 (DE-588)4128299-1 |D s |
689 | 0 | 1 | |a Galois-Darstellung |0 (DE-588)4221407-5 |D s |
689 | 0 | |8 1\p |5 DE-604 | |
700 | 1 | |a Couveignes, Jean-Marc |e Sonstige |4 oth | |
700 | 1 | |a Edixhoven, B. |e Sonstige |4 oth | |
776 | 0 | 8 | |i Erscheint auch als |n Druck-Ausgabe, Hardcover |z 0-691-14201-7 |
776 | 0 | 8 | |i Erscheint auch als |n Druck-Ausgabe, Paperback |z 0-691-14202-5 |
776 | 0 | 8 | |i Erscheint auch als |n Druck-Ausgabe, Hardcover |z 978-0-691-14201-2 |
776 | 0 | 8 | |i Erscheint auch als |n Druck-Ausgabe, Paperback |z 978-0-691-14202-9 |
856 | 4 | 0 | |u http://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&db=nlabk&AN=360719 |x Aggregator |3 Volltext |
912 | |a ZDB-4-EBA | ||
999 | |a oai:aleph.bib-bvb.de:BVB01-028577152 | ||
883 | 1 | |8 1\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk | |
966 | e | |u http://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&db=nlabk&AN=360719 |l FAW01 |p ZDB-4-EBA |q FAW_PDA_EBA |x Aggregator |3 Volltext | |
966 | e | |u http://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&db=nlabk&AN=360719 |l FAW02 |p ZDB-4-EBA |q FAW_PDA_EBA |x Aggregator |3 Volltext |
Datensatz im Suchindex
_version_ | 1804175614969643008 |
---|---|
any_adam_object | |
building | Verbundindex |
bvnumber | BV043152961 |
classification_rvk | SI 830 SK 230 |
collection | ZDB-4-EBA |
ctrlnum | (OCoLC)729386470 (DE-599)BVBBV043152961 |
dewey-full | 512/.32 |
dewey-hundreds | 500 - Natural sciences and mathematics |
dewey-ones | 512 - Algebra |
dewey-raw | 512/.32 |
dewey-search | 512/.32 |
dewey-sort | 3512 232 |
dewey-tens | 510 - Mathematics |
discipline | Mathematik |
format | Electronic eBook |
fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>06425nmm a2200685zcb4500</leader><controlfield tag="001">BV043152961</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">cr|uuu---uuuuu</controlfield><controlfield tag="008">151126s2011 |||| o||u| ||||||eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">1400839009</subfield><subfield code="c">electronic bk.</subfield><subfield code="9">1-4008-3900-9</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781400839001</subfield><subfield code="c">electronic bk.</subfield><subfield code="9">978-1-4008-3900-1</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)729386470</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV043152961</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">aacr</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-1046</subfield><subfield code="a">DE-1047</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">512/.32</subfield><subfield code="2">22</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">SI 830</subfield><subfield code="0">(DE-625)143195:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">SK 230</subfield><subfield code="0">(DE-625)143225:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Computational aspects of modular forms and Galois representations</subfield><subfield code="b">how one can compute in polynomial time the value of Ramanujan's tau at a prime</subfield><subfield code="c">edited by Jean-Marc Couveignes and Bas Edixhoven</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Princeton</subfield><subfield code="b">Princeton University Press</subfield><subfield code="c">©2011</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 Online-Ressource (xi, 425 pages)</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="490" ind1="0" ind2=" "><subfield code="a">Annals of mathematics studies</subfield><subfield code="v">no. 176</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">"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. </subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">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. </subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">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"--</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">"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'"--</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">Includes bibliographical references (pages 403-421) and index</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">Introduction, main results, context / Bas Edixhoven -- Modular curves, modular forms, lattices, Galois representations / Bas Edixhoven -- First description of the algorithms / Jean-Marc Couveignes and Bas Edixhoven -- Short introduction to heights and Arakelov theory / Bas Edixhoven and Robin de Jong -- Computing complex zeros of polynomials and power series / Jean-Marc Couveignes -- Computations with modular forms and Galois representations / Johan Bosman -- Polynomials for projective representations of level one forms / Johan Bosman -- Description of X₁(5l) / Bas Edixhoven -- Applying Arakelov theory / Bas Edixhoven and Robin de Jong -- An upper bound for Green functions on Riemann surfaces / Franz Merkl -- Bounds for Arakelov invariants of modular curves / Bas Edixhoven and Robin de Jong -- Approximating V[subscript f] over the complex numbers / Jean-Marc Couveignes -- Computing V[subscript f] modulo p / Jean-Marc Couveignes -- Computing the residual Galois representations / Bas Edixhoven -- Computing coefficients of modular forms / Bas Edixhoven</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Galois modules (Algebra)</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Class field theory</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">MATHEMATICS / Advanced</subfield><subfield code="2">bisacsh</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">MATHEMATICS / Geometry / Algebraic</subfield><subfield code="2">bisacsh</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">MATHEMATICS / Algebra / Intermediate</subfield><subfield code="2">bisacsh</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">MATHEMATICS / Number Theory</subfield><subfield code="2">bisacsh</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Class field theory</subfield><subfield code="2">fast</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Galois modules (Algebra)</subfield><subfield code="2">fast</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Galois modules (Algebra)</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Class field theory</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Modulform</subfield><subfield code="0">(DE-588)4128299-1</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Galois-Darstellung</subfield><subfield code="0">(DE-588)4221407-5</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Modulform</subfield><subfield code="0">(DE-588)4128299-1</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="1"><subfield code="a">Galois-Darstellung</subfield><subfield code="0">(DE-588)4221407-5</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="8">1\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Couveignes, Jean-Marc</subfield><subfield code="e">Sonstige</subfield><subfield code="4">oth</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Edixhoven, B.</subfield><subfield code="e">Sonstige</subfield><subfield code="4">oth</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Erscheint auch als</subfield><subfield code="n">Druck-Ausgabe, Hardcover</subfield><subfield code="z">0-691-14201-7</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Erscheint auch als</subfield><subfield code="n">Druck-Ausgabe, Paperback</subfield><subfield code="z">0-691-14202-5</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Erscheint auch als</subfield><subfield code="n">Druck-Ausgabe, Hardcover</subfield><subfield code="z">978-0-691-14201-2</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Erscheint auch als</subfield><subfield code="n">Druck-Ausgabe, Paperback</subfield><subfield code="z">978-0-691-14202-9</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">http://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&db=nlabk&AN=360719</subfield><subfield code="x">Aggregator</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-4-EBA</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-028577152</subfield></datafield><datafield tag="883" ind1="1" ind2=" "><subfield code="8">1\p</subfield><subfield code="a">cgwrk</subfield><subfield code="d">20201028</subfield><subfield code="q">DE-101</subfield><subfield code="u">https://d-nb.info/provenance/plan#cgwrk</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">http://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&db=nlabk&AN=360719</subfield><subfield code="l">FAW01</subfield><subfield code="p">ZDB-4-EBA</subfield><subfield code="q">FAW_PDA_EBA</subfield><subfield code="x">Aggregator</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">http://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&db=nlabk&AN=360719</subfield><subfield code="l">FAW02</subfield><subfield code="p">ZDB-4-EBA</subfield><subfield code="q">FAW_PDA_EBA</subfield><subfield code="x">Aggregator</subfield><subfield code="3">Volltext</subfield></datafield></record></collection> |
id | DE-604.BV043152961 |
illustrated | Not Illustrated |
indexdate | 2024-07-10T07:19:06Z |
institution | BVB |
isbn | 1400839009 9781400839001 |
language | English |
oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-028577152 |
oclc_num | 729386470 |
open_access_boolean | |
owner | DE-1046 DE-1047 |
owner_facet | DE-1046 DE-1047 |
physical | 1 Online-Ressource (xi, 425 pages) |
psigel | ZDB-4-EBA ZDB-4-EBA FAW_PDA_EBA |
publishDate | 2011 |
publishDateSearch | 2011 |
publishDateSort | 2011 |
publisher | Princeton University Press |
record_format | marc |
series2 | Annals of mathematics studies |
spelling | 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 Jean-Marc Couveignes and Bas Edixhoven Princeton Princeton University Press ©2011 1 Online-Ressource (xi, 425 pages) txt rdacontent c rdamedia cr rdacarrier Annals of mathematics studies no. 176 "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 book represents a major step forward from explicit class field theory, and it could be described as the start of the 'explicit Langlands program'"-- Includes bibliographical references (pages 403-421) and index Introduction, main results, context / Bas Edixhoven -- Modular curves, modular forms, lattices, Galois representations / Bas Edixhoven -- First description of the algorithms / Jean-Marc Couveignes and Bas Edixhoven -- Short introduction to heights and Arakelov theory / Bas Edixhoven and Robin de Jong -- Computing complex zeros of polynomials and power series / Jean-Marc Couveignes -- Computations with modular forms and Galois representations / Johan Bosman -- Polynomials for projective representations of level one forms / Johan Bosman -- Description of X₁(5l) / Bas Edixhoven -- Applying Arakelov theory / Bas Edixhoven and Robin de Jong -- An upper bound for Green functions on Riemann surfaces / Franz Merkl -- Bounds for Arakelov invariants of modular curves / Bas Edixhoven and Robin de Jong -- Approximating V[subscript f] over the complex numbers / Jean-Marc Couveignes -- Computing V[subscript f] modulo p / Jean-Marc Couveignes -- Computing the residual Galois representations / Bas Edixhoven -- Computing coefficients of modular forms / Bas Edixhoven Galois modules (Algebra) Class field theory MATHEMATICS / Advanced bisacsh MATHEMATICS / Geometry / Algebraic bisacsh MATHEMATICS / Algebra / Intermediate bisacsh MATHEMATICS / Number Theory bisacsh Class field theory fast Galois modules (Algebra) fast Modulform (DE-588)4128299-1 gnd rswk-swf Galois-Darstellung (DE-588)4221407-5 gnd rswk-swf Modulform (DE-588)4128299-1 s Galois-Darstellung (DE-588)4221407-5 s 1\p DE-604 Couveignes, Jean-Marc Sonstige oth Edixhoven, B. Sonstige oth Erscheint auch als Druck-Ausgabe, Hardcover 0-691-14201-7 Erscheint auch als Druck-Ausgabe, Paperback 0-691-14202-5 Erscheint auch als Druck-Ausgabe, Hardcover 978-0-691-14201-2 Erscheint auch als Druck-Ausgabe, Paperback 978-0-691-14202-9 http://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&db=nlabk&AN=360719 Aggregator Volltext 1\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk |
spellingShingle | Computational aspects of modular forms and Galois representations how one can compute in polynomial time the value of Ramanujan's tau at a prime Galois modules (Algebra) Class field theory MATHEMATICS / Advanced bisacsh MATHEMATICS / Geometry / Algebraic bisacsh MATHEMATICS / Algebra / Intermediate bisacsh MATHEMATICS / Number Theory bisacsh Class field theory fast Galois modules (Algebra) fast Modulform (DE-588)4128299-1 gnd Galois-Darstellung (DE-588)4221407-5 gnd |
subject_GND | (DE-588)4128299-1 (DE-588)4221407-5 |
title | Computational aspects of modular forms and Galois representations how one can compute in polynomial time the value of Ramanujan's tau at a prime |
title_auth | Computational aspects of modular forms and Galois representations how one can compute in polynomial time the value of Ramanujan's tau at a prime |
title_exact_search | Computational aspects of modular forms and Galois representations how one can compute in polynomial time the value of Ramanujan's tau at a prime |
title_full | 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 Jean-Marc Couveignes and Bas Edixhoven |
title_fullStr | 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 Jean-Marc Couveignes and Bas Edixhoven |
title_full_unstemmed | 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 Jean-Marc Couveignes and Bas Edixhoven |
title_short | Computational aspects of modular forms and Galois representations |
title_sort | computational aspects of modular forms and galois representations how one can compute in polynomial time the value of ramanujan s tau at a prime |
title_sub | how one can compute in polynomial time the value of Ramanujan's tau at a prime |
topic | Galois modules (Algebra) Class field theory MATHEMATICS / Advanced bisacsh MATHEMATICS / Geometry / Algebraic bisacsh MATHEMATICS / Algebra / Intermediate bisacsh MATHEMATICS / Number Theory bisacsh Class field theory fast Galois modules (Algebra) fast Modulform (DE-588)4128299-1 gnd Galois-Darstellung (DE-588)4221407-5 gnd |
topic_facet | Galois modules (Algebra) Class field theory MATHEMATICS / Advanced MATHEMATICS / Geometry / Algebraic MATHEMATICS / Algebra / Intermediate MATHEMATICS / Number Theory Modulform Galois-Darstellung |
url | http://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&db=nlabk&AN=360719 |
work_keys_str_mv | AT couveignesjeanmarc computationalaspectsofmodularformsandgaloisrepresentationshowonecancomputeinpolynomialtimethevalueoframanujanstauataprime AT edixhovenb computationalaspectsofmodularformsandgaloisrepresentationshowonecancomputeinpolynomialtimethevalueoframanujanstauataprime |