Error bounds for the asymptotic expansion of the partition function

MaRDI QIDQ6410992FDOQ6410992

Authors Koustav Banerje, Peter Paule, Cristian-Silviu Radu, Carsten Schneider

Publication date 16 September 2022

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Asymptotic enumeration (05A16) Analytic theory of partitions (11P82)

Abstract: Asymptotic study on the partition function $p(n)$ began with the work of Hardy and Ramanujan. Later Rademacher obtained a convergent series for $p(n)$ and an error bound was given by Lehmer. Despite having this, a full asymptotic expansion for $p(n)$ with an explicit error bound is not known. Recently O'Sullivan studied the asymptotic expansion of $p^k(n)$-partitions into $k$th powers, initiated by Wright, and consequently obtained an asymptotic expansion for $p(n)$ along with a concise description of the coefficients involved in the expansion but without any estimation of the error term. Here we consider a detailed and comprehensive analysis on an estimation of the error term obtained by truncating the asymptotic expansion for $p(n)$ at any positive integer $n$. This gives rise to an infinite family of inequalities for $p(n)$ which finally answers to a question proposed by Chen. Our error term estimation predominantly relies on applications of algorithmic methods from symbolic summation.

This page was built for publication: Error bounds for the asymptotic expansion of the partition function

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6410992)