Braid moves in commutation classes of the symmetric group - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue European Journal of Combinatorics Année : 2017

Braid moves in commutation classes of the symmetric group

Résumé

We prove that the expected number of braid moves in the commutation class of the reduced word $(s_1 s_2 \cdots s_{n-1})(s_1 s_2 \cdots s_{n-2}) \cdots (s_1 s_2)(s_1)$ for the long element in the symmetric group $\mathfrak{S}_n$ is one. This is a variant of a similar result by V. Reiner, who proved that the expected number of braid moves in a random reduced word for the long element is one. The proof is bijective and uses X. Viennot's theory of heaps and variants of the promotion operator. In addition, we provide a refinement of this result on orbits under the action of even and odd promotion operators. This gives an example of a homomesy for a nonabelian (dihedral) group that is not induced by an abelian subgroup. Our techniques extend to more general posets and to other statistics.

Dates et versions

hal-01611482 , version 1 (05-10-2017)

Identifiants

Citer

Thiéry M. Nicolas, Anne Schilling, Graham White, Nathan Williams. Braid moves in commutation classes of the symmetric group. European Journal of Combinatorics, 2017, 62, pp.15 - 34. ⟨10.1016/j.ejc.2016.10.008⟩. ⟨hal-01611482⟩
147 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More