Wednesday, October 10, 2018 at 4:15pm to 5:15pm
SPEAKER: Benjamin Gunby (Harvard University
TITLE: The asymptotics of pattern classes of set partitions
In 2003, Marcus and Tardos proved the Stanley-Wilf Conjecture, that every proper pattern class of permutations grows at rate at most exponential. The concept of pattern containment can be naturally applied to other structures as well, along with the corresponding notion of pattern class. We will discuss the analogous problem on set partitions; that is, classifying the growth rates of pattern classes of set partitions up to an exponential factor.