Maximal chains in lattices from graph associahedra: Tamari to the weak order
Samantha Dahlberg, Susanna Fishel

TL;DR
This paper explores the structure of maximal chains in lattices derived from graph associahedra, generalizing weak order and Tamari lattices, with detailed analysis on lollipop graphs and connections to permutation patterns and symmetric functions.
Contribution
It introduces a new class of lattices from graph associahedra, analyzes their maximal chains, and links these to permutation patterns and symmetric functions, extending known combinatorial structures.
Findings
Lattice structures generalize weak order and Tamari lattice.
Maximal chains correspond to partially shiftable tableaux.
Expansion of symmetric functions in Young quasisymmetric Schur functions.
Abstract
In this paper, we study the maximal chains of lattices which generalizes both the weak order and the Tamari lattice: certain lattices of maximal tubings. A maximal tubing poset is defined for any graph , but for the graphs we consider in this paper, the poset is a lattice. Just as the weak order is an orientation of the -skeleton of the permutahedron and the Tamari of the associahedron, each tubing lattice is an orientation of the -skeleton of a graph associahedron. The partial order on is given by a projection from to . In particular, when the graph is the complete graph, the graph associahedron is the the permutahedron, and when it is the path graph, it is the Stasheff associahedron. Our main results are for lollipop graphs, graphs that ``interpolate'' between the path and the complete graphs. For…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Algebra and Logic
