1. Almost avoiding permutations
- Author
-
Vincent Vatter, Shalosh B. Ekhad, Robert Brignall, and Rebecca Smith
- Subjects
Discrete mathematics ,Mathematics::Combinatorics ,Partial permutation ,Bit-reversal permutation ,Almost avoidance ,Restricted permutation ,Permutation pattern ,Cyclic permutation ,Theoretical Computer Science ,Combinatorics ,Derangement ,Permutation ,Permutation class ,FOS: Mathematics ,Mathematics - Combinatorics ,Discrete Mathematics and Combinatorics ,Combinatorics (math.CO) ,Computer Science::Databases ,Mathematics - Abstract
We investigate the notion of almost avoiding a permutation: $\pi$ almost avoids $\beta$ if one can remove a single entry from $\pi$ to obtain a $\beta$-avoiding permutation.
- Published
- 2009
- Full Text
- View/download PDF