preprint Open access

Computing Classical Modular Forms for Arbitrary Congruence Subgroups

  • arXiv (Cornell University)
  • Cornell University
Research footprint

At a glance

Citations
0
References
0
Comments
0
Paper overview

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.

Record transparency

Publication details

DOI
10.48550/arxiv.2002.07212
OpenAlex
W4287867380
Document type
preprint
Language
EN
Source
arXiv (Cornell University)
Last metadata update
Community

Comments

Log in to join the discussion.

  1. No comments yet. Start the discussion.