Pith. sign in

Asymptotic approximation of central binomial coefficients with rigorous error bounds

1 Pith paper cite this work. Polarity classification is still indexing.

1 Pith paper citing it
abstract

We show that a well-known asymptotic series for the logarithm of the central binomial coefficient is strictly enveloping in the sense of P\'olya and Szeg\"o, so the error incurred in truncating the series is of the same sign as the next term, and is bounded in magnitude by that term. We consider closely related asymptotic series for Binet's function, for $\ln\Gamma(z+1/2)$, and for the Riemann-Siegel theta function, and make some historical remarks.

citation-role summary

background 1

citation-polarity summary

fields

math.PR 1

years

2026 1

verdicts

CONDITIONAL 1

roles

background 1

polarities

unclear 1

representative citing papers

citing papers explorer

Showing 1 of 1 citing paper.