Return to Colloquia & Seminar listing
Pattern avoidance enumeration and heaps of pieces
Student-Run Discrete Math Seminar| Speaker: | Brant Jones, UC Davis |
| Location: | 2112 MSB |
| Start time: | Thu, Nov 13 2008, 1:10PM |
Several disparate phenomena have been characterized by permutation pattern avoidance including: stack sortability in computer science, geometric information about Schubert varieties, and properties of the set of reduced words of a permutation. In this talk, we will discuss an approach for enumerating certain classes of pattern-avoiding permutations using partial orders called heaps that have been introduced by Viennot and Stembridge. This is joint work with Hugh Denoncourt.