Stochastic Monotonicity in Young Graph and Thoma Theorem
Author(s)
Bufetov, Alexey; Gorin, Vadim
Download1411.3307.pdf (411.6Kb)
OPEN_ACCESS_POLICY
Open Access Policy
Creative Commons Attribution-Noncommercial-Share Alike
Terms of use
Metadata
Show full item recordAbstract
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 R, which are non-negative on Hall-Littlewood polynomials.
Date issued
2015-03Department
Massachusetts Institute of Technology. Department of MathematicsJournal
International Mathematics Research Notices
Publisher
Oxford University Press (OUP)
Citation
Bufetov, Alexey and Vadim Gorin. “Stochastic Monotonicity in Young Graph and Thoma Theorem.” International Mathematics Research Notices (March 2015): rnv085 © 2015 The Author(s)
Version: Original manuscript
ISSN
1073-7928
1687-0247