Seminar:
Spring 2012, Thursdays, Milner 216, 4:00-4:50 PM
Date: March 29
Mitch Phillipson
Abstract
Starting with the sequence $12\cdots n,$ what permutations are possible when this is sorted through a stack? With the rise of computers, this question became very interesting and led to a branch of Combinatorics called Pattern Avoidance. In this talk I'll answer the above question and discuss pattern avoidance in other structures such as graphs, words and tableau.