Search arXivSearch

arXiv · 2406.14280

Eichler-Selberg relations for singular moduli

Abstract

The Eichler-Selberg trace formula expresses the trace of Hecke operators on spaces of cusp forms as weighted sums of Hurwitz-Kronecker class numbers. We extend this formula to a natural class of relations for traces of singular moduli, where one views class numbers as traces of the constant function $j_0(τ)=1$. More generally, we consider the singular moduli for the Hecke system of modular functions \[ j_m(τ) := mT_m \left(j(τ)-744\right). \] For each $ν\geq 0$ and $m\geq 1$, we obtain an Eichler-Selberg relation. For $ν=0$ and $m\in \{1, 2\},$ these relations are Kaneko's celebrated singular moduli formulas for the coefficients of $j(τ).$ For each $ν\geq 1$ and $m\geq 1,$ we obtain a new Eichler-Selberg trace formula for the Hecke action on the space of weight $2ν+2$ cusp forms, where the traces of $j_m(τ)$ singular moduli replace Hurwitz-Kronecker class numbers. These formulas involve a new term that is assembled from values of symmetrized shifted convolution $L$-functions.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Yuqi Deng, Toshiki Matsusaka, Ken Ono. 2024-06-20. Eichler-Selberg relations for singular moduli. https://arxiv.org/abs/2406.14280

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