The enumeration of fully commutative affine permutations
Skip to main content
Open Access Publications from the University of California

Department of Mathematics

Other bannerUC Davis

The enumeration of fully commutative affine permutations

  • Author(s): Hanusa, Christopher R. H.;
  • Jones, Brant C.
  • et al.

Published Web Location
No data is associated with this publication.

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.

Item not freely available? Link broken?
Report a problem accessing this item