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.
| Original language | English |
|---|---|
| Pages (from-to) | 187-201 |
| Number of pages | 15 |
| Journal | Combinatorics Probability and Computing |
| Volume | 10 |
| Issue number | 3 |
| DOIs | |
| State | Published - 2001 |