User Tools

Site Tools


Nate Reff (Binghamton)

The Lattice of Non-Crossing Partitions

Abstract for the Combinatorics Seminar 2008 November 11

The lattice of non-crossing partitions is self-dual in a simple way. I will show that it also has a symmetric chain decomposition by decomposing it into sub-posets that are direct products of smaller non-crossing partition lattices. I will also present a constructive proof of this through words.

This work was done by Simion and Ullman.

seminars/comb/abstract.200811ref.txt · Last modified: 2020/01/29 14:03 (external edit)