On the number of commutation classes of the longest element in the symmetric group

Abstract

Using the standard Coxeter presentation for the symmetric group $S_n$, two reduced expressions for the same group element are said to be commutation equivalent if we can obtain one expression from the other by applying a finite sequence of commutations. The resulting equivalence classes of reduced expressions are called commutation classes. How many commutation classes are there for the longest element in $S_n$?

arXiv commentFirst submission contained a typo, which has been fixed. 4 pages, 4 figures

Cited by in corpus (1)

• Enumeration of Gelfand-Cetlin type reduced words