Descent Functions and Random Young Tableaux
classification
🧮 math.CO
math.PR
keywords
descentfunctionsrandomyoungalgebrasargumentsaroundcharacter
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.