For more information about this meeting, contact Matthew Katz, James Sellers, George Andrews.
| Title: | Wilf-equivalence in permutation patterns |
|---|
| Seminar: | Combinatorics/Partitions Seminar |
|---|
| Speaker: | Andrew Baxter, PSU |
|---|
| Abstract: |
|---|
| In partition theory, it is often interesting when the
number of partitions of n satisfying condition X equals the number of
partitions satisfying condition Y. We will consider the analogous
question for permutations of length n, where the conditions are
phrased in terms of patterns which the permutations must avoid. Two
patterns are Wilf-equivalent if the number of n-permutations avoiding
one equals the number of n-permutations avoiding the other, and I will
present some of the more powerful techniques to create such
equivalences. |
Room Reservation Information
| Room Number: | MB106 |
|---|
| Date: | 10 / 16 / 2012 |
|---|
| Time: | 11:15am - 12:05pm |
|---|
