Search arXivSearch

arXiv · 2608.13324

Some convolution identities for mock modular forms arising from the theory of holomorphic projection

Abstract

Convolution identities and recursive formulas have long played a role in the theory of holomorphic modular forms and their applications. These have served both as striking formulas and as fundamentally useful tools for applications to combinatorics. Recently, there has been renewed interest in examples arising from non-holomorphic modular forms. These include the famous Hurwitz-Kronecker class number relations dating to 1885, and groundbreaking work of Imamoğlu, Raum, and Richter from 2014. Imamoğlu, Raum, and Richter developed a theory of holomorphic projection for products of (vector-valued) harmonic Maass forms and holomorphic modular forms to produce many such formulas. This was related shortly thereafter by Duncan, Griffin, and Ono to replicable-type functions in the sense of Conway and Norton, and such recursions played a key role in their proof of the Umbral Moonshine Conjecture. Here, we develop new results on holomorphic projections of such functions which is more convenient for many natural cases. Imamoğlu, Raum, and Richter's choice corresponds to the case in which the generalized Pell equation $m^2 - Dn^2 = N$ has a square value for $D$, which has only finitely many solutions for a given value of $N$. Our main results cover the cases of general $D$, in particular those for which the Pell equation has infinitely many solutions. As an application, we resolve a recent conjecture of the second author. More generally, our approach yields 18 convolution identities for mock theta functions, which we boil down to 5 identities that can directly be used to prove the others. In the appendices, we also show how these identities can be proven by more direct $q$-series methods; however, the key utility of the holomorphic projection formulas is that they give a tool to automatically discover and verify such formulas.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Jonathan G. Bradley-Thrush, Frank Garvan, Jayashree Kalita, Larry Rolen. 2026-08-13. Some convolution identities for mock modular forms arising from the theory of holomorphic projection. https://arxiv.org/abs/2608.13324

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