The enumeration of fully commutative affine permutations

Authors:
Christopher R. H. Hanusa;Brant C. Jones
Affiliations:
Department of Mathematics, Queens College (CUNY), 65-30 Kissena Blvd., Flushing, NY 11367, United States;Department of Mathematics, One Shields Avenue, University of California, Davis, CA 95616, United States
Venue:
European Journal of Combinatorics
Year:
2010

Citing 9
Cited 0

Some Combinatorial Properties of Schubert Polynomials

Journal of Algebraic Combinatorics: An International Journal
A method for the enumeration of various classes of column-convex polygons

Discrete Mathematics
On the Fully Commutative Elements of Coxeter Groups

Journal of Algebraic Combinatorics: An International Journal
The Enumeration of Fully Commutative Elements of Coxeter Groups

Journal of Algebraic Combinatorics: An International Journal
Steep polyominoes, q-Motzkin numbers and q-Bessel functions

Discrete Mathematics
Kazhdan-Lusztig Polynomials for 321-Hexagon-Avoiding Permutations

Journal of Algebraic Combinatorics: An International Journal
Some permutations with forbidden subsequences and their inversion number

Discrete Mathematics
On 321-Avoiding Permutations in Affine Weyl Groups

Journal of Algebraic Combinatorics: An International Journal
A bijection on core partitions and a parabolic quotient of the affine symmetric group

Journal of Combinatorial Theory Series A

Quantified Score

Hi-index	0.00

Visualization

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.