An almost‐bijective proof of an asymptotic property of partitions

DOI10.1002/RSA.20180MaRDI QIDQ5433261zbMATH OpenOpenAlexWikidataFDO

Authors Aaron D. Jaggard

Publication date 8 January 2008

Published in Random Structures \& Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/rsa.20180

zbMATH Keywords

asymptotic probabilityinteger partitionpart multiplicity

Mathematics Subject Classification ID

Combinatorial aspects of partitions of integers (05A17) Combinatorial probability (60C05)

Recommendations

• Asymptotics of random partitions of a set
• Confirming two conjectures about the integer partitions
• Sampling parts of random integer partitions: a probabilistic and asymptotic analysis
• Large distinct part sizes in a random integer partition
• scientific article; zbMATH DE number 4154550

Cited in

(3)

• A new bijective proof of a partition theorem of K. Alladi
• A bijection for Euler's partition theorem in the spirit of Bressoud
• Proof of a bi-symmetric septuple equidistribution on ascent sequences

This page was built for publication: An almost‐bijective proof of an asymptotic property of partitions

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