Enumeration of small Wilf classes avoiding 1342 and two other 4-letter patterns
From MaRDI portal
Abstract: This paper is one of a series whose goal is to enumerate the avoiders, in the sense of classical pattern avoidance, for each triple of 4-letter patterns. There are 317 symmetry classes of triples of 4-letter patterns, avoiders of 267 of which have already been enumerated. Here we enumerate avoiders for all small Wilf classes that have a representative triple containing the pattern 1342, giving 40 new enumerations and leaving only 13 classes still to be enumerated. In all but one case, we obtain an explicit algebraic generating function that is rational or of degree 2. The remaining one is shown to be algebraic of degree 3. We use standard methods, usually involving detailed consideration of the left to right maxima, and sometimes the initial letters, to obtain an algebraic or functional equation for the generating function.
Recommendations
- Enumeration of small Wilf classes avoiding 1324 and two other 4-letter patterns
- Enumeration of permutations avoiding a triple of 4-letter patterns is almost all done
- Wilf classification of triples of 4-letter patterns
- Wilf classification of triples of 4-letter patterns. II
- On permutations avoiding 1324, 2143, and another 4-letter pattern
Cited in
(12)- On partially ordered patterns of length 4 and 5 in permutations
- Nine classes of permutations enumerated by binomial transform of Fine's sequence
- Pattern avoidance in double lists
- Wilf classification of triples of 4-letter patterns
- Wilf classification of triples of 4-letter patterns. II
- A Wilf class composed of 19 symmetry classes of quadruples of 4-letter patterns
- Pattern avoiding meandric permutations
- 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
- Enumeration of permutations avoiding a triple of 4-letter patterns is almost all done
- Combinatorial exploration: an algorithmic framework for enumeration
This page was built for publication: Enumeration of small Wilf classes avoiding 1342 and two other 4-letter patterns
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5218111)