Non-crossing partitions and a diameter problem

Seminar
Speaker
Ron Adin (BIU)
Date
10/01/2016 - 15:30 - 14:00Add to Calendar 2016-01-10 14:00:00 2016-01-10 15:30:00 Non-crossing partitions and a diameter problem 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. Building 216, Room 201 אוניברסיטת בר-אילן - Department of Mathematics mathoffice@math.biu.ac.il Asia/Jerusalem public
Place
Building 216, Room 201
Abstract
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.

Last Updated Date : 07/01/2016