Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Meta-ticket: add an implementation of Edixhoven's algorithm to Sage #12132

Open
sagetrac-johanbosman mannequin opened this issue Dec 9, 2011 · 4 comments
Open

Meta-ticket: add an implementation of Edixhoven's algorithm to Sage #12132

sagetrac-johanbosman mannequin opened this issue Dec 9, 2011 · 4 comments

Comments

@sagetrac-johanbosman
Copy link
Mannequin

sagetrac-johanbosman mannequin commented Dec 9, 2011

A book on the computational aspects of Galois representations associated with modular forms was published last summer: http://www.math.univ-toulouse.fr/~couveig/publi/book.pdf

At http://www.sagenb.org/home/pub/3154/ one can find a talk I gave containing a Sage implementation of this algorithm.

The purpose of this ticket is to polish up and move that implementation to Sage.

There are in fact two approaches. Both are based on computing with torsion point of Jacobians of modular curves. The first approach goes via complex approximations and has already led to some practical results. The second approach is via modulo p computations; this works very well in theory, but practical implementations have not been well worked out yet.

Let us start by working out the first few steps in each of these approaches.

For the numerical approach:

  1. Implement the upper half plane. There already seems to be a ticket for this (hyperbolic geometry #9439), but the patch given there needs a vast improvement. In fact, what we need is completely disjoint from what is done there.
  2. Implement numerical evaluation of modular forms at upper half plane points and numerical integration of modular forms between points in the (extended) upper half plane.
  3. We definitely also need LLL for matrices over QQ and RR. This is LLL algorithm for matrices over QQ #12051.
  4. Jacobians, etc.

For the mod p approach:

  1. Implement finite commutative algebras over arbitrary fields. This is Implement finite algebras #12141.
  2. Improve the performance of finite field computations. This is Speed up PARI finite field operations #12142.

CC: @williamstein @pjbruin

Component: modular forms

Issue created by migration from https://trac.sagemath.org/ticket/12132

@sagetrac-johanbosman sagetrac-johanbosman mannequin added this to the sage-4.8 milestone Dec 9, 2011
@sagetrac-johanbosman

This comment has been minimized.

@sagetrac-johanbosman sagetrac-johanbosman mannequin removed this from the sage-4.8 milestone Dec 10, 2011
@sagetrac-johanbosman

This comment has been minimized.

@sagetrac-johanbosman

This comment has been minimized.

@sagetrac-johanbosman

This comment has been minimized.

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Projects
None yet
Development

No branches or pull requests

1 participant