Explorations in math and programming
David Lowry-Duda

I'm giving an update today on my project to compute Maass forms. Today, I describe the final steps about how to make the computation rigorous. This complements a talk I gave two years ago about how to implement a heuristic evaluation.

The slides for my talk today are available here.

I hope to have a preprint describing this algorithm and its implementation shortly. I also hope to have a beta update to LMFDB with this information by the next meeting of the collaboration.

Leave a comment

Info on how to comment

To make a comment, please send an email using the button below. Your email address won't be shared (unless you include it in the body of your comment). If you don't want your real name to be used next to your comment, please specify the name you would like to use. If you want your name to link to a particular url, include that as well.

bold, italics, and plain text are allowed in comments. A reasonable subset of markdown is supported, including lists, links, and fenced code blocks. In addition, math can be formatted using $(inline math)$ or $$(your display equation)$$.

Please use plaintext email when commenting. See Plaintext Email and Comments on this site for more. Note also that comments are expected to be open, considerate, and respectful.

Comment via email