Abstract
We consider p(n) the number of partitions of a natural number n, starting from an expression derived by Báez-Duarte in (Adv Math 125(1):114–120, 1997) by relating its generating function f(t) with the characteristic functions of a family of sums of independent random variables indexed by t. The asymptotic formula for p(n) follows then from a local central limit theorem as \(t\uparrow 1\) suitably with \(n\rightarrow \infty \). We take further that analysis and compute formulae for the terms that compose that expression, which accurately approximate them as \(t\uparrow 1\). Those include the generating function f and the cumulants of the random variables. After develo** an asymptotic series expansion for the integral term, we obtain an expansion for p(n) that can be simplified as follows: for each \(N>0\),
The coefficients \(D_\ell \) are positive and have simple expressions as finite sums of combinatorial numbers, \(r_n=\sqrt{\frac{2\pi ^2}{3}\,(n-\frac{1}{24})+\frac{1}{4}}\) and the remainder satisfies \(n^{N/2}\,{\mathcal {R}}_{N+1} \rightarrow 0\) as \(n\rightarrow \infty \). The cumulants are given by series of rational functions and the approximate formulae obtained could be also of independent interest in other contexts.
Similar content being viewed by others
References
Báez-Duarte, L.: Hardy–Ramanujan’s asymptotic formula for partitions and the central limit theorem. Adv. Math. 125(1), 114–120 (1997)
Berndt, B.C.: Ramanujan’s Notebooks. Part II. Springer, New York (1989)
Brassesco, S., Méndez, M.A.: The asymptotic expansion for n! and the Lagrange inversion formula. Ramanujan J. 24(2), 219–234 (2011)
Bruinier, J.H., Ono, K.: Algebraic formulas for the coefficients of half-integral weight harmonic weak Maass forms. Adv. Math. 246, 198–219 (2013)
Comtet, L.: Advanced Combinatorics : The Art of Finite and Infinite Expansions. U.S.A. D. Reidel Publishing Company, Dordrecht (1974)
Dewar, M., Murty, R.M.: A derivation of the Hardy–Ramanujan formula from an arithmetic formula. Proc. Am. Math. Soc. 141, 1903–1911 (2013)
Grosswald, E.: Comments on some formulae of Ramanujan. Acta Arith. 21, 25–34 (1972)
Hardy, G.H., Ramanujan, S.: Asymptotic formulae in combinatory analysis. Proc. Lond. Math. Soc. s2–17(1), 75–115 (1918)
Rademacher, H.: A convergent series for the partition function p(n). Proc. Natl. Acad. Sci. 23, 78–84 (1937)
Shiryaev, A.N.: Probability, 2nd edn. Springer, New York (1996)
Author information
Authors and Affiliations
Corresponding author
Additional information
Dedicated to the memory of Luis Báez Duarte.
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Appendix Formulae for higher-order cumulants
Appendix Formulae for higher-order cumulants
In the next lemma we derive a couple of explicit expressions for each cumulant \(\kappa _j(t)\), in terms of the Eulerian polynomials \(A_j(t)\), that are defined through the following identity
The first four are
More details can be found in Comtet’s book [5].
Lemma A.1
The cumulants \(\kappa _j(t)\) satisfy
The above series are absolutely convergent for \(|t|<1\).
Proof
Denote by \(S_j(t)\) the right-hand side of (A.3). In (3.12), we have seen that \(\kappa _1(t)=\sum _{\ell \ge 1}\frac{t^\ell }{(1-t^\ell )^2}\), which equals \(S_1(t)\) by (A.2); that proves (A.3) for \(j=1\). To conclude, from (3.11) it suffices to show that
Using a well-known recurrence relation for the Eulerian polynomials that can be found for instance in [5, p. 292]
we compute
Summing up the last expression over \(\ell \), we obtain \(S_{j+1}\), and conclude the proof of (A.3). To prove (A.4), observe that, from (A.3) and (A.1), if \(j\ge 2\),
The convergence of the series in (A.3) and (A.4) is clear from the fact that the polynomials \(A_j(0)=0\) for any \(j\ge 1\). \(\square \)
The next result is a consequence of Lemma A.1 and a reasoning similar to that leading to prove Lemma 3.3: from the recurrence (3.11), we derive functional equations for \(\kappa _j\) for \(j>2\), that yield asymptotic formulae as \(t\uparrow 1\) for those. The precise statement is given next.
Proposition A.2
The cumulants \(\kappa _j(t)\), \(j\ge 2\) satisfy the following functional equations
where the terms \(E_j(t)\) are given by the following expression
and satisfy
Proof
Recall that the \(\kappa _j(t)\) are obtained from the recurrence (3.11). We already know from Lemma 3.3 and Corollary 3.5 that the proposition holds for \(j=2\). Let us start from \(\kappa _2(t)\) as given in (3.7), and denote \((t\partial _t)^{(k)}\) the k-th iteration of the operator \(t\partial _t\). Use (3.13) with H the first two terms in the right-hand side of (3.7) to obtain directly by induction that for \(j>2\),
which are the first two terms on the right-hand side of (A.6). Thus, the terms \(E_j\) also satisfy the recurrence
To prove (A.7) for \(j>2\) it is enough to verify that the expression satisfies the above recurrence, which follows by a straightforward induction in j.
Since \(A_r(\lambda ^\ell )/\lambda \) is a polynomial in \(\lambda \) for each \(r\ge 1\), the above series is easily seen to be bounded from above by a constant \(C_r\) if \(\lambda <\frac{1}{2}\), say, so we conclude from the mean value theorem that, if \(t>\text{ e }^{-\frac{\pi }{2}}\) (and then \(\text{ e }^{-\frac{4\pi ^2}{|\log t|}}<\text{ e }^{-8\pi }<\frac{1}{2}\)),
In addition, recall that the Eulerian polynomials \(A_r\) have non-negative coefficients, and coefficient one in the linear terms for \(r \ge 1\). We obtain from (A.3), by just taking the first term in each series, the following lower bounds:
Thus, (A.8) holds. Indeed, from (A.9) and (A.7), we conclude that there is a positive constant \(C_j\) that may depend on j such that for any \(t>\text{ e }^{-\frac{\pi }{2}}\),
\(\square \)
We computed in Lemma A.1 the derivatives at zero of the cumulant generating function \(K_{X(t)}\). To estimate the remainder in the Taylor formula, we need also the derivatives of \(K_{Z(t)}(\theta )\) at \(\theta \ne 0\). Recall that
Lemma A.3
For each \(j\ge 2\), \(\theta \in {\mathbb {R}}\),
where the functions \(\kappa _j(z)\) are defined for \(z\in {\mathbb {C}}, |z|<1\) by formula (A.3):
Proof
Observe first that, from the same reasoning used to prove (A.3), the functions \(\kappa _j(z)\) satisfy the recurrence \(z\partial _z \kappa _j(z)=\kappa _{j+1}(z)\). From the expression \(K_{Z(t)}(\theta )=L(t \text{ e }^{i\theta /\sigma (t)})-L(t)-i\theta \frac{\kappa _1(t)}{\sigma (t)}\) in terms of \(L(z):=\sum _{\ell \ge 1}\frac{1}{\ell }\frac{z^\ell }{1-z^\ell }\), it is straightforward to see by differentiating the series that
Differentiating the last expression, we obtain, using the recurrence for the \(\kappa _j\)’s,
which is the desired expression for \(j=2\). Successive differentiation using the recurrence yields the general formula. \(\square \)
Corollary A.4
The derivatives of \( K_{Z(t)}(\theta )\) satisfy
for some positive constant \(C_j\) that may depend on j.
Proof
From Lemma A.3,
where to estimate the denominators we use that \(| 1-(t \text{ e }^{i\theta /\sigma (t)})^\ell |\ge 1-t^\ell \), and to estimate the numerators it is enough to observe that the Eulerian polynomials have real positive coefficients. The right-hand side above is precisely that in item (a) in the statement. To prove the inequality (b), we write, from (A.6) for \(\kappa _j(t)\) and \(\sigma ^2(t)=\kappa _2(t)\):
For each \(j\ge 3\), we take \(t=t_n\) above and use (A.10) and (3.19) to conclude that (b) in the statement holds. \(\square \)
Rights and permissions
About this article
Cite this article
Brassesco, S., Meyroneinc, A. An expansion for the number of partitions of an integer. Ramanujan J 51, 563–592 (2020). https://doi.org/10.1007/s11139-019-00163-y
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11139-019-00163-y
Keywords
- Integer partitions
- Asymptotic expansions
- Asymptotic formulae
- Central limit theorem
- Expansions in cumulants