Wilf-collapse in permutation classes having two basis elements of size three
From MaRDI portal
Abstract: We consider permutation classes having two basis elements of size three and one further basis element. We completely classify the possible enumeration sequences of such classes and demonstrate that there are far fewer of them than might be expected in principle.
Recommendations
Cites work
- A general theory of Wilf-equivalence for Catalan structures
- Analytic combinatorics
- Equipopularity classes in the separable permutations
- Grid classes and the Fibonacci dichotomy for restricted permutations
- On growth rates of closed permutation classes
- On multiple pattern avoiding set partitions
- On the effective and automatic enumeration of polynomial permutation classes
- Pattern avoidance in compositions and multiset permutations
- Permutation classes
- Permutation classes of polynomial growth
- Permutations avoiding two patterns of length three
- Rationality, irrationality, and Wilf equivalence in generalized factor order
- Restricted permutations
- The Möbius function of a composition poset
- Wilf-equivalence on \(k\)-ary words, compositions, and parking functions
This page was built for publication: Wilf-collapse in permutation classes having two basis elements of size three
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5377040)