DeepAI AI Chat
Log In Sign Up

Error bounds for the asymptotic expansion of the partition function

by   Koustav Banerje, et al.

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 kth 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.


page 1

page 2

page 3

page 4


Asymptotic expansion of an estimator for the Hurst coefficient

Asymptotic expansion is presented for an estimator of the Hurst coeffici...

On Non Asymptotic Expansion of the MME in the Case of Poisson Observations

The problem of parameter estimation by observations of inhomogeneous Poi...

Computing error bounds for asymptotic expansions of regular P-recursive sequences

Over the last several decades, improvements in the fields of analytic co...

Asymptotic expansion of a variation with anticipative weights

Asymptotic expansion of a variation with anticipative weights is derived...

Asymptotics for connected graphs and irreducible tournaments

We compute the whole asymptotic expansion of the probability that a larg...

A Uniform-in-P Edgeworth Expansion under Weak Cramér Conditions

This paper provides a finite sample bound for the error term in the Edge...