Computing level one Hecke eigensystems (mod p)
Craig Citro, Alexandru Ghitza
TL;DR
This paper presents an algorithm to enumerate level 1 Hecke eigensystems derived from modular forms modulo p, facilitating computational exploration in number theory.
Contribution
It introduces a novel algorithm specifically designed for enumerating level 1 Hecke eigensystems mod p, advancing computational methods in modular forms.
Findings
Successfully enumerates Hecke eigensystems for various primes p
Provides a practical computational tool for modular forms analysis
Enhances understanding of modular forms mod p structures
Abstract
We describe an algorithm for enumerating the set of level 1 systems of Hecke eigenvalues arising from modular forms (mod p).
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.