Skip to Main content Skip to Navigation
Conference papers

Fully commutative elements and lattice walks

Abstract : An element of a Coxeter group $W$ is fully commutative if any two of its reduced decompositions are related by a series of transpositions of adjacent commuting generators. These elements were extensively studied by Stembridge in the finite case. In this work we deal with any finite or affine Coxeter group $W$, and we enumerate fully commutative elements according to their Coxeter length. Our approach consists in encoding these elements by various classes of lattice walks, and we then use recursive decompositions of these walks in order to obtain the desired generating functions. In type $A$, this reproves a theorem of Barcucci et al.; in type $\tilde{A}$, it simplifies and refines results of Hanusa and Jones. For all other finite and affine groups, our results are new.
Document type :
Conference papers
Complete list of metadata
Contributor : Alain Monteil <>
Submitted on : Tuesday, November 17, 2015 - 10:20:27 AM
Last modification on : Wednesday, July 8, 2020 - 12:43:15 PM
Long-term archiving on: : Thursday, February 18, 2016 - 11:43:02 AM


Publisher files allowed on an open archive


  • HAL Id : hal-01229714, version 1


Riccardo Biagioli, Frédéric Jouhet, Philippe Nadeau. Fully commutative elements and lattice walks. 25th International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2013), 2013, Paris, France. pp.145-156. ⟨hal-01229714⟩



Record views


Files downloads