Papers › Rigorous computation of Maass cusp forms of squarefree level
Rigorous computation of Maass cusp forms of squarefree level
Andrei Seymour-Howell
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
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.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections