English

Computing newforms using supersingular isogeny graphs

Number Theory 2022-08-08 v3

Abstract

We describe an algorithm that we used to compute the q-expansions of all weight 2 cusp forms of prime level at most 2,000,000 and dimension at most 6. We also present an algorithm that we used to verify that there was only one cusp form of dimension 7 or more per Atkin-Lehner eigenspace for prime levels between 10,000 and 1,000,000. Our algorithm is based on Mestre's M\'ethode des Graphes, and involves supersingular isogeny graphs and Wiedemann's algorithm for finding the minimal polynomial of sparse matrices over finite fields.

Keywords

Cite

@article{arxiv.2010.10745,
  title  = {Computing newforms using supersingular isogeny graphs},
  author = {Alex Cowan},
  journal= {arXiv preprint arXiv:2010.10745},
  year   = {2022}
}

Comments

v3: Updated with recent data

R2 v1 2026-06-23T19:30:34.341Z