On the computation of coefficients of modular forms: the reduction modulo p approach

From MaRDI portal
Publication:5179232

DOI10.1090/S0025-5718-2014-02892-5zbMATH Open1310.11053arXiv1211.1124OpenAlexW2963751544MaRDI QIDQ5179232FDOQ5179232


Authors: Jinxiang Zeng, Linsheng Yin Edit this on Wikidata


Publication date: 19 March 2015

Published in: Mathematics of Computation (Search for Journal in Brave)

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.


Full work available at URL: https://arxiv.org/abs/1211.1124




Recommendations




Cites Work


Cited In (11)

Uses Software





This page was built for publication: On the computation of coefficients of modular forms: the reduction modulo \(p\) approach

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5179232)