On the computation of coefficients of modular forms: the reduction modulo p approach
classification
🧮 math.NT
keywords
algorithmcoefficientsformsmodularapproachcomplexitycomputationcompute
read the original abstract
In this paper we present a probabilistic algorithm to compute the coefficients of modular forms of level one. Focus on the Ramanujan's tau function, we give out the explicit complexity of the algorithm. From a practical viewpoint, the algorithm is particularly well suited for implementations.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.