Computational aspects of modular forms and Galois representations how one can compute in polynomial time the value of Ramanujan's tau at a prime.
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 k...
Uložené v:
| Hlavní autori: | , |
|---|---|
| Médium: | E-kniha Kniha |
| Jazyk: | English |
| Vydavateľské údaje: |
Princeton, N.J
Princeton University Press
2011
|
| Vydanie: | 1 |
| Edícia: | Annals of Mathematics Studies |
| Predmet: | |
| ISBN: | 9780691142029, 0691142025, 9780691142012, 0691142017, 9781400839001, 1400839009 |
| On-line prístup: | Získať plný text |
| Tagy: |
Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
|
| Abstract | 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. |
|---|---|
| AbstractList | No detailed description available for "Computational Aspects of Modular Forms and Galois Representations". 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. 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. 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. |
| Author | Couveignes, Jean-Marc Edixhoven, Bas |
| Author_xml | – sequence: 1 fullname: Couveignes, Jean-Marc – sequence: 2 fullname: Couveignes, Jean-Marc – sequence: 3 fullname: Edixhoven, Bas |
| BackLink | https://cir.nii.ac.jp/crid/1130282271963897600$$DView record in CiNii |
| BookMark | eNplkU1v1DAQho2giLbskRNCygEVcVgYfyS2j-2qFKRK9ABcLcd2ttk6cbAdqvLr6zYroQofxjN6H78ej4_QizGMDqE3GD7hGtefJReYAQgqAfAztHpSP3-soZEYMwJEHqAjAhigpljUL9EhJ5KKhnF4hVYp7aAsJijj8hCdbsIwzVnnPozaVzpNzuRUha4agp29jlUX4pAqPdrqQvvQpyq6KbrkxuVQeo0OOu2TW-33Y_Try_mPzdf15feLb5vTy7XmDUiyltx2xjDmLAjrXKNJ50hXctzhRlpjqBSk6Syz3DJDJGuBWm1JSzUwxiw9Rh8XY51u3G26Dj4n9ce7NoSbpJ4M5B97q3120bptnO9KogYdzX_sycJOMfyeXcrq0dKUF0bt1fnZpuFA2QP4dg-66N02qOVmTmtMaFHfL-rY98r0DxFjCkQQwrFsqJBlDlCwdwu2SznEvcVOmZx5_Du0Rf-w6P12mlvfp-t-3Kop9qXzO3X18-qs_B7GNaH3ynmcMw |
| ContentType | eBook Book |
| Copyright | 2011 Princeton University Press |
| Copyright_xml | – notice: 2011 Princeton University Press |
| DBID | E06 RYH YSPEL |
| DEWEY | 512/.32 |
| DOI | 10.1515/9781400839001 |
| DatabaseName | Princeton University Press eBooks CiNii Complete Perlego |
| DatabaseTitleList | |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Mathematics |
| EISBN | 9781400839001 1400839009 |
| Edition | 1 |
| Editor | Bas Edixhoven Jean-Marc Couveignes |
| Editor_xml | – sequence: 1 fullname: Edixhoven, Bas – sequence: 2 fullname: Couveignes, Jean-Marc |
| ExternalDocumentID | 9781400839001 EBC670341 735123 BB05561367 j.ctt7rzmb PUPB0001152 |
| Genre | Electronic books |
| GroupedDBID | -VX 05P 089 20A 92K A4J AABBV AAFKH AAGED AAMYY AANYM AAUSU AAZEP ABARN ABCYV ABCYY ABGJO ABHWV ABIAV ABIWA ABMRC ABONK ABQNV ABRSK ABYBY ACBYE ACEOT ACFYN ACHKM ACHUA ACISH ACLGV ACQYL ACRAN ADDXO ADUON ADVEM ADVQQ AEAED AECLD AEDVL AEEBL AERYV AEYCP AFHFQ AFRFP AGLEC AHWGJ AIGZA AILDO AIOLA AIUUY AIXPE AJFER ALMA_UNASSIGNED_HOLDINGS AMYDA APVFW ARPAB ARSQP ATDNW AZZ BBABE BFATZ BFRBX CDLGT CZZ DGSIF DHNOV DUGUG E06 EBSCA EBZNK ECOWB EWWBQ FURLO GEOUK HELXT I4C J-X JLPMJ JSXJJ KBOFU L7C MYL NRCWT O7H PQQKQ QD8 SUPCW TI5 UE6 XI1 YSPEL ~H6 ~I6 38. AFTHB RYH AVGCG 6XM BJTYN |
| ID | FETCH-LOGICAL-a76092-97dfcc44ed08dee6a2fe2f08d1f169dcc39826fd4d7d4c294b03dad2b3a0444d3 |
| ISBN | 9780691142029 0691142025 9780691142012 0691142017 9781400839001 1400839009 |
| IngestDate | Fri Nov 08 05:49:36 EST 2024 Fri Nov 21 19:11:47 EST 2025 Wed Nov 26 05:08:55 EST 2025 Tue Dec 02 18:49:38 EST 2025 Thu Jun 26 22:50:40 EDT 2025 Tue Aug 26 07:09:09 EDT 2025 Wed Jul 30 03:13:21 EDT 2025 |
| IsPeerReviewed | false |
| IsScholarly | false |
| Keywords | Polynomial Cusp form Differential form Bosman Minimal polynomial (field theory) Turing machine Subgroup Hecke operator Conjugacy class Divisor (algebraic geometry) Combination Eigenvalues and eigenvectors Series expansion Calculation Accuracy and precision Tangent space Discriminant Finite field Addition Approximation Real number Schoof's algorithm Determinant Holomorphic function Cohomology Ring of integers Algorithm Riemann surface Division by zero Numerical analysis Computation Maximal ideal Special case GRH Time complexity Prime number Natural number Weil pairing Characteristic polynomial Residue field Embedding Power series Exponential function Upper and lower bounds Hecke algebra Linear combination Eigenform Logarithm Monic polynomial Theorem Frobenius endomorphism Prime factor Coefficient Irreducible component Line bundle Equation Morphism Modular curve Elliptic curve Factorization Complex number Integer Jacobian variety Variable (mathematics) Arakelov theory Divisor Scientific notation Modular form Agence nationale de la recherche Absolute value |
| LCCN | 2010053185 |
| LCCallNum | QA247 |
| LCCallNum_Ident | QA247 |
| Language | English |
| LinkModel | OpenURL |
| MergedId | FETCHMERGED-LOGICAL-a76092-97dfcc44ed08dee6a2fe2f08d1f169dcc39826fd4d7d4c294b03dad2b3a0444d3 |
| Notes | "With contributions by Johan Bosman, Jean-Marc Couveignes, Bas Edixhoven, Robin de Jong, and Franz Merkl"--Cover Includes bibliographical references (p. [403]-421) and index |
| OCLC | 729386470 |
| PQID | EBC670341 |
| PageCount | 438 |
| ParticipantIDs | askewsholts_vlebooks_9781400839001 walterdegruyter_marc_9781400839001 proquest_ebookcentral_EBC670341 perlego_books_735123 nii_cinii_1130282271963897600 jstor_books_j_ctt7rzmb igpublishing_primary_PUPB0001152 |
| ProviderPackageCode | J-X |
| PublicationCentury | 2000 |
| PublicationDate | 2011. 20110531 c2011 2011 [2011] 2011-05-31 |
| PublicationDateYYYYMMDD | 2011-01-01 2011-05-31 |
| PublicationDate_xml | – year: 2011 text: 2011 |
| PublicationDecade | 2010 |
| PublicationPlace | Princeton, N.J |
| PublicationPlace_xml | – name: Princeton, N.J – name: Princeton – name: Princeton, NJ |
| PublicationSeriesTitle | Annals of Mathematics Studies |
| PublicationYear | 2011 |
| Publisher | Princeton University Press |
| Publisher_xml | – name: Princeton University Press |
| RestrictionsOnAccess | restricted access |
| SSID | ssj0000483479 |
| Score | 2.1740916 |
| Snippet | Modular forms are tremendously important in various areas of mathematics, from number theory and algebraic geometry to combinatorics and lattices. Their... No detailed description available for "Computational Aspects of Modular Forms and Galois Representations". |
| SourceID | askewsholts walterdegruyter proquest perlego nii jstor igpublishing |
| SourceType | Aggregation Database Publisher |
| SubjectTerms | Absolute value Accuracy and precision Addition Agence nationale de la recherche Algorithm Approximation Arakelov theory Bosman Calculation Characteristic polynomial Class field theory Coefficient Cohomology Combination Complex number Computation Conjugacy class Cusp form Determinant Differential form Discriminant Division by zero Divisor Divisor (algebraic geometry) Eigenform Eigenvalues and eigenvectors Elliptic curve Embedding Equation Exponential function Factorization Finite field Frobenius endomorphism Galois modules (Algebra) GRH Hecke algebra Hecke operator Holomorphic function Integer Irreducible component Jacobian variety Line bundle Linear combination Logarithm MATHEMATICS MATHEMATICS / Geometry / Algebraic MATHEMATICS / Number Theory Maximal ideal Minimal polynomial (field theory) Modular curve Modular form Monic polynomial Morphism Natural number Numerical analysis Polynomial Power series Prime factor Prime number Real number Residue field Riemann surface Ring of integers Schoof's algorithm Scientific notation Series expansion Special case Subgroup Tangent space Theorem Time complexity Turing machine Upper and lower bounds Variable (mathematics) Weil pairing |
| SubjectTermsDisplay | Galois modules (Algebra) |
| Subtitle | how one can compute in polynomial time the value of Ramanujan's tau at a prime. |
| TableOfContents | Computational aspects of modular forms and Galois representations: how one can compute in polynomial time the value of Ramanujan's tau at a prime -- Contents -- Preface -- Chapter One: Introduction, main results, context -- Chapter Two: Modular curves, modular forms, lattices, Galois representations -- Chapter Three: First description of the algorithms -- Chapter Four: Short introduction to heights and Arakelov theory -- Chapter Five: Computing complex zeros of polynomials and power series -- Chapter Six: Computations with modular forms and Galois representations -- Chapter Seven: Polynomials for projective representations of level one forms -- Chapter Eight: Description of X1(5l) -- Chapter Nine: Applying Arakelov theory -- Chapter Ten: An upper bound for Green functions on Riemann surfaces -- Chapter Eleven: Bounds for Arakelov invariants of modular curves -- Chapter Twelve: Approximating Vf over the complex numbers -- Chapter Thirteen: Computing Vf modulo p -- Chapter Fourteen: Computing the residual Galois representations -- Chapter Fifteen: Computing coefficients of modular forms -- Epilogue -- Bibliography -- Index Front Matter Table of Contents Preface ACKNOWLEDGMENTS AUTHOR INFORMATION DEPENDENCIES BETWEEN THE CHAPTERS Chapter One: Introduction, main results, context Chapter Two: Modular curves, modular forms, lattices, Galois representations Chapter Three: First description of the algorithms Chapter Four: Short introduction to heights and Arakelov theory Chapter Five: Computing complex zeros of polynomials and power series Chapter Six: Computations with modular forms and Galois representations Chapter Seven: Polynomials for projective representations of level one forms Chapter Eight: Description of X₁(5l) Chapter Nine: Applying Arakelov theory Chapter Ten: An upper bound for Green functions on Riemann surfaces Chapter Eleven: Bounds for Arakelov invariants of modular curves Chapter Twelve: Approximating Vf over the complex numbers Chapter Thirteen: Computing Vf modulo p Chapter Fourteen: Computing the residual Galois representations Chapter Fifteen: Computing coefficients of modular forms Epilogue Bibliography Index 8.1 Construction of a suitable cuspidal divisor on x[sub(1)].5l -- 8.2 The exact setup for the level one case -- Chapter 9. Applying Arakelov theory -- 9.1 Relating heights to intersection numbers -- 9.2 Controlling D[sub(x)]-D[sub(0)] -- Chapter 10. An upper bound for Green functions on Riemann surfaces -- Chapter 11. Bounds for Arakelov invariants of modular curves -- 11.1 Bounding the height of X[sub(1)](pl) -- 11.2 Bounding the theta function on Pic[sup(g-1)](X[sub(1)](pl)) -- 11.3 Upper bounds for Arakelov Green functions on the curves X[sub(1)](pl) -- 11.4 Bounds for intersection numbers on X[sub(1)](pl) -- 11.5 A bound for h(x[sup(& -- #8242 -- )][sub(l)](Q)) in terms of h(b([sub(l)](Q)) -- 11.6 An integral over X[sub(1)](5l) -- 11.7 Final estimates of the Arakelov contribution -- Chapter 12. Approximating V[sub(f)] over the complex numbers -- 12.1 Points, divisors, and coordinates on X -- 12.2 The lattice of periods -- 12.3 Modular functions -- 12.4 Power series -- 12.5 Jacobian and Wronskian determinants of series -- 12.6 A simple quantitative study of the Jacobi map -- 12.7 Equivalence of various norms -- 12.8 An elementary operation in the Jacobian variety -- 12.9 Arithmetic operations in the Jacobian variety -- 12.10 The inverse Jacobi problem -- 12.11 The algebraic conditioning -- 12.12 Heights -- 12.13 Bounding the error in X[sub(g)] -- 12.14 Final result of this chapter -- Chapter 13. Computing V[sub(f)] modulo p -- 13.1 Basic algorithms for plane curves -- 13.2 A first approach to picking random divisors -- 13.3 Pairings -- 13.4 Divisible groups -- 13.5 The Kummer map -- 13.6 Linearization of torsion classes -- 13.7 Computing V[sub(f)] modulo p -- Chapter 14. Computing the residual Galois representations -- 14.1 Main result -- 14.2 Reduction to irreducible representations -- 14.3 Reduction to torsion in Jacobians Cover -- Title -- Copyright -- Contents -- Preface -- Acknowledgments -- Author information -- Dependencies between the chapters -- Chapter 1. Introduction, main results, context -- 1.1 Statement of the main results -- 1.2 Historical context: Schoof's algorithm -- 1.3 Schoof's algorithm described in terms of étale cohomology -- 1.4 Some natural new directions -- 1.5 More historical context: congruences for Ramanujan's & -- #964 -- -function -- 1.6 Comparison with p-adic methods -- Chapter 2. Modular curves, modular forms, lattices, Galois representations -- 2.1 Modular curves -- 2.2 Modular forms -- 2.3 Lattices and modular forms -- 2.4 Galois representations attached to eigenforms -- 2.5 Galois representations over finite fields, and reduction to torsion in Jacobians -- Chapter 3. First description of the algorithms -- Chapter 4. Short introduction to heights and Arakelov theory -- 4.1 Heights on Q and Q -- 4.2 Heights on projective spaces and on varieties -- 4.3 The Arakelov perspective on height functions -- 4.4 Arithmetic surfaces, intersection theory, and arithmetic Riemann-Roch -- Chapter 5. Computing complex zeros of polynomials and power series -- 5.1 Polynomial time complexity classes -- 5.2 Computing the square root of a positive real number -- 5.3 Computing the complex roots of a polynomial -- 5.4 Computing the zeros of a power series -- Chapter 6. Computations with modular forms and Galois representations -- 6.1 Modular symbols -- 6.2 Intermezzo: Atkin-Lehner operators -- 6.3 Basic numerical evaluations -- 6.4 Numerical calculations and Galois representations -- Chapter 7. Polynomials for projective representations of level one forms -- 7.1 Introduction -- 7.2 Galois representations -- 7.3 Proof of the theorem -- 7.4 Proof of the corollary -- 7.5 The table of polynomials -- Chapter 8. Description of X[sub(1)](5l) 14.4 Computing the Q(& -- #950l -- l)-algebra corresponding to V -- 14.5 Computing the vector space structure -- 14.6 Descent to Q -- 14.7 Extracting the Galois representation -- 14.8 A probabilistic variant -- Chapter 15. Computing coefficients of modular forms -- 15.1 Computing & -- #964 -- (p) in time polynomial in log p -- 15.2 Computing Tn for large n and large weight -- 15.3 An application to quadratic forms -- Epilogue -- Bibliography -- Index -- Non-alphabetic symbols -- Greek symbols -- Roman symbols -- Words -- A -- C -- D -- E -- F -- G -- H -- L -- M -- N -- O -- P -- Q -- R -- S -- T -- W Author information Chapter 4. Short introduction to heights and Arakelov theory Jean-Marc Couveignes, Bas Edixhoven -- Chapter 11. Bounds for Arakelov invariants of modular curves Chapter 14. Computing the residual Galois representations Chapter 12. Approximating Vf over the complex numbers Index Franz Merkl -- Chapter 13. Computing Vf modulo p Dependencies between the chapters Chapter 6. Computations with modular forms and Galois representations Acknowledgments Preface Bas Edixhoven, Robin de Jong -- Chapter 1. Introduction, main results, context Chapter 10. An upper bound for Green functions on Riemann surfaces B. Edixhoven, R. de Jong -- Chapter 2. Modular curves, modular forms, lattices, Galois representations Chapter 3. First description of the algorithms Chapter 9. Applying Arakelov theory Epilogue - Johan Bosman -- / Contents Bas Edixhoven -- Chapter 5. Computing complex zeros of polynomials and power series Chapter 8. Description of X1(5l) Frontmatter -- Chapter 7. Polynomials for projective representations of level one forms Jean-Marc Couveignes -- Chapter 15. Computing coefficients of modular forms Bibliography |
| Title | Computational aspects of modular forms and Galois representations |
| URI | http://portal.igpublish.com/iglibrary/search/PUPB0001152.html https://www.jstor.org/stable/j.ctt7rzmb https://cir.nii.ac.jp/crid/1130282271963897600 https://www.perlego.com/book/735123/computational-aspects-of-modular-forms-and-galois-representations-how-one-can-compute-in-polynomial-time-the-value-of-ramanujans-tau-at-a-prime-pdf https://ebookcentral.proquest.com/lib/[SITE_ID]/detail.action?docID=670341 https://www.degruyterbrill.com/isbn/9781400839001 https://www.vlebooks.com/vleweb/product/openreader?id=none&isbn=9781400839001&uid=none |
| Volume | 176 |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV1Rb9MwED5BywN9QMCYCDCIJl4jEseN48dt6oYEjD5s094ix3aqQEmrJhuDX8_ZcdOme4EHXqw06rXWfYl9d777DuC9xF1DcykDIVWMDkqSBCLP00AxFjIhY8ltS5arz-z8PL2-5lPXH7O27QRYVaV3d3z5X6HGewi2KZ39B7i7H8UbeI2g44iw47hjEXcfHdGAbdCwDu4d2RrKNsVloWyy6Snapy0l85mYL0pTIbLcVB-5sJ2Zo663iJW_dMSudS_rUG1in71QwdSE77Vh69itQuw5lehyoV3GQye5XiXbNi33VtyxJae4L9Zjtt7Zcbo8wJ7YQxgSOo7HAxieTb5efupCZYb1njLuGFLxDz_05EYwEvV33BJwu2hqQzk7W3YhvHWaKZoOVVmik7PUq7meLXoOxZOfNjVB6dnq5lezPgq3FsbFUxhqU3byDB7o6jmMtpS-B0c9ZH2HrL8ofIesb5H1EVm_RdbfQfYFXJ1OLk4-Bq71RSBYEnIScKYKKSnVKkyV1okghSYFXkdFlHAlZczRMSwUVUxRSTjNw1gJRfJYGAZAFe_DoFpU-iX4LKKioJEWUaIoKZgYp4yoWOZpQUjIlAeHW_rLbuf2mL7Oekr2wN9Wa7ZsuVCy6eX0uPUriAf7VtVZK_4tk03DVr9_5B4coO4zWZoxMiflaJUyu_Rzcy7swZ5DxYmyGM3Q2IN3a4gyOyWXrpxNjk8S3KgoTupwB7nMEMD0Z_7qb770Gh5vXpg3MGhWN_oAHsnbpqxXb90D-QcKBoHp |
| linkProvider | ProQuest Ebooks |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=book&rft.title=Computational+Aspects+of+Modular+Forms+and+Galois+Representations&rft.series=Annals+of+Mathematics+Studies&rft.date=2011-01-01&rft.pub=Princeton+University+Press&rft.isbn=9781400839001&rft.volume=176&rft_id=info:doi/10.1515%2F9781400839001&rft.externalDBID=n%2Fa&rft.externalDocID=9781400839001 |
| thumbnail_l | http://cvtisr.summon.serialssolutions.com/2.0.0/image/custom?url=https%3A%2F%2Fwww.perlego.com%2Fbooks%2FRM_Books%2Fprinceton_university_press_rydfxi%2F9781400839001.jpg |
| thumbnail_m | http://cvtisr.summon.serialssolutions.com/2.0.0/image/custom?url=https%3A%2F%2Fwww.degruyterbrill.com%2Fdocument%2Fcover%2Fisbn%2F9781400839001%2Foriginal http://cvtisr.summon.serialssolutions.com/2.0.0/image/custom?url=https%3A%2F%2Fvle.dmmserver.com%2Fmedia%2F640%2F97814008%2F9781400839001.jpg |
| thumbnail_s | http://cvtisr.summon.serialssolutions.com/2.0.0/image/custom?url=http%3A%2F%2Fportal.igpublish.com%2Figlibrary%2Famazonbuffer%2FPUPB0001152_null_0_320.png |