Sponsored by the Rutgers University Department of Mathematics and the
Center for Discrete Mathematics and Theoretical Computer Science (DIMACS)
Title: Functional Equations for Patterns in Permutations
Speaker: Brian Nakamura, Rutgers University
Date: Thursday, April 3, 2014 5:00pm
Location: Hill Center, Room 705, Rutgers University, Busch Campus, Piscataway, NJ
I will discuss how certain functional equations can be used to study permutations avoiding a pattern and the generalized case where permutations contain exactly k copies of a pattern. This enables us to produce new enumeration algorithms for certain patterns. In particular, this approach can be applied to the notoriously difficult pattern 1324 and used to compute new terms for the sequence enumerating 1324-avoiding permutations.