|Date: Monday, November 06, 2017
Location: 3866 East Hall (4:00 PM to 5:00 PM)
Title: Pattern Avoidance and Combinatorial Statistics for Set Partitions and RGFs
Abstract: Pattern avoidance is a popular topic in combinatorics that can be studied for many objects - the most popular perhaps being permutations. In this talk, we will look at pattern avoidance in set partitions and restricted growth functions (RGFs). These objects are in bijection with each other but in some cases, their avoidance classes actually differ.
Describing the size of the avoidance class of a set partition/RGF is in itself an interesting and (usually) difficult task. Instead of doing this, we will be looking at the distribution over the avoidance classes of a set of combinatorial statistics on RGFs introduced by Michelle Wachs and Dennis White called lb,ls,rb, and rs. These distributions often have interesting combinatorial or number theoretic interpretations.
Speaker: Jonathan Gerhard
Institution: University of Michigan