Abstract
Let Ck be a subset of the set of permutations of length k. We say a Ck-superpattern is a permutation which contains all elements of Ck as a pattern. In this paper, we find bounds on the lengths of superpatterns containing all simple permutations of length k and superpatterns containing all alternating permutations of length k.
Original language | English |
---|---|
Pages (from-to) | 73-95 |
Number of pages | 23 |
Journal | Ars Combinatoria |
Volume | 140 |
State | Published - Jul 2018 |