Descent Functions and Random Young Tableaux
Combinatorics
2007-05-23 v2 Probability
Abstract
The expectation of the descent number of a random Young tableau of a fixed shape is given, and concentration around the mean is shown. This result is generalized to the major index and to other descent functions. The proof combines probabilistic arguments together with combinatorial character theory. Connections with Hecke algebras are mentioned.
Cite
@article{arxiv.math/9910165,
title = {Descent Functions and Random Young Tableaux},
author = {Ron M. Adin and Yuval Roichman},
journal= {arXiv preprint arXiv:math/9910165},
year = {2007}
}
Comments
20 pages, final form; to appear in Combinatorics, Probability and Computing