Computing coefficients of modular forms
From MaRDI portal
Publication:3171744
Recommendations
- Algorithmic Number Theory
- On the computation of the coefficients of modular forms
- Coefficients of modular forms
- Computational arithmetic of modular forms
- Computing Fourier Coefficients of Level One Modular Forms
- Computing Modular Polynomials
- Computation of the modular equation
- On the computation of the modular equation
- Computing congruences of modular forms and Galois representations modulo prime powers
- On the computation of coefficients of modular forms: the reduction modulo \(p\) approach
Cited in
(15)- Computing Fourier Coefficients of Level One Modular Forms
- Factorization tests and algorithms arising from counting modular forms and automorphic representations
- scientific article; zbMATH DE number 1057052 (Why is no real title available?)
- Computing classical modular forms
- Computing Borcherds products
- Report 32/2005: Explicit methods in number theory (July 17th -- July 23rd, 2005)
- Computing Power Series Expansions of Modular Forms
- A computational study of the asymptotic behaviour of coefficient fields of modular forms
- Algorithmic Number Theory
- Multiplying Modular Forms
- Fast computation of half-integral weight modular forms
- On explicit formulas for the modular equation
- How to Compute the Coefficients of the Elliptic Modular Functionj(z)
- On the computation of the coefficients of modular forms
- On the computation of coefficients of modular forms: the reduction modulo \(p\) approach
This page was built for publication: Computing coefficients of modular forms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3171744)
