# Extended Abstract for Enumerating Pattern Avoidance for Affine Permutations

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 $\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$. This paper is just an outline; the full version will appear elsewhere.
Keywords :
Document type :
Conference papers
Domain :

Cited literature [17 references]

https://hal.inria.fr/hal-01186247
Contributor : Coordination Episciences Iam <>
Submitted on : Monday, August 24, 2015 - 3:44:46 PM
Last modification on : Friday, June 28, 2019 - 2:24:04 PM
Long-term archiving on: : Wednesday, November 25, 2015 - 4:43:36 PM

### File

dmAN0146.pdf
Publisher files allowed on an open archive

### Identifiers

• HAL Id : hal-01186247, version 1

### Citation

Andrew Crites. Extended Abstract for Enumerating Pattern Avoidance for Affine Permutations. 22nd International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2010), 2010, San Francisco, United States. pp.661-668. ⟨hal-01186247⟩

Record views