Jump to ContentJump to Main Navigation
Computational Aspects of Modular Forms and Galois RepresentationsHow One Can Compute in Polynomial Time the Value of Ramanujan's Tau at a Prime (AM-176)$
Users without a subscription are not able to see the full content.

Bas Edixhoven and Jean-Marc Couveignes

Print publication date: 2011

Print ISBN-13: 9780691142012

Published to Princeton Scholarship Online: October 2017

DOI: 10.23943/princeton/9780691142012.001.0001

Show Summary Details
Page of

PRINTED FROM PRINCETON SCHOLARSHIP ONLINE (www.princeton.universitypressscholarship.com). (c) Copyright Princeton University Press, 2017. All Rights Reserved. Under the terms of the licence agreement, an individual user may print out a PDF of a single chapter of a monograph in HSO for personal use (for details see http://www.universitypressscholarship.com/page/privacy-policy).date: 15 December 2017

Computing the residual Galois representations

Computing the residual Galois representations

Chapter:
(p.371) Chapter Fourteen Computing the residual Galois representations
Source:
Computational Aspects of Modular Forms and Galois Representations
Author(s):

Bas Edixhoven

Publisher:
Princeton University Press
DOI:10.23943/princeton/9780691142012.003.0014

This chapter proves the main result on the computation of Galois representations. It provides a detailed description of the algorithm and a rigorous proof of the complexity. It first combines the results of chapters 11 and 12 in order to work out the strategy of Chapter 3. This gives the main result, Theorem 14.1.1: a deterministic polynomial time algorithm, based on computations with complex numbers. The crucial transition from approximations to exact values is done, and the proof of Theorem 14.1.1 is finished later in the chapter. The chapter then replaces the complex computations with the computations over finite fields from Chapter 13, and gives a probabilistic (Las Vegas type) polynomial time variant of the algorithm in Theorem 14.1.1.

Keywords:   modular forms, Galois representations, polynomial time algorithm

Princeton Scholarship Online requires a subscription or purchase to access the full text of books within the service. Public users can however freely search the site and view the abstracts and keywords for each book and chapter.

Please, subscribe or login to access full text content.

If you think you should have access to this title, please contact your librarian.

To troubleshoot, please check our FAQs , and if you can't find the answer there, please contact us.