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

Computing Vf modulo p

Computing Vf modulo p

Chapter:
(p.337) Chapter Thirteen Computing Vf modulo p
Source:
Computational Aspects of Modular Forms and Galois Representations
Author(s):

Jean-Marc Couveignes

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

This chapter addresses the problem of computing in the group of lsuperscript k-torsion rational points in the Jacobian variety of algebraic curves over finite fields, with an application to computing modular representations. An algorithm in this chapter usually means a probabilistic Las Vegas algorithm. In some places it gives deterministic or probabilistic Monte Carlo algorithms, but this will be stated explicitly. The main reason for using probabilistic Turing machines is that there is a need to construct generating sets for the Picard group of curves over finite fields. Solving such a problem in the deterministic world is out of reach at this time. The unique goal is to prove, as quickly as possible, that the problems studied in this chapter can be solved in probabilistic polynomial time.

Keywords:   modular forms, plane curves, random divisors, modular representations, Las Vegas algorithm, Turing machines, probabilistic polynomial time

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.