Confirming two conjectures about the integer partitions

DOI10.1006/JCTA.1999.2986MaRDI QIDQ1806217zbMATH OpenOpenAlexWikidataFDO

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

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

Review text

The author answers a question posed by \textit{I. G. Macdonald} in [Symmetric functions and Hall polynomials. 2nd ed. (Clarendon Press, Oxford) (1995; Zbl 0824.05059)]. He proves that if two partitions, \(\lambda\) and \(\mu\), are chosen uniformly at random and independent of each other from the set of partitions of \(n\), then the probability that \(\lambda\) and \(\mu\) are comparable in the usual dominance order approaches 0 as \(n\) approaches infinity. From the Gale-Ryser theorem, it follows that if \(\pi_n\) is the probability that there exists a bipartite graph on \((X,Y)\) such that \(\lambda\) and \(\mu\) are the degree sequences of the respective vertex sets, then \(\lim_{n\to \infty} \pi_n = 0\). The same methods enable the author to prove a conjecture made by Wilf in 1982: The probability that a randomly chosen partition of \(n\) is the degree sequence of a graph approaches 0 as \(n\) approaches infinity.

Recommendations

Cites work

Cited in

(23)

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

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