| Date: | Tue, 4 Mar 2008 |
| From: | Denis Chebikin |
| Subject: | SPAMS Thursday 5pm in 4-231 |
Hi everybody,
This week at SPAMS Joel will talk about generalized permutation patterns.
Denis,
on behalf of 2007-08 SPAMS organizers
To say that a permutation w contains a pattern p is to say that w has a
subsequence whose elements appear in the same relative order (or
equivalently have the same relative sizes) as those of p. If we ask in
addition that certain elements of this subsequence be adjacent, we are
speaking of a generalized pattern. We will show (via numerous, hopefully
interesting examples) that enumeration of patterns in permutations can do
nearly everything the budding combinatorialist could desire: recover
interesting sets of permutations, recover various classical and other
permutation statistics, and generate positive-integer sequences of note.