Search arXivSearch

arXiv · 1906.07410

Mock modular Eisenstein series with Nebentypus

Abstract

By the theory of Eisenstein series, generating functions of various divisor functions arise as modular forms. It is natural to ask whether further divisor functions arise systematically in the theory of mock modular forms. We establish, using the method of Zagier and Zwegers on holomorphic projection, that this is indeed the case for certain (twisted) "small divisors" summatory functions $σ_ψ^{\mathrm{sm}}(n)$. More precisely, in terms of the weight 2 quasimodular Eisenstein series $E_2(τ)$ and a generic Shimura theta function $θ_ψ(τ)$, we show that there is a constant $α_ψ$ for which $$ \mathcal{E}^{+}_ψ(τ):= α_ψ\cdot\frac{E_2(τ)}{θ_ψ(τ)}+ \frac{1}{θ_ψ(τ)} \sum_{n=1}^\infty σ^{\mathrm{sm}}_ψ(n)q^n $$ is a half integral weight (polar) mock modular form. These include generating functions for combinatorial objects such as the Andrews $spt$-function and the "consecutive parts" partition function. Finally, in analogy with Serre's result that the weight $2$ Eisenstein series is a $p$-adic modular form, we show that these forms possess canonical congruences with modular forms.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Michael H. Mertens, Ken Ono, Larry Rolen. 2020-09-29. Mock modular Eisenstein series with Nebentypus. https://arxiv.org/abs/1906.07410

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