Proof of a conjectured bound for fractional Stieltjes constants
The fractional Stieltjes constants $\gamma_\alpha(a)$ extend the Laurent coefficients $\gamma_n(a)$ of the Hurwitz zeta function $\zeta(s,a)$ at $s=1$ to real orders $\alpha>0$. Farr, Pauli and Saidak conjectured that $C_\alpha(a)=\gamma_\alpha(a)-\log^\alpha(a)/a$, which is real, satisfies $|C_\alpha(a)|\le2|\exp(\alpha(\log w-1/w))|$ for $0<a\le1$, where $w=W_0(i\alpha/(2\pi))$ and $W_0$ is the principal branch of the Lambert $W$ function. For integer $\alpha=n$ and $a=1$, the conjectured bound has the exponential factor of the asymptotic formula of Knessl and Coffey (2011) for the Stieltjes constants $\gamma_n$. Pauli and Saidak (2024) proved, for $\alpha\ge2\pi$, a steepest-descent bound whose main term exceeds the conjectured bound by a factor of order $\alpha^2\log\alpha$. We prove the conjecture with strict inequality for every $\alpha>0$ and every $0<a\le1$. The proof bounds $|C_\alpha(a)|$ for all $a$ at once by a series of integrals that do not depend on $a$. For small $\alpha$, an elementary estimate bounds $C_\alpha(a)$ instead. For moderate $\alpha$, numerical integration in ball arithmetic, which encloses each number in an interval, bounds the integrals for whole intervals of $\alpha$. For large $\alpha$, proved inequalities along an explicit path through the saddle point $w$ bound the integrals. For every integer $n\ge1$, the theorem bounds the generalized Stieltjes constants $\gamma_n(b)$ with $1<b\le2$ by the conjectured bound. At $n=1000$, this bound exceeds $|\gamma_n|$ by a factor below $11$, whereas the explicit bounds of Saad Eddin (2013) and of Pauli and Saidak exceed $|\gamma_n|$ by factors above $10^7$. The computations use python-flint 0.6.0 and take about 70 seconds.
Authors
- Sungwoo Kang
Publication Details
- Journal
- Zenodo (CERN European Organization for Nuclear Research)
- Published
- 2026-11-21
- DOI
- https://doi.org/10.5281/zenodo.24422617
- Primary Topic
- Analytic Number Theory Research
- Type
- preprint