Computing classical modular forms

Alex J. Best; Andrew R. Booker; Andrew V. Sutherland; David Lowry-Duda; David Roe; Edgar Costa; John Cremona; John Voight; Jonathan Bober; Maarten Derickx

REVIEW

Computing classical modular forms

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2002.04717 v4 pith:3U25722Y submitted 2020-02-11 math.NT

Computing classical modular forms

Alex J. Best , Jonathan Bober , Andrew R. Booker , Edgar Costa , John Cremona , Maarten Derickx , Min Lee , David Lowry-Duda

show 3 more authors

David Roe Andrew V. Sutherland John Voight

This is my paper

classification math.NT

keywords formsmodularclassicalcomputingdatabaseaspectsdiscussl-functions

verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved

0 comments

read the original abstract

We discuss practical and some theoretical aspects of computing a database of classical modular forms in the L-functions and Modular Forms Database (LMFDB).

Computing classical modular forms

discussion (0)