The enumeration of fully commutative affine permutations

The enumeration of fully commutative affine permutations

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...

Full description

Bibliographic Details
Main Authors: Christopher R. H. Hanusa, Brant C. Jones
Format: Article
Language:English
Published: Discrete Mathematics & Theoretical Computer Science 2011-01-01
Series:Discrete Mathematics & Theoretical Computer Science
Subjects:
affine coxeter group
abacus diagram
window notation
complete notation
fully commutative
[math.math-co] mathematics [math]/combinatorics [math.co]
[info.info-dm] computer science [cs]/discrete mathematics [cs.dm]
Online Access:https://dmtcs.episciences.org/2925/pdf

Internet

https://dmtcs.episciences.org/2925/pdf

Similar Items