Sponsored by the Rutgers University Department of Mathematics and the

Center for Discrete Mathematics and Theoretical Computer Science (DIMACS)

**Co-organizers:****Andrew Baxter**, Rutgers University, baxter{at} math [dot] rutgers [dot] edu**Doron Zeilberger**, Rutgers University, zeilberg {at} math [dot] rutgers [dot] edu

Title: Permutation classes with rational generating functions

Speaker: **Vince Vatter**, Dartmouth College

Date: Thursday, December 10, 2009 5:00pm

Location: Hill Center, Room 705, Rutgers University, Busch Campus, Piscataway, NJ

Abstract:

It is commonly believed that most permutation classes have very complicated, in fact, non-holonomic, generating functions. Yet some permutation classes (those with the simplest structure) possess rational generating functions. I will survey the ongoing (and seemingly quite difficult problem) of characterizing such classes, focusing on what can be done automatically via Maple.