For more information about this meeting, contact Mary Anne Raymond.
| Title: | Enumeration Schemes and Their Extensions and Refinements |
|---|
| Seminar: | Combinatorics/Partitions Seminar |
|---|
| Speaker: | Andrew Baxter, Rutgers |
|---|
| Abstract: |
|---|
| The notion of an enumeration scheme, as introduced by Zeilberger (1998) and improved by Vatter (2008), encodes a recurrence which can quickly compute the number of permutations avoiding a given set of patterns. The computation of these schemes was automated by Vatter in a Maple package dubbed WILFPLUS, which Zeilberger further improved in his Maple package VATTER. Pudwell (2008) has extended enumeration schemes to the related contexts of pattern-avoiding words and barred-patterns. We will discuss these developments, as well as a refinement which counts according to the inversion numbers of the permutations. |
Room Reservation Information
| Room Number: | MB106 |
|---|
| Date: | 04 / 13 / 2010 |
|---|
| Time: | 11:15am - 12:05pm |
|---|
