Enumerating pattern avoidance for affine permutations
The electronic journal of combinatorics, Tome 17 (2010)
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 $\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$.
DOI :
10.37236/399
Classification :
05A05, 05A15
Mots-clés : pattern avoidance, number of affine permutations
Mots-clés : pattern avoidance, number of affine permutations
@article{10_37236_399,
author = {Andrew Crites},
title = {Enumerating pattern avoidance for affine permutations},
journal = {The electronic journal of combinatorics},
year = {2010},
volume = {17},
doi = {10.37236/399},
zbl = {1198.05008},
url = {http://geodesic.mathdoc.fr/articles/10.37236/399/}
}
Andrew Crites. Enumerating pattern avoidance for affine permutations. The electronic journal of combinatorics, Tome 17 (2010). doi: 10.37236/399
Cité par Sources :