Search arXivSearch

arXiv · 2408.00246

Dimension formulas for modular form spaces of rational weights, the classification of eta-quotient characters and an extension of Martin's theorem

Abstract

We give an explicit formula for dimensions of spaces of rational-weight modular forms whose multiplier systems are induced by eta-quotients of fractional exponents. As the first application, we give series expressions of Fourier coefficients of the $n$th root of certain infinite $q$-products. As the second application, we extend Yves Martin's list of multiplicative holomorphic eta-quotients of integral weights by first extending the meaning of multiplicativity, then identifying one-dimensional spaces, and finally applying Wohlfahrt's extension of Hecke operators. A table containing $2277$ of such eta-quotients is presented. As a related result, we completely classify the multiplier systems induced by eta-quotients of integral exponents. For instance, there are totally $384$ such multiplier systems on $Γ_0(4)$ for any fixed weight. There are also some new results on $n$-fold covers of modular groups for $n\geq3$. Finally, we provide SageMath programs for verifying the theorems and generating the tables.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Xiao-Jie Zhu. 2026-06-22. Dimension formulas for modular form spaces of rational weights, the classification of eta-quotient characters and an extension of Martin's theorem. https://arxiv.org/abs/2408.00246

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