Sponsored by the Rutgers University Department of Mathematics and the
Center for Discrete Mathematics and Theoretical Computer Science (DIMACS)
Title: Enumeration schemes and the insertion encoding
Speaker: Vince Vatter, University of Florida
Date: Thursday, April 26, 2012 5:00pm
Location: Hill Center, Room 705, Rutgers University, Busch Campus, Piscataway, NJ
Abstract:
The two general techniques for automatically enumerating permutation classes are the enumeration schemes of Zeilberger and the insertion encoding of Albert, Linton, and Ruskuc. I will discuss my recent simplification of the insertion encoding, its similarities with enumeration schemes, and a possible method of combining the two approaches.