Interval hypergraphic lattices
Nantel Bergeron, Vincent Pilaud

TL;DR
This paper investigates the lattice properties of hypergraphic posets derived from interval hypergraphs, characterizing when these posets form various types of lattices, including distributive and semidistributive ones.
Contribution
It provides a characterization of interval hypergraphs whose associated hypergraphic posets form specific lattice structures, advancing understanding of their combinatorial properties.
Findings
Identifies conditions under which $P_\mathbb{I}$ is a lattice.
Determines when $P_\mathbb{I}$ is distributive or semidistributive.
Classifies $P_\mathbb{I}$ as a lattice quotient of the weak order.
Abstract
For a hypergraph on , the hypergraphic poset is the transitive closure of the oriented skeleton of the hypergraphic polytope (the Minkowski sum of the standard simplices for all ). Hypergraphic posets include the weak order for the permutahedron (when is the complete graph on ) and the Tamari lattice for the associahedron (when is the set of all intervals of ), which motivates the study of lattice properties of hypergraphic posets. In this paper, we focus on interval hypergraphs, where all hyperedges are intervals of . We characterize the interval hypergraphs for which is a lattice, a distributive lattice, a semidistributive lattice, and a lattice quotient of the weak order.
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
TopicsRough Sets and Fuzzy Logic
