Search arXivSearch

arXiv · 1711.10519

Vector-valued Hirzebruch-Zagier series and class number sums

Abstract

For any number $m \equiv 0,1 \, (4)$ we correct the generating function of Hurwitz class number sums $\sum_r H(4n - mr^2)$ to a modular form (or quasimodular form if $m$ is a square) of weight two for the Weil representation attached to a binary quadratic form of discriminant $m$ and determine its behavior in the Petersson scalar product. This modular form arises through holomorphic projection of the zero-value of a nonholomorphic Jacobi Eisenstein series of index $1/m$. When $m$ is prime, we recover the classical Hirzebruch-Zagier series whose coefficients are intersection numbers of curves on a Hilbert modular surface. Finally we calculate certain sums over class numbers by comparing coefficients with an Eisenstein series.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Brandon Williams. 2018-03-11. Vector-valued Hirzebruch-Zagier series and class number sums. https://doi.org/10.1007/s40687-018-0142-4

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