LfunctionsAndModularForms/ClassicalModularForms/070730.PM

Known Databases

Other collections

Basic questions informing the design

Some content ideas

Applications

Labeling can be derived from first principles:

Within the database, how do we order the entries for a given (weight, level)? William likes to use the trace values of the a_p for p \geq 1. We get the dimension as the first ordering.

Eidixhoven has a program to compute coefficients of \Delta in polynomial time; this is of more theoretical interest, but does it relate to any of this work?

Do we (who will) address the complexity of the computations?

Wild and Crazy thoughts (Wish List)

Given a list (a_2, a_3, ...) of coefficients, find forms in the database that are congruent to these, modulo primes of a given residue character.

With a newform, record its reductions modulo a collection of primes.

Computing reductions modulo primes can be tricky, without Magma; in particular, there are problems when you have non-p-maximal orders, which occur only for a finite set of primes.

Record all BSD invariants. The regulator is the hard part, of course.

Shimura lifts (cross-referenced to \frac12-integral-weight modular forms).

Graded rings of a given level: M(N)=\oplus_kM_k(N)

Include equations for modular curves.

We need checks on all data: Consistency, accuracy, precision, validity.

For the Maass forms, a lot of the information is numeric, so accuracy is important.

Modular forms in terms of \theta-series.

LfunctionsAndModularForms/ClassicalModularForms/070730.PM (last edited 2009-03-01 00:55:50 by localhost)