Search arXivSearch

arXiv · 1402.0405

Generators and relations of the graded algebra of modular forms

Abstract

We give bounds on the degree of generators for the ideal of relations of the graded algebras of modular forms with coefficients in $\mathbb{Q}$ over congruence subgroups $Γ_0(N)$ for $N$ satisfying some congruence conditions and for $Γ_1(N)$. We give similar bounds for the graded $\mathbb{Z}[\frac{1}{N}]$-algebra of modular forms on $Γ_1(N)$ with coefficients in $\mathbb{Z}[\frac{1}{N}]$. For a prime $p \geq 5$, we give a lower bound on the highest weight appearing in a minimal list of generators for $Γ_0(p)$, and we identify a set of generators for the graded algebra $M(Γ_0(p),\mathbb{Z})$ of modular forms over $Γ_0(p)$ with coefficients in $\mathbb{Z}$, showing that this weight is unbounded. We generalize a result of Serre concerning congruences between modular forms over $Γ_0(p)$ and $SL_2(\mathbb{Z})$, and use it to identify a set of generators for $M(Γ_0(p),\mathbb{Z})$, and we state two conjectures detailing further the structure of this algebra. Finally we provide computations concerning the number of generators and relations for each of these algebras, as well as computational evidence for these conjectures.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Nadim Rustom. 2014-02-03. Generators and relations of the graded algebra of modular forms. https://doi.org/10.1007/s11139-015-9674-z

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Asymptotic density of k-almost primes

Landau's well known asymptotic formula $$N_k(x):=\ \mid\{n\leq x : Ω(n)=k\}\mid \ \sim \left( \frac{x}{\log x} \right) \frac{(\log\log x)^{k-1}}{(k - 1)!}\ \ (x \rightarrow \infty),$$ which also holds for $$π_k(x):=\ \mid\{n\leq x : ω(n)=k\}\mid,$$ is known to be fairly poor for $k > 1$, and when $k$ is allowed to tend to infinity with $x$, the study of $N_k(x)$ and $π_k(x)$ becomes very technical [1, Chapter II.6, $§$ 6.1, p.200]. I hope to show that the method described below provides not only a more accurate approach, but rather increases in its asymptotic accuracy as $k$ tends to infinity.

math.NT

Transcendence Meets Normality: Construction of Transcendentally Normal Numbers

In this work, we study real numbers $x$ for which $p(x)$ is (absolutely) normal for every non-constant integer-valued polynomial $p$. We call such numbers transcendentally normal. We prove that almost every real number is transcendentally normal and provide an explicit construction of such a number, based on Sierpinski's covering method and novel ideas involving the so-called stretch function. In the next step, we transform this construction into an algorithm that computes the digits of a t-normal number recursively in all integer bases. Moreover, we extend our covering approach to construct and compute LIL-normal numbers whose discrepancies are of the order predicted by the law of the iterated logarithm. We also take the opportunity to discuss several interesting open problems.

math.NT