Computing Classical Modular Forms for Arbitrary Congruence Subgroups
arXiv:2002.07212
Abstract
In this paper, we prove the existence of an efficient algorithm for the computation of -expansions of modular forms of weight and level , where is an arbitrary congruence subgroup. We also discuss some practical aspects and provide the necessary theoretical background.
for associated code, see https://github.com/assaferan/ModFrmGL2