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.
Computational Aspects of Modular Forms and Galois Representations: How One Can Compute in Polynomial Time the Value of Ramanujan's Tau at a Prime (AM-176)

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, 2020. All Rights Reserved. An individual user may print out a PDF of a single chapter of a monograph in PRSO for personal use.date: 04 June 2020

First description of the algorithms

First description of the algorithms

Chapter:
(p.69) Chapter Three First description of the algorithms
Source:
Computational Aspects of Modular Forms and Galois Representations
Author(s):

Jean-Marc Couveignes

Bas Edixhoven

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

This chapter provides the first, informal description of the algorithms. It explains how the computation of the Galois representations V attached to modular forms over finite fields should proceed. The essential step is to approximate the minimal polynomial P of (3.1) with sufficient precision so that P itself can be obtained.

Keywords:   modular forms, algorithms, Galois representation, finite fields

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.