Search arXivSearch

arXiv · 2204.00055

Inequalities for higher order differences of the logarithm of the overpartition function and a problem of Wang-Xie-Zhang

Abstract

Let $\overline{p}(n)$ denote the overpartition function. In this paper, our primary goal is to study the asymptotic behavior of the finite differences of the logarithm of the overpartition function, i.e., $(-1)^{r-1}Δ^r \log \p(n)$, by studying the inequality of the following form $$\log \Bigl(1+\dfrac{C(r)}{n^{r-1/2}}-\dfrac{C_1(r)}{n^{r}}\Bigr)<(-1)^{r-1}Δ^r \log \p(n) <\log \Bigl(1+\dfrac{C(r)}{n^{r-1/2}}\Bigr)\ \text{for}\ n \geq N(r),$$ where $C(r), C_1(r), \text{and}\ N(r)$ are computable constants depending on the positive integer $r$, determined explicitly. This solves a problem posed by Wang, Xie and Zhang in the context of searching for a better lower bound of $(-1)^{r-1}Δ^r \log \p(n)$ than $0$. By settling the problem, we are able to show that \begin{equation*} \lim_{n\rightarrow \infty}(-1)^{r-1}Δ^r \log \p(n) =\dfracπ{2}\Bigl(\dfrac{1}{2}\Bigr)_{r-1}n^{\frac{1}{2}-r}. \end{equation*}

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Gargi Mukherjee. 2022-03-31. Inequalities for higher order differences of the logarithm of the overpartition function and a problem of Wang-Xie-Zhang. https://arxiv.org/abs/2204.00055

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