Pattern avoidance and dominating compositions
From MaRDI portal
Abstract: Jel'inek, Mansour, and Shattuck studied Wilf-equivalence among pairs of patterns of the form where is a set partition of size with at least two blocks. They obtained an upper bound for the number of Wilf-equivalence classes for such pairs. We show that their upper bound is the exact number of equivalence classes, thus solving a problem posed by them.
Recommendations
- Avoidance of partially ordered patterns in compositions
- Pattern avoidance in compositions and multiset permutations
- Pattern avoidance in partial permutations
- Avoiding a pair of patterns in multisets and compositions
- Pattern avoidance in matchings and partitions
- Pattern avoidance in poset permutations
- Pattern avoidance: themes and variations
- scientific article; zbMATH DE number 2051147
- Pattern avoidance on graphs
- Pattern avoidance in extensions of comb-like posets
Cites work
- Avoidance of partitions of a three-element set
- Crossings and nestings of matchings and partitions
- scientific article; zbMATH DE number 1178976 (Why is no real title available?)
- On \(abab\)-free and \(abba\)-free set partitions
- On multiple pattern avoiding set partitions
- Pattern avoidance in matchings and partitions
- Pattern avoidance in set partitions.
- The On-Line Encyclopedia of Integer Sequences
Cited in
(4)
This page was built for publication: Pattern avoidance and dominating compositions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6097995)