School of Mathematical Sciences

Pattern-avoiding permutations and their applications menu

Pattern-avoiding permutations and their applications

Tony Guttmann, Melbourne
Fri, 31/03/2017 - 16:00
Queen's building W316
Seminar series: 

In the 1960s and 1970s computer scientists attempted to classify the most prominent data structures in terms of the permutations they could sort. That is, how many of the n! permutations of length n could be sorted, within that data structure, to give as output the identity permutation? This study then gave rise to the broader study of questions such as "how many permutations avoid a given pattern of length 3, or 4 or 5?" We review the field, and present some solutions and conjectures for previously open problems. (Joint work with Andrew Conway and Andrew Elvey-Price).