Andrew Crites
-
Extended Abstract for Enumerating Pattern Avoidance for Affine Permutations
dmtcs:2819 -
Discrete Mathematics & Theoretical Computer Science,
January 1, 2010,
DMTCS Proceedings vol. AN, 22nd International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2010)
-
https://doi.org/10.46298/dmtcs.2819
Extended Abstract for Enumerating Pattern Avoidance for Affine PermutationsConference paper
Authors: Andrew Crites 1
NULL
Andrew Crites
1 Department of Mathematics [Seattle]
In this paper we study pattern avoidance for affine permutations. In particular, we show that for a given pattern p, there are only finitely many affine permutations in ˜Sn that avoid p if and only if p avoids the pattern 321. We then count the number of affine permutations that avoid a given pattern p for each p in S3, as well as give some conjectures for the patterns in S4. This paper is just an outline; the full version will appear elsewhere.