Flatness and Tightness in Hypertopes
Abstract
A hypertope is a thin, residually connected incidence geometry.
For each pair of types $\{i,j\}$, the residues of that type must be polygons, and if all residues of that type are the same type of polygon, then we can record this information in a diagram $D$.
Given such a diagram, we prove a lower bound on the number of chambers of a hypertope with that diagram.
A hypertope that achieves this bound is called \emph{tight}.
We prove that a hypertope is tight if and only if its diagram $D$ is a forest and, for every pair of types $\{i,j\}$ that is not an edge of $D$, every $i$-element is incident to every $j$-element.
This generalizes a previously known result about abstract polytopes.
Finally, we describe a combinatorial method and an algebraic method for constructing tight hypertopes.