A generalized Hardy-Ramanujan formula for the number of restricted integer partitions (Q2631701): Difference between revisions

Let \(p_n(N,M)\) denote the number of partitions of \(n\) into parts \(\le N\) with length \(\le M\). Very recently, \textit{L. B. Richmond} [``A George Szekeres formula for restricted partitions'', Preprint, \url{arXiv:1803.08548}] derived an asymptotic formula for \(p_n(N,M)\) when both \(N\) and \(M\) are close to their expected values \(\frac{\sqrt{6n}}{\pi}\log \frac{\sqrt{6n}}{\pi}\). When \(n\) is close to \(NM/2\), an asymptotic formula for \(p_n(N,M)\) was obtained before by \textit{L. Takács} [J. Stat. Plann. Inference 14, 123--142 (1986; Zbl 0616.60016)]. In the paper under review, the authors consider \(p_n(N,M)\) when \(n\) is around \(N\cdot M/r\) with \(r\ne 2\). For \(N\ge 4\sqrt{n}\) and \(M\ge 4\sqrt{n}\), using the saddle-point method they obtain an asymptotic formula for \(p_n(N,M)\) in terms of \(N/\sqrt{n}\) and \(M/\sqrt{n}\).