2000 character limit reached
Rigorous computation of Maass cusp forms of squarefree level
Published 21 Jan 2022 in math.NT | (2201.08760v2)
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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.