Geometry of ample/lopsided sets
Hans--J\"urgen Bandelt, Victor Chepoi, Andreas Dress, Jack Koolen

TL;DR
This paper explores the geometric structure of ample (lopsided) sets, characterizing them as isometric subspaces of -spaces and relating them to cube complexes and convex sets.
Contribution
It provides new geometric characterizations of ample sets, including their realization as weakly convex sets and their representation via cube complexes.
Findings
Ample sets are exactly the isometric subspaces of -spaces.
Barycenter maps of ample set faces relate to -sign vectors.
Any ample set can be realized as an intersection pattern with orthants.
Abstract
Lopsided sets were introduced by Jim Lawrence in 1983 when he studied the subsets of that encode the intersection pattern of a convex set with the orthants of . Lopsided sets have been independently rediscovered by several other authors, in particular by Andreas Dress in 1995, who called them \emph{ample} sets. Dress defined ample sets as the set families satisfying equality in a combinatorial inequality, which holds for all set families. In a previous article we characterized ample sets in various combinatorial and graph-theoretical ways. In this paper we study geometric realizations of ample sets as cubihedra (cube complexes), which yields several new characterizations. One such characterization establishes that the cubihedra of ample sets endowed with the intrinsic -metric are exactly the isometric subspaces of -spaces (which we…
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.
