Skip to Main content Skip to Navigation
Conference papers

The enumeration of fully commutative affine permutations

Abstract : We give a generating function for the fully commutative affine permutations enumerated by rank and Coxeter length, extending formulas due to Stembridge and Barcucci–Del Lungo–Pergola–Pinzani. For fixed rank, the length generating functions have coefficients that are periodic with period dividing the rank. In the course of proving these formulas, we obtain results that elucidate the structure of the fully commutative affine permutations. This is a summary of the results; the full version appears elsewhere.
Complete list of metadata

Cited literature [11 references]  Display  Hide  Download
Contributor : Coordination Episciences Iam Connect in order to contact the contributor
Submitted on : Tuesday, October 13, 2015 - 3:06:17 PM
Last modification on : Tuesday, August 13, 2019 - 1:42:01 PM
Long-term archiving on: : Thursday, April 27, 2017 - 12:10:05 AM


Publisher files allowed on an open archive




Christopher R. H. Hanusa, Brant C. Jones. The enumeration of fully commutative affine permutations. 23rd International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2011), 2011, Reykjavik, Iceland. pp.457-468, ⟨10.46298/dmtcs.2925⟩. ⟨hal-01215077⟩



Record views


Files downloads