Inequalities for higher order differences of the logarithm of the overpartition function and a problem of Wang-Xie-Zhang
Abstract
Let 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-1r (n), by studying the inequality of the following form (1+C(r)nr-1/2-C1(r)nr)<(-1)r-1r (n) < (1+C(r)nr-1/2)\ for\ n ≥ N(r), where C(r), C1(r), 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-1r (n) than 0. By settling the problem, we are able to show that equation* n→ ∞(-1)r-1r (n) =π2(12)r-1n12-r. equation*
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.