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

The enumeration of fully commutative affine permutations

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

Published Web Location

https://arxiv.org/pdf/0907.0709.pdf
No data is associated with this publication.
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.

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