Lattice characterization of cyclic interval hypergraphic posets
Abstract
Hypergraphic polytopes H arise as Minkowski sums of simplices indexed by the hyperedges of a hypergraph H. Orienting the 1-skeleton of such a polytope by a certain generic linear functional gives rise to the hypergraphic poset PH. Hypergraphic posets include the weak order for the permutahedron and the Tamari lattice for the associahedron. This motivates the problem of determining when PH is a lattice. In this paper, we give a complete lattice characterization for cyclic interval hypergraphs, extending the result of Bergeron and Pilaud for interval hypergraphs, and the result of Adenbaum et al. for the complete cyclic interval hypergraph.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.