DOAJ Open Access 2011

The enumeration of fully commutative affine permutations

Christopher R. H. Hanusa Brant C. Jones

Lihat Sumber DOI

Abstrak

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. This is a summary of the results; the full version appears elsewhere.

Topik & Kata Kunci

Mathematics

Penulis (2)

Christopher R. H. Hanusa

Brant C. Jones

Format Sitasi

APA MLA BibTeX

Hanusa, C.R.H., Jones, B.C. (2011). The enumeration of fully commutative affine permutations. https://doi.org/10.46298/dmtcs.2925

Akses Cepat

Lihat di Sumber doi.org/10.46298/dmtcs.2925

Informasi Jurnal

Tahun Terbit: 2011
Sumber Database: DOAJ
DOI: 10.46298/dmtcs.2925
Akses: Open Access ✓