On the computation of modular forms on noncongruence subgroups
From MaRDI portal
Holomorphic modular forms of integral weight (11F11) Fourier coefficients of automorphic forms (11F30) Arithmetic aspects of dessins d'enfants, Bely? theory (11G32) Iterative numerical methods for linear systems (65F10) Numerical methods for functional equations (65Q20) Complexity and performance of numerical algorithms (65Y20)
Abstract: We present two approaches that can be used to compute modular forms on noncongruence subgroups. The first approach uses Hejhal's method for which we improve the arbitrary precision solving techniques so that the algorithm becomes about up to two orders of magnitude faster in practical computations. This allows us to obtain high precision numerical estimates of the Fourier coefficients from which the algebraic expressions can be identified using the LLL algorithm. The second approach is restricted to genus zero subgroups and uses efficient methods to compute the Belyi map from which the modular forms can be constructed.
Recommendations
- Computing Power Series Expansions of Modular Forms
- Computing classical modular forms for arbitrary congruence subgroups
- Modular forms, a computational approach. With an appendix by Paul E. Gunnells
- On the Computational Complexity of Modular Symbols
- Computing bases of modular forms using the graded algebra structure
Cites work
- A fast algorithm for reversion of power series
- A new analysis of iterative refinement and its application to accurate solution of ill-conditioned sparse linear systems
- An Algorithm for the Machine Calculation of Complex Fourier Series
- Another proof of the three points theorem
- Arb: Efficient Arbitrary-Precision Midpoint-Radius Interval Arithmetic
- Complexity of multiplication with vectors for structured matrices
- Computing Power Series Expansions of Modular Forms
- Effective computation of Maass cusp forms
- Error bounds from extra-precise iterative refinement
- Factoring polynomials with rational coefficients
- Fast Algorithms for Manipulating Formal Power Series
- GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
- scientific article; zbMATH DE number 426391 (Why is no real title available?)
- scientific article; zbMATH DE number 45834 (Why is no real title available?)
- scientific article; zbMATH DE number 3636144 (Why is no real title available?)
- scientific article; zbMATH DE number 709500 (Why is no real title available?)
- scientific article; zbMATH DE number 1552109 (Why is no real title available?)
- scientific article; zbMATH DE number 6433322 (Why is no real title available?)
- scientific article; zbMATH DE number 3404329 (Why is no real title available?)
- Identifying congruence subgroups of the modular group
- Inversion of extremely ill-conditioned matrices in floating-point
- Level and index in the modular group
- Lifts of projective congruence groups
- Maass waveforms on (_0(N),) (computational aspects)
- Maaß cusp forms for large eigenvalues
- Modern computer arithmetic
- Modular forms for noncongruence subgroups
- Moduli interpretations for noncongruence modular curves
- Noncongruence subgroups and Maass waveforms
- Numerical calculation of three-point branched covers of the projective line
- On modular forms for some noncongruence subgroups of SL2 (ℤ) II
- Subgroups of the Classical Modular Group
- The unbounded denominators conjecture for the noncongruence subgroups of index 7
Cited in
(2)
This page was built for publication: On the computation of modular forms on noncongruence subgroups
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6203470)
