- Thomas McConville, Kennesaw State University
- The non-revisiting chain property for grid associahedra
- 11/05/2020
- 3:00 PM - 3:50 PM
- Online (virtual meeting)
(Virtual Meeting Link)
- Bruce E Sagan (bsagan@msu.edu)
A grid associahedron is a simple polytope whose faces correspond to nonkissing collections of routes inside a grid graph. The usual associahedron arises as a special case when the graph is a 2 by n rectangle. Other examples of grid associahedra have been considered in connection with combinatorial properties of Grassmannians and with the representation theory of gentle algebras. The 1-skeleton of the grid associahedron has a natural orientation that induces the grid-Tamari order, a poset with many remarkable properties. I will present a new construction of the grid associahedron as a Minkowski sum of order polytopes of fence posets. Using this construction, I will show that the grid-Tamari order has the non-revisiting chain property. This is based on joint work with Alexander Garver.
