Computing Classical Modular Forms for Arbitrary Congruence Subgroups
Eran Assaf
TL;DR
It is proved the existence of an efficient algorithm for the computation of modular forms of weight $k$ and level $Gamma$ where $\Gamma \subseteq SL_{2}({\mathbb{Z}})$ is an arbitrary congruence subgroup.
Abstract
In this paper, we prove the existence of an efficient algorithm for the computation of $q$-expansions of modular forms of weight $k$ and level $Γ$, where $Γ\subseteq SL_{2}({\mathbb{Z}})$ is an arbitrary congruence subgroup. We also discuss some practical aspects and provide the necessary theoretical background.
