Interval hypergraphic lattices
Nantel Bergeron, Vincent Pilaud
TL;DR
This work provides a complete lattice-theoretic taxonomy for interval hypergraphic posets P_I arising from interval hypergraphs. It proves that P_I is a lattice exactly when I is closed under intersection, and that distributivity and semidistributivity correspond to stronger interval-closure conditions, with explicit characterizations and join-irreducible descriptions. It further analyzes Schröder (laminar) interval hypergraphs, yielding distributive lattices and factorized generating polynomials, and identifies how quotients of the weak order/Tamari lattice arise from subinterval-closure properties. The results connect the geometry of interval hypergraphic polytopes (deformations of the associahedron) to rich combinatorial structures (Tamari, Pitman–Stanley, and Schröder families) and provide concrete tools for understanding the poset and lattice structure via sources, flips, and canonical join representations.
Abstract
For a hypergraph $\mathbb{H}$ on $[n]$, the hypergraphic poset $P_\mathbb{H}$ is the transitive closure of the oriented skeleton of the hypergraphic polytope $\triangle_\mathbb{H}$ (the Minkowski sum of the standard simplices $\triangle_H$ for all $H \in \mathbb{H}$). Hypergraphic posets include the weak order for the permutahedron (when $\mathbb{H}$ is the complete graph on $[n]$) and the Tamari lattice for the associahedron (when $\mathbb{H}$ is the set of all intervals of $[n]$), which motivates the study of lattice properties of hypergraphic posets. In this paper, we focus on interval hypergraphs, where all hyperedges are intervals of $[n]$. We characterize the interval hypergraphs $\mathbb{I}$ for which $P_\mathbb{I}$ is a lattice, a distributive lattice, a semidistributive lattice, and a lattice quotient of the weak order.
