Title: Pattern Avoidance by Even Permutations
Speaker: Andrew Baxter, Rutgers University
Date: Wednesday, September 29, 2010 12:10pm
Location: Graduate Student Lounge, 7th Floor, Hill Center, Rutgers University, Busch Campus, Piscataway, NJ
Questions regarding the containment/avoidance of permutation patterns have been considered for over 20 years. In particular, it is of interest to know the number of permutations of length n which avoid a given set of patterns. Recently, effort has gone into asking how many permutations of length n with a given property avoid a given set of patterns. For example, last year's seminar had a talk by Aaron Jaggard regarding pattern-avoiding involutions. In this talk I will summarize my work with Jaggard regarding the number of even permutations avoiding a set of patterns. No knowledge of permutation patterns will be assumed.