Lara Pudwell, Valparaiso University

Abstract

Let ρ be a permutation pattern and let S be a set of permutations. A permutation in S is ρ-optimal if it contains at least as many copies of ρ as any other member of S of the same length. In this talk, we focus on the structure of ρ-optimal permutations for some well-known sets of permutations such as when S is a classical pattern class and when S is the set of alternating permutations.