Enumeration and Wilf-classification of permutations avoiding four patterns of length 4
From MaRDI portal
Recommendations
- Wilf classification of subsets of six and seven four-letter patterns
- Wilf classes of pairs of permutations of length 4
- Wilf classification of subsets of four letter patterns
- Enumeration of small Wilf classes avoiding 1324 and two other 4-letter patterns
- A Wilf class composed of 19 symmetry classes of quadruples of 4-letter patterns
Cites work
- 321-polygon-avoiding permutations and Chebyshev polynomials
- A holonomic systems approach to special functions identities
- A Wilf class composed of 19 symmetry classes of quadruples of 4-letter patterns
- Asymptotic values for degrees associated with strips of Young diagrams
- Classification of forbidden subsequences of length 4
- Enumeration of permutations avoiding a triple of 4-letter patterns is almost all done
- Equivalence classes of mesh patterns with a dominating pattern
- Exact enumeration of 1342-avoiding permutations: A close link with labeled trees and planar maps
- Finding regular insertion encodings for permutation classes
- Finite transition matrices for permutations avoiding pairs of length four patterns
- Finitely labeled generating trees and restricted permutations
- Forbidden subsequences
- Generating permutations with restricted containers
- Generating trees and forbidden subsequences
- Generating trees and the Catalan and Schröder numbers
- scientific article; zbMATH DE number 1099195 (Why is no real title available?)
- scientific article; zbMATH DE number 2024859 (Why is no real title available?)
- Inflations of geometric grid classes: three case studies
- Layered restrictions and Chebyshev polynomials
- Permutation patterns and cell decompositions
- Restricted 132-avoiding permutations
- Restricted permutations
- Restricted permutations
- Restricted permutations and the wreath product
- Separable \(d\)-permutations and guillotine partitions
- Standard Young tableaux of height 4 and 5
- Symmetric functions and P-recursiveness
- Three-letter-pattern avoiding permutations and functional equations
- Wilf classes of pairs of permutations of length 4
- Wilf classification of subsets of eight and nine four-letter patterns
- Wilf classification of subsets of four letter patterns
- Wilf classification of subsets of six and seven four-letter patterns
- Wilf classification of triples of 4-letter patterns
- Wilf classification of triples of 4-letter patterns. II
Cited in
(15)- On the 4-permutational property
- Finite transition matrices for permutations avoiding pairs of length four patterns
- Wilf classes of pairs of permutations of length 4
- Enumeration of Wilf classes in S_n o C_r for two patterns of length 3
- Wilf classification of subsets of four letter patterns
- Wilf classification of subsets of eight and nine four-letter patterns
- Twelve subsets of permutations enumerated as maximally clustered permutations
- A Wilf class composed of 19 symmetry classes of quadruples of 4-letter patterns
- scientific article; zbMATH DE number 7640030 (Why is no real title available?)
- Enumeration of Dumont permutations avoiding certain four-letter patterns
- Enumeration of small Wilf classes avoiding 1324 and two other 4-letter patterns
- Wilf classification of subsets of six and seven four-letter patterns
- Enumeration and Wilf-classification of permutations avoiding five patterns of length 4
- On d-permutations and pattern avoidance classes
- Combinatorial exploration: an algorithmic framework for enumeration
This page was built for publication: Enumeration and Wilf-classification of permutations avoiding four patterns of length 4
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5121940)
