Oriented Flip Graphs and Noncrossing Tree Partitions
1 : Department of Mathematics [Minneapolis]
University of Minnesota, Minneapolis, MN, 55455 -
États-Unis
2 : Department of Mathematics [MIT]
-
Website
Headquarters Office Building 2, Room 236 77 Massachusetts Avenue Cambridge, MA 02139-4307 -
États-Unis
Given a tree embedded in a disk, we define two lattices - the oriented flip graph of noncrossing arcs and the lattice of noncrossing tree partitions. When the interior vertices of the tree have degree 3, the oriented flip graph is equivalent to the oriented exchange graph of a type A cluster algebra. Our main result is an isomorphism between the shard intersection order of the oriented flip graph and the lattice of noncrossing tree partitions. As a consequence, we deduce a simple characterization of c-matrices of type A cluster algebras.
| Subject : | : | Poster |
| Topics | : | Combinatorics |
| PDF version | : |  PDF version |
- Poster
