Table of Contents
Fetching ...

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.

Computing Classical Modular Forms for Arbitrary Congruence Subgroups

TL;DR

It is proved the existence of an efficient algorithm for the computation of modular forms of weight and level where is an arbitrary congruence subgroup.

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.

Paper Structure

This paper contains 41 sections, 62 theorems, 165 equations, 1 table.

Key Result

Theorem 1.2.5

There exists an algorithm that given a group of real type $G \subseteq GL_{2}(\mathbb{Z}/N\mathbb{Z})$, a prime $p \nmid N$ such that $p \bmod N \in \det(G)$ and an integer $k \ge 2$, computes the Hecke operator $T_p$ on the space of modular forms $S_k(\Gamma_G)$ using $O(C d \cdot k \log k \cdot

Theorems & Definitions (157)

  • Conjecture 1.1.1: Serre's uniformity problem over $\mathbb{Q}$, serre1972proprietes
  • Definition 1.2.1
  • Remark 1.2.2
  • Remark 1.2.3
  • Remark 1.2.4
  • Theorem 1.2.5: Corollary \ref{['cor:Complexity Hecke Operator']}
  • Example 1.2.6
  • Theorem 1.2.7: Corollary \ref{['cor:complexity-double-coset-operator']}
  • Example 1.2.8
  • Remark 1.2.9
  • ...and 147 more