Non-crossing partitions and a diameter problem

Sun, 10/01/2016 - 14:00
The maximal chains in the non-crossing partition lattice have a natural graph structure.
The (still open) problem of determining the diameter of this graph is a trigger for an exciting tour through
reduced words of a Coxeter element in the symmetric group,  a 0-Hecke algebra action, a special EL-labeling, q,t-Catalan numbers, and non-crossing alternating trees.
We shall describe connections, results and open problems in this context.

Joint work with Yuval Roichman.