English

Enumerating pattern avoidance for affine permutations

Combinatorics 2010-11-15 v2

Abstract

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 S~n\widetilde{S}_n 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 S_3, as well as give some conjectures for the patterns in S_4.

Keywords

Cite

@article{arxiv.1002.1933,
  title  = {Enumerating pattern avoidance for affine permutations},
  author = {Andrew Crites},
  journal= {arXiv preprint arXiv:1002.1933},
  year   = {2010}
}

Comments

11 pages, 3 figures; fixed typos and proof of Proposition 6

R2 v1 2026-06-21T14:45:13.330Z