A generalized Hardy-Ramanujan formula for the number of restricted integer partitions

DOI10.1016/J.JNT.2019.02.006MaRDI QIDQ2631701zbMATH OpenOpenAlexFDO

Authors Yanyan Li

Publication date 16 May 2019

Published in Journal of Number Theory (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1805.06108

zbMATH Keywords

asymptotic formularestricted integer partitions

Mathematics Subject Classification ID

Combinatorial aspects of partitions of integers (05A17) Analytic theory of partitions (11P82)

Abstract: We derive the asymptotic formula for $p_n(N,M)$, the number of partitions of integer $n$ with part size at most $N$ and length at most $M$. We consider both $N$ and $M$ are comparable to $sqrtn$. This is an extension of the classical Hardy-Ramanujan formula and Szekeres' formula. The proof relies on the saddle point method.

Review text

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}\).

Recommendations

• Hardy-Ramanujan's asymptotic formula for partitions and the central limit theorem
• A Hardy-Ramanujan formula for restricted partitions
• From recursions to asymptotics: On Szekeres' formula for the number of partitions
• Will the real Hardy-Ramanujan formula please stand up?
• Power partitions

Cites work

• A Hardy-Ramanujan formula for restricted partitions
• AN ASYMPTOTIC FORMULA IN THE THEORY OF PARTITIONS
• Analytic combinatorics
• scientific article; zbMATH DE number 192838 (Why is no real title available?)
• scientific article; zbMATH DE number 1222942 (Why is no real title available?)
• scientific article; zbMATH DE number 863491 (Why is no real title available?)
• On a likely shape of the random Ferrers diagram
• Partitions of \(n\) into \(t\sqrt n\) parts
• SOME ASYMPTOTIC FORMULAE IN THE THEORY OF PARTITIONS (II)
• Some asymptotic formulas for lattice paths
• Some asymptotic results on \(q\)-binomial coefficients
• The Structure of Random Partitions of Large Integers

Cited in

(10)

• On the size of the Durfee square of a random integer partition
• Asymptotic formulae for mixed congruence stacks
• Estimate of the number of restricted integer-partitions
• scientific article; zbMATH DE number 4095561 (Why is no real title available?)
• scientific article; zbMATH DE number 729141 (Why is no real title available?)
• Partnership, Partition, and Proof: The Path to the Hardy–Ramanujan Partition Formula
• Will the real Hardy-Ramanujan formula please stand up?
• Counting partitions inside a rectangle
• Maximum entropy and integer partitions
• Asymptotic formulas for some restricted partition functions

This page was built for publication: A generalized Hardy-Ramanujan formula for the number of restricted integer partitions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2631701)