A formula for the number of partitions of \(n\) in terms of the partial Bell polynomials (Q2075085): Difference between revisions

A partition of a nonnegative integer \(n\) is a finite sequence of weakly decreasing positive integers whose sum is \(n\). Let \(p(n)\) denote the number of partitions of \(n\). In this paper under review, the author derives a formula for \(p(n)\) in terms of the partial Bell polynomials \(B_{n,k}\) utilizing Faà di Bruno's formula [\textit{L. Comtet}, Advanced combinatorics. The art of finite and infinite expansions. Translated from the French by J. W. Nienhuys. Rev. and enlarged ed. Dordrecht, Holland - Boston, U.S.A.: D. Reidel Publishing Company (1974; Zbl 0283.05001)] and Euler's pentagonal number theorem. More precisely, the author proves that \[ p(n)=\dfrac{1}{n!}\sum_{k=0}^n(-1)^kk!B_{n,k}(\lambda_1,\lambda_2,\ldots,\lambda_{n-k+1}), \] where \[ \lambda_m=\begin{cases} (-1)^{\frac{1+\sqrt{1+24m}}{6}}m! \quad &\text{if }\frac{1+\sqrt{1+24m}}{6}\in\mathbb{Z},\\ (-1)^{\frac{1-\sqrt{1+24m}}{6}}m! \quad &\text{if }\frac{1-\sqrt{1+24m}}{6}\in\mathbb{Z},\\ 0 \quad &\text{otherwise}, \end{cases} \] and where \[ B_{n,k}:=B_{n,k}(x_1,x_2,\ldots,x_{n-k+1})=\sum_{\substack{1\leq i\leq n,\:\ell_i\in\mathbb{N}\\ \sum_{i=1}^ni\ell_i=n\\ \sum_{i=1}^n\ell_i=k}}\dfrac{n!}{\prod_{i=1}^{n-k+1}\ell_i!} \prod_{i=1}^{n-k+1}{\left(\dfrac{x_i}{i!}\right)}^{\ell_i}. \] Also, he proves that \[ p(n)=\sum_{r=0}^n(-1)^r\binom{n+1}{r+1}p_r(n), \] where \(p_r(n)\) is defined by \[ \sum_{n=0}^\infty p_r(n)q^n=\prod_{j=1}^\infty(1-q^j)^r. \]