Lattice characterization of cyclic interval hypergraphic posets
F\'elix G\'elinas, Yirong Yang

TL;DR
This paper characterizes when hypergraphic posets derived from cyclic interval hypergraphs form lattices, extending previous results for interval and complete cyclic interval hypergraphs.
Contribution
It provides a complete lattice characterization for cyclic interval hypergraphs, broadening understanding of hypergraphic posets and their lattice properties.
Findings
Characterization of lattice conditions for cyclic interval hypergraphs
Extension of previous results for interval and complete cyclic cases
Connection between hypergraph structure and lattice properties
Abstract
Hypergraphic polytopes arise as Minkowski sums of simplices indexed by the hyperedges of a hypergraph . Orienting the -skeleton of such a polytope by a certain generic linear functional gives rise to the hypergraphic poset . Hypergraphic posets include the weak order for the permutahedron and the Tamari lattice for the associahedron. This motivates the problem of determining when 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.
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.
