Presented By: Student Combinatorics Seminar - Department of Mathematics
Student combinatorics: Maximal chains in the non-crossing lattice
Paul Mammen
Non-crossing partitions of a set form a collection of objects that are counted by the Catalan numbers. They have natural analogues for finite Coxeter groups and enjoy remarkable enumerative properties, many of which are only understood in a case-by-case fashion. In this talk, we will see an elementary but uniform approach to enumerating the maximal chains in the non-crossing lattice for a general Coxeter group.
Co-Sponsored By
