Search arXivSearch

arXiv · 2007.03664

Parity of coefficients of mock theta functions

Abstract

We study the parity of coefficients of classical mock theta functions. Suppose $g$ is a formal power series with integer coefficients, and let $c(g;n)$ be the coefficient of $q^n$ in its series expansion. We say that $g$ is of parity type $(a,1-a)$ if $c(g;n)$ takes even values with probability $a$ for $n\geq 0$. We show that among the 44 classical mock theta functions, 21 of them are of parity type $(1,0)$. We further conjecture that 19 mock theta functions are of parity type $(\frac{1}{2},\frac{1}{2})$ and 4 functions are of parity type $(\frac{3}{4},\frac{1}{4})$. We also give characterizations of $n$ such that $c(g;n)$ is odd for the mock theta functions of parity type $(1,0)$.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Liuquan Wang. 2021-06-04. Parity of coefficients of mock theta functions. https://doi.org/10.1016/j.jnt.2021.04.023

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