Search arXivSearch

arXiv · 2604.20034

On Uniqueness of Mock Theta Functions

Abstract

We develop a resurgent approach to the problem of unique continuation of mock theta functions across their natural boundary. The starting point is the representation of the associated Mordell-Appell integrals as Laplace transforms of resurgent functions, which serve as the primary analytic objects. By rotating the Laplace contour by $π$, i.e. onto the Stokes line, one obtains, in all known cases, the mock-modular relations between the Mordell-Appell integrals and the corresponding unary series in $\hat q=e^{-πi τ}$ and $\hat q_1=e^{-πi (-1/τ)}$. We then prove that these relations admit a unique solution on the $q$-side, expressed in terms of $q=e^{πi τ}$ and $q_1=e^{πi (-1/τ)}$, with coefficients determined by the corresponding Mordell-Appell integrals. This yields a canonical continuation across the natural boundary, given by a resurgent extension of the classical principle of permanence of relations, and singles out a distinguished family of mock theta functions in each group. We present a complete analysis for the order 3 and 5 cases (mf3 and mf5). The method extends naturally to higher orders; a general theory will appear in a separate paper.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Ovidiu Costin, Gerald V. Dunne, Ali Saraeb. 2026-04-21. On Uniqueness of Mock Theta Functions. https://arxiv.org/abs/2604.20034

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