An effective bound for the partition function (Q2316333): Difference between revisions

Let \(p(n)\) denote the number of partitions of \(n\). In [Adv. Math. 246, 198--219 (2013; Zbl 1304.11021)], \textit{J. H. Bruinier} and \textit{K. Ono} derive a formula of \(p(n)\) as a finite sum of algebraic numbers which lie in the usual discriminant \(1-24n\) ring class field. The main result in the paper under review is a simplified estimate of the formula Bruinier and Ono of \(p(n)\) with an explicit bound on the error term. They prove that \[p(n)=M(n)+E(n),\] for all \(n\in\mathbb{N}\), where the main term \(M(n)\) is obtained from the formula Bruinier and Ono, and the error term \(E(n)\) satsify \[|E(n)|\le 5.6044\times 10^{23}\cdot \frac{H(1-24 n)}{24n-1},\] where \(H(D)\) is the Hurwitz-Kronecker class number.