Wilf classification of three and four letter signed patterns
From MaRDI portal
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.
Recommendations
Cites work
- A new class of Wilf-equivalent permutations
- Classification of forbidden subsequences of length 4
- Combinatorial statistics on type-B analogues of noncrossing partitions and restricted permutations
- Decreasing subsequences in permutations and Wilf equivalence for involutions
- Forbidden subsequences
- Generating trees and the Catalan and Schröder numbers
- Prefix exchanging and pattern avoidance by involutions
- Restricted permutations
- Signed involutions avoiding 2-letter signed patterns
- The permutations 123p₄ p_m and 321p₄ p_m are Wilf-equivalent
Cited in
(8)- New equivalences for pattern avoiding involutions
- Wilf classification of triples of 4-letter patterns
- The 26 Wilf-equivalence classes of length five quasi-consecutive patterns
- Equivalences for pattern avoiding involutions and classification
- Wilf classification of subsets of eight and nine four-letter patterns
- Wilf-collapse in permutation classes having two basis elements of size three
- Pattern avoidance in partial permutations
- Wilf-classification of mesh patterns of short length
This page was built for publication: Wilf classification of three and four letter signed patterns
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q932580)