Simple permutations, alternating permutations, and the superpatterns that contain them

Daniel Gray

Research output: Contribution to journalArticlepeer-review

1 Scopus citations

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 languageEnglish
Pages (from-to)73-95
Number of pages23
JournalArs Combinatoria
Volume140
StatePublished - Jul 2018

Fingerprint

Dive into the research topics of 'Simple permutations, alternating permutations, and the superpatterns that contain them'. Together they form a unique fingerprint.

Cite this