Sponsored by the Rutgers University Department of Mathematics and the
Center for Discrete Mathematics and Theoretical Computer Science (DIMACS)
Title: Machines for Counting Permutations Avoiding Patterns
Speaker: Nathaniel Shar, Rutgers University
Date: Thursday, April 9, 2015 5:00pm
Location: Hill Center, Room 705, Rutgers University, Busch Campus, Piscataway, NJ
Abstract:
We will look at some new technology for counting permutations avoiding patterns, and apply it to some easy and some not-so-easy cases. Among other things, we will rediscover Miklós Bóna's formula for the number of permutations avoiding 1342. You don't need to know what a permutation pattern is to understand this talk. This is joint work with Michael H. Albert, Cheyne Homberger, Jay Pantone, and Vince Vatter.