Partitions of n into t n parts

DOI10.1016/J.EJC.2004.02.005MaRDI QIDQ703598zbMATH OpenOpenAlexFDO

Authors Dan Romik

Publication date 11 January 2005

Published in European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ejc.2004.02.005

Mathematics Subject Classification ID

Combinatorial aspects of partitions of integers (05A17)

Review text

\textit{G. Szekeres} [Q. J. Math., Oxf. II. Ser. 4, 96--111 (1953; Zbl 0050.04101)] used complex analysis to prove an asymptotic formula for \(P(n, k)\), the number of unordered partitions of \(n\) into at most \(k\) parts. \textit{E. R. Canfield} [Electron. J. Comb. 4, Research paper R6, 16p. (1997); printed version J. Comb. 4, 51--66 (1997; Zbl 0885.05015)] simplified the formula and avoided the use of complex analysis. Here the author proves this result again when \(k\) is at least a constant times \(\sqrt{n}\) using a central limit theorem of \textit{B. Fristedt} [Trans. Am. Math. Soc. 337, 703--735 (1993; Zbl 0795.05009)]. Using a probabilitistic approach he goes on to derive asympototics for the number of minimal difference \(d\) partitions with a given number of parts.

Recommendations

• From recursions to asymptotics: On Szekeres' formula for the number of partitions
• On some asymptotic formulas in the theory of partitions
• scientific article; zbMATH DE number 4154550
• scientific article; zbMATH DE number 4185750
• scientific article; zbMATH DE number 2076785

Cites work

• From recursions to asymptotics: On Szekeres' formula for the number of partitions
• scientific article; zbMATH DE number 3577263 (Why is no real title available?)
• On a likely shape of the random Ferrers diagram
• Partitions and compositions defined by inequalities
• Random partitions with non-negative \(r\)th differences
• SOME ASYMPTOTIC FORMULAE IN THE THEORY OF PARTITIONS (II)
• The Structure of Random Partitions of Large Integers
• Über Partitionen mit Differenzenbedingungen

Cited in

(13)

• Statistics for unimodal sequences
• Exact limit theorems for restricted integer partitions
• Partitions into distinct parts with bounded largest part
• Limit shape of a random integer partition with a bounded max-to-min ratio of parts sizes
• From recursions to asymptotics: Durfee and dilogarithmic deductions
• A generalized Hardy-Ramanujan formula for the number of restricted integer partitions
• Counting partitions inside a rectangle
• Maximum entropy and integer partitions
• Independent sets of a given size and structure in the hypercube
• Limit shapes for unimodal sequences
• Boltzmann distribution on ``short integer partitions with power parts: limit laws and sampling
• Note on square-root partitions into distinct parts
• Meinardus' theorem on weighted partitions: Extensions and a probabilistic proof

This page was built for publication: Partitions of \(n\) into \(t\sqrt n\) parts

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