The enumeration of fully commutative affine permutations

International audience 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 w...

Full description

Bibliographic Details
Main Authors: Hanusa, Christopher R. H., Jones, Brant C.
Other Authors: Department of Mathematics New York CUNY, City University of New York New York (CUNY), Department of Mathematics and Statistics (James Madison University), James Madison University, Bousquet-Mélou, Mireille and Wachs, Michelle and Hultman, Axel
Format: Conference Object
Language:English
Published: HAL CCSD 2011
Subjects:
Online Access:https://hal.inria.fr/hal-01215077
https://hal.inria.fr/hal-01215077/document
https://hal.inria.fr/hal-01215077/file/dmAO0141.pdf
Description
Summary:International audience 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. Nous présentons une fonction génératrice qui énumère les permutations affines totalement commutatives par leur rang et par leur longueur de Coxeter, généralisant les formules dues à Stembridge et à Barcucci–Del Lungo–Pergola–Pinzani. Pour un rang précis, les fonctions génératrices ont des coefficients qui sont périodiques de période divisant leur rang. Nous obtenons des résultats qui expliquent la structure des permutations affines totalement commutatives. L'article dessous est un aperçu des résultats; la version complète appara\^ıt ailleurs.