Confirming two conjectures about the integer partitions

DOI10.1006/jcta.1999.2986zbMath0937.05008OpenAlexW2022845685WikidataQ123121760 ScholiaQ123121760MaRDI QIDQ1806217

Boris G. Pittel

Publication date: 20 December 1999

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/f36fd65f52bbbac05a578ff48bef47b7c174319b

Mathematics Subject Classification ID

Central limit and other weak theorems (60F05) Combinatorial aspects of partitions of integers (05A17) Combinatorial probability (60C05) Zero-one laws (60F20) Vertex degrees (05C07)

Related Items (13)

Statistics for unimodal sequences ⋮ Asymptotic joint distribution of the extremities of a random Young diagram and enumeration of graphical partitions ⋮ Integer partitions, probabilities and quantum modular forms ⋮ Bounds on Kronecker coefficients via contingency tables ⋮ Sufficient Conditions for Graphicality of Bidegree Sequences ⋮ The sequence of prime gaps is graphic ⋮ How often are two permutations comparable? ⋮ Efficient counting of degree sequences ⋮ How likely is an LLD degree sequence to be graphical? ⋮ On comparability of bigrassmannian permutations ⋮ Limit Shapes via Bijections ⋮ Fast Sequential Creation of Random Realizations of Degree Sequences ⋮ On the distribution of the number of Young tableaux for a uniformly random diagram

Cites Work

• On a likely shape of the random Ferrers diagram
• The lattice of integer partitions
• A recurrence for counting graphical partitions
• On graphical partitions
• Seven criteria for integer sequences being graphic
• The Structure of Random Partitions of Large Integers
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Confirming two conjectures about the integer partitions