Abstract
We give some new Wilf equivalences for signed patterns which allow the complete classification of signed patterns of lengths three and four. The problem is considered for pattern avoidance by general as well as involutive signed permutations.
Original language | English |
---|---|
Pages (from-to) | 3125-3133 |
Number of pages | 9 |
Journal | Discrete Mathematics |
Volume | 308 |
Issue number | 15 |
DOIs | |
State | Published - 6 Aug 2008 |
Keywords
- Forbidden subsequences
- Pattern-avoiding permutations
- Signed involutions
- Signed permutations
- Wilf equivalence
ASJC Scopus subject areas
- Theoretical Computer Science
- Discrete Mathematics and Combinatorics