Christopher R. H. Hanusa ; Brant C. Jones
-
The enumeration of fully commutative affine permutations
dmtcs:2925 -
Discrete Mathematics & Theoretical Computer Science,
January 1, 2011,
DMTCS Proceedings vol. AO, 23rd International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2011)
-
https://doi.org/10.46298/dmtcs.2925
The enumeration of fully commutative affine permutationsArticle
Authors: Christopher R. H. Hanusa 1; Brant C. Jones 2
0000-0002-5668-3950##NULL
Christopher R. H. Hanusa;Brant C. Jones
1 Department of Mathematics [New York CUNY]
2 Department of Mathematics and Statistics
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.