Abstract
<div class="line" id="line-15"> In the study of permutation patterns, superpatterns are permutations that contain many patterns at least once. For a set P of permutations, we say that a permutation σ is a P -superpattern if it contains every permutation in P , and we denote by sp(P ) the shortest length of all P -superpatterns. When P is the set of layered permutations of length k, it has been shown that sp(P ) = Θ(k log(k)). The notion of superpatterns can be extended naturally to words. In this talk, we explore some generalizations of layered permutations to ‘layered words’ and seek to find shortest lengths for superpatterns containing these sets.</div>
Original language | American English |
---|---|
State | Published - Oct 17 2015 |
Event | Discrete Math Seminar - Savannah, GA Duration: Jan 1 2015 → … |
Conference
Conference | Discrete Math Seminar |
---|---|
Period | 01/1/15 → … |
Disciplines
- Mathematics
- Physical Sciences and Mathematics
Keywords
- Mathematics
- Superpatterns
- Layered permutations
- Plane binary trees