On the computation of coefficients of modular forms: the reduction modulo p approach
Number Theory
2013-05-20 v4
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.
Keywords
Cite
@article{arxiv.1211.1124,
title = {On the computation of coefficients of modular forms: the reduction modulo p approach},
author = {Jinxiang Zeng and Linsheng Yin},
journal= {arXiv preprint arXiv:1211.1124},
year = {2013}
}
Comments
16 pages