Part I of DOUBLE HEADER!

745 POT; 1-1:45 pm

Speaker:  Daniel Tamayo, Université Paris-Saclay

Title:  On some recent combinatorial properties of permutree congruences
of the weak order

Abstract:

Since the work of Nathan Reading in 2004, the field of lattice
quotients of the weak order has received plenty of attention on the
combinatorial, algebraic, and geometric fronts. More recently, Viviane
Pons and Vincent Pilaud defined permutrees which are combinatorial
objects with nice combinatorial properties that describe a special
family of lattice congruences. In this talk we will give a brief
introduction into the world of (permutree) lattice congruences, how they
lead to structures such as the Tamari and boolean lattice, followed by
connections to pattern avoidance, automata and some examples of sorting
algorithms.

Daniel Tamayo is visiting Martha Yip.