Sponsored by the Rutgers University Department of Mathematics and the
Center for Discrete Mathematics and Theoretical Computer Science (DIMACS)

Drew Sills, Rutgers University, asills {at} math [dot] rutgers [dot] edu
Doron Zeilberger, Rutgers University, zeilberg {at} math [dot] rutgers [dot] edu

Title: Counting Restricted Permutations by Computer

Speaker: Vince Vatter, Rutgers University

Date: September 23, 2004 4:30-5:30pm

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


Restricted permutations arise in many contexts, from sorting machines to algebraic geometry. One of the most popular restricted permutation activities is counting them, a topic about which dozens of papers using ad hoc techniques have been written. I will talk about systematic approaches to the problem that can be (and in fact, have been) taught to a computer, and in particular, how to make one of Doron Zeilberger's algorithms work in many more cases.