Rigorous computation of Maass cusp forms of squarefree level
Number Theory
2022-10-03 v2
Abstract
We derive an algorithm to rigorously compute and verify Maass cusp forms of squarefree level and trivial character. The main tool we use is an explicit version of the Selberg trace formula with Hecke operators due to Str\"{o}mbergsson. We use this algorithm to compute several thousand Maass forms for a range of levels and use this data to obtain numerical evidence towards various conjectures.
Keywords
Cite
@article{arxiv.2201.08760,
title = {Rigorous computation of Maass cusp forms of squarefree level},
author = {Andrei Seymour-Howell},
journal= {arXiv preprint arXiv:2201.08760},
year = {2022}
}
Comments
15 pages, 2 figures; V2: minor changes, accepted by ANTS-XV and will appear in Research in Number Theory