Hostname: page-component-848d4c4894-r5zm4 Total loading time: 0 Render date: 2024-06-27T02:21:00.758Z Has data issue: false hasContentIssue false
  • English
  • Français

Descent Functions and Random Young Tableaux

Published online by Cambridge University Press:  25 June 2001

RON M. ADIN  and
YUVAL ROICHMAN
RON M. ADIN
Affiliation:
Department of Mathematics and Computer Science, Bar-Ilan University, Ramat-Gan 52900, Israel (e-mail: radin@math.biu.ac.il, yuvalr@math.biu.ac.il)
YUVAL ROICHMAN
Affiliation:
Department of Mathematics and Computer Science, Bar-Ilan University, Ramat-Gan 52900, Israel (e-mail: radin@math.biu.ac.il, yuvalr@math.biu.ac.il)
Get access Rights & Permissions [Opens in a new window]

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.

Type
Research Article
Information
Combinatorics, Probability and Computing , Volume 10 , Issue 3 , May 2001 , pp. 187 - 201
Copyright
2001 Cambridge University Press

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)