Rapid computation of L-functions for modular forms
Pankaj Vishe

TL;DR
This paper introduces an efficient algorithm for rapidly computing the values of L-functions associated with modular forms at complex points, significantly improving computational speed for large parameters.
Contribution
The paper presents a novel algorithm that computes L-functions for modular forms at high precision with sublinear time complexity in the imaginary part of the input.
Findings
Computes L(f, 1/2 + iT) efficiently for large T
Achieves time complexity of O(1 + |T|^{7/8})
Enables high-precision calculations of L-functions
Abstract
Let be a fixed (holomorphic or Maass) modular cusp form, with -function . We describe an algorithm that computes the value to any specified precision in time .
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
