Affine permutations and an affine Catalan monoid

1Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We describe results on pattern avoidance arising from the affine Catalan monoid. The schema of affine codes as canonical decompositions in conjunction with two-row moves is detailed, and then applied in studying the Catalan quotient of the 0-Hecke monoid. We prove a conjecture of Hanusa and Jones concerning periodicity in the number of fully-commutative affine permutations. We then re-frame prior results on fully commutative elements using the affine codes.

Cite

CITATION STYLE

APA

Denton, T. (2014). Affine permutations and an affine Catalan monoid. Fields Institute Communications, 71, 339–354. https://doi.org/10.1007/978-1-4939-0938-4_15

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free