The enumeration of fully commutative affine permutations

Details The enumeration of fully commutative affine permutations The enumeration of fully commutative affine permutations

2009-07-03

arxiv.org/abs/0907.0709v2

Mathematics

Combinatorics

18 pages; final version

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

The enumeration of fully commutative affine permutations does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with The enumeration of fully commutative affine permutations, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The enumeration of fully commutative affine permutations will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-529707