Stochastic monotonicity in Young graph and Thoma theorem
Combinatorics
2016-03-10 v1 Probability
Representation Theory
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 . 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 which are non-negative on Hall--Littlewood polynomials.
Cite
@article{arxiv.1411.3307,
title = {Stochastic monotonicity in Young graph and Thoma theorem},
author = {Alexey Bufetov and Vadim Gorin},
journal= {arXiv preprint arXiv:1411.3307},
year = {2016}
}
Comments
18 pages, 2 figures