The enumeration of fully commutative affine permutations
Combinatorics
2009-12-11 v2
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.
Keywords
Cite
@article{arxiv.0907.0709,
title = {The enumeration of fully commutative affine permutations},
author = {Christopher R. H. Hanusa and Brant C. Jones},
journal= {arXiv preprint arXiv:0907.0709},
year = {2009}
}
Comments
18 pages; final version