Papers
Topics
Authors
Recent
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.

Summary

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (1)

Collections

Sign up for free to add this paper to one or more collections.