Stochastic monotonicity in Young graph and Thoma theorem

Abstract

We show that the order on probability measures, inherited from the dominance order on the Young diagrams, is preserved under natural maps reducing the number of boxes in a diagram by $1$. As a corollary we give a new proof of the Thoma theorem on the structure of characters of the infinite symmetric group. We present several conjectures generalizing our result. One of them (if it is true) would imply the Kerov's conjecture on the classification of all homomorphisms from the algebra of symmetric functions into $\mathbb{R}$ which are non-negative on Hall--Littlewood polynomials.

18 pages, 2 figures

References in corpus (4)

• Law of Large Numbers for Infinite Random Matrices over a Finite Field
• A central limit theorem for the characters of the infinite symmetric group and of the infinite Hecke algebra
• The central limit theorem for extremal characters of the infinite symmetric group
• The problem of describing central measures on path space of graded graphs