Enumeration of permutations avoiding a triple of 4-letter patterns is almost all done
From MaRDI portal
Abstract: This paper completes a project to enumerate permutations avoiding a triple T of 4-letter patterns, in the sense of classical pattern avoidance, for every T. There are 317 symmetry classes of such triples T and previous papers have enumerated avoiders for all but 14 of them. One of these 14 is conjectured not to have an algebraic generating function. Here, we find the generating function for each of the remaining 13, and it is algebraic in each case.
Recommendations
- Enumeration of small Wilf classes avoiding 1342 and two other 4-letter patterns
- On permutations avoiding 1324, 2143, and another 4-letter pattern
- On permutations avoiding 1243, 2134, and another 4-letter pattern
- Enumeration of small Wilf classes avoiding 1324 and two other 4-letter patterns
- Wilf classification of triples of 4-letter patterns
Cited in
(11)- On partially ordered patterns of length 4 and 5 in permutations
- Nine classes of permutations enumerated by binomial transform of Fine's sequence
- Almost avoiding pairs of permutations
- Wilf classification of triples of 4-letter patterns
- Enumeration of Dumont permutations avoiding certain four-letter patterns
- Enumeration and Wilf-classification of permutations avoiding four patterns of length 4
- On permutations avoiding 1324, 2143, and another 4-letter pattern
- On permutations avoiding 1243, 2134, and another 4-letter pattern
- Enumeration of small Wilf classes avoiding 1342 and two other 4-letter patterns
- scientific article; zbMATH DE number 2192121 (Why is no real title available?)
- Combinatorial exploration: an algorithmic framework for enumeration
This page was built for publication: Enumeration of permutations avoiding a triple of 4-letter patterns is almost all done
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5218122)
