On a likely shape of the random Ferrers diagram (Q1356117)

The author studies the random partitions of a large integer \(n\), under the assumption that all such partitions are equally likely. The main results are group-theoretical applications in Theorems 3 and 4. \textit{P. Erdős} and \textit{P. Turán} [Acta Math. Acad. Sci. Hung. 19, 413-435 (1968; Zbl 0235.20004)] obtained a logarithmic asymptotic formula for the centralizer size for an element of a random conjugacy class in the symmetric group \(S_n\) . Theorem 4 improves this result and shows that both the size of a random conjugacy class and the size of the centralizer for every element from the class are doubly exponentially distributed in the limit. Theorem 3 asserts that the likely dimension of a complex irreducible representation of \(S_n\) is \[ (n!)^{1/2}\exp (-An+ O(n^{3/4} \log^{3/2}n)) \] where \[ A= 3/2- \gamma+\log (6^{1/2} \pi^{-1})- 6\pi^{-2} \sum_{j=1}^\infty j^{-2}\log j=0.1040493\dots\;. \] This result significantly simplifies the \(A\)-formula and improves the previous remainder estimate \(O(n^{7/8} \log^4n)\) of \textit{P. Turán} and \textit{M. Szalay} [Acta Math. Acad. Sci. Hung. 32, 129-155 (1978; Zbl 0391.10031)]. The author uses the conditioning device of \textit{B. Fristedt} [Trans. Am. Math. Soc. 337, 703-735 (1993; Zbl 0795.05009)]. Theorem 1 confirms a conjecture of \textit{R. Arratia} and \textit{S. Tavaré} [Adv. Math. 104, 90-154 (1994; Zbl 0802.60008)]. Theorem 5 is a functional limit theorem implying that the card-shuffling Markov chain of \textit{P. Diaconis} and \textit{M. Shahshahani} [Z. Wahrscheinlichkeitstheor. Verw. Geb. 57, 159-179 (1981; Zbl 0485.60006)] is asymptotically Gaussian.