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**Lara Pudwell**, Rutgers University, lpudwell {at} math [dot] rutgers [dot] edu**Doron Zeilberger**, Rutgers University, zeilberg {at} math [dot] rutgers [dot] edu

Title: Experimenting with Barred Patterns

Speaker: **Lara Pudwell**, Rutgers University

Date: Thursday, March 13, 2008 5:00pm

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

Abstract:

Barred patterns are a generalization of pattern avoidance in permutations that characterize 2-stack sortable permutations, forest-like permutations, and locally factorial Schubert varieties. I will introduce this new notion of pattern avoidance and show how to use the computer to derive recurrences counting permutations that avoid barred patterns.