Search arXivSearch

arXiv · 2609.18339

Graded Algebras of Modular Forms and Sign Changes of Fourier Coefficients for Eta Quotients

Abstract

In this paper, for $N=8,12,16,20,32$, we determine the explicit structure of the graded algebra of modular forms for $\varGamma_0(N)$ of both integral and half-integral weights, with all quadratic Dirichlet characters modulo $N$. We give explicit eta quotient generators and determine the relations among them. Using these structures, for a given weight, a level among those considered above, and a quadratic character, we obtain a basis for the corresponding space of modular forms consisting of eta quotients. Using these eta quotient bases, we obtain necessary and sufficient conditions for the periodicity of the signs of the Fourier coefficients of modular forms in three specific spaces. Finally, we determine all eta quotients in these spaces whose Fourier coefficient signs are periodic.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Jianwen Gan. 2026-09-16. Graded Algebras of Modular Forms and Sign Changes of Fourier Coefficients for Eta Quotients. https://arxiv.org/abs/2609.18339

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