Abstract
Stankova and West showed that for any non-negative integer s and any permutation γ of {4,5,…,s+3} there are as many permutations that avoid 231γ as there are that avoid 312γ. We extend this result to the setting of words.
Original language | English |
---|---|
Pages (from-to) | 87-100 |
Number of pages | 14 |
Journal | Advances in Applied Mathematics |
Volume | 100 |
DOIs | |
Publication status | Published - Sept 2018 |
Externally published | Yes |
Keywords
- Ferrers diagrams
- Ferrers shapes
- Growth diagrams
- Pattern avoidance
- Shape-Wilf-equivalence
- Wilf-equivalence
- Words