Two-Level Polytopes with a Prescribed Facet

A (convex) polytope is said to be 2-level if for every facet-defining direction of hyperplanes, its vertices can be covered with two hyperplanes of that direction. These polytopes are motivated by questions, e.g., in combinatorial optimization and communication complexity. We study 2-level polytopes with one prescribed facet. Based on new general findings about the structure of 2-level polytopes, we give a complete characterization of the 2-level polytopes with some facet isomorphic to a sequentially Hanner polytope, and improve the enumeration algorithm of Bohn et al. (ESA 2015). We obtain, for the first time, the complete list of d-dimensional 2-level polytopes up to affine equivalence for dimension \(d = 7\). As it turns out, geometric constructions that we call suspensions play a prominent role in both our theoretical and experimental results. This yields exciting new research questions on 2-level polytopes, which we state in the paper.

[1]  Michael E. Saks,et al.  Lattices, mobius functions and communications complexity , 1988, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.

[2]  Rekha R. Thomas,et al.  Polytopes of Minimum Positive Semidefinite Rank , 2012, Discret. Comput. Geom..

[3]  K. Mahler,et al.  Ein Übertragungsprinzip für konvexe Körper , 1939 .

[4]  Richard P. Stanley,et al.  Two poset polytopes , 1986, Discret. Comput. Geom..

[5]  Rekha R. Thomas,et al.  Theta Bodies for Polynomial Ideals , 2008, SIAM J. Optim..

[6]  V. Chvátal On certain polytopes associated with graphs , 1975 .

[7]  Oswin Aichholzer,et al.  Extremal Properties of 0/1-Polytopes of Dimension 5 , 2000 .

[8]  Francesco Grande,et al.  On k-level matroids: geometry and combinatorics , 2015 .

[9]  Samuel Fiorini,et al.  Enumeration of 2-level polytopes , 2017, ESA.

[10]  Sonoko Moriyama,et al.  Complete Enumeration of Small Realizable Oriented Matroids , 2012, CCCG.

[11]  Francesco Grande,et al.  Theta rank, levelness, and matroid minors , 2014, J. Comb. Theory, Ser. B.

[12]  László Lovász,et al.  Semidefinite Programs and Combinatorial Optimization , 2003 .

[13]  A. B. Hansen On a certain class of polytopes associated with independence systems. , 1977 .

[14]  Rekha R. Thomas,et al.  Four-dimensional polytopes of minimum positive semidefinite rank , 2017, J. Comb. Theory, Ser. A.

[15]  David K. Smith Theory of Linear and Integer Programming , 1987 .

[16]  O. Hanner,et al.  Intersections of translates of convex bodies , 1956 .

[17]  L. Lovász,et al.  Geometric Algorithms and Combinatorial Optimization , 1981 .

[18]  Gil Kalai,et al.  The number of faces of centrally-symmetric polytopes , 1989, Graphs Comb..

[19]  B. Ganter,et al.  Finding all closed sets: A general approach , 1991 .

[20]  Francesco Grande,et al.  Many 2-Level Polytopes from Matroids , 2014, Discret. Comput. Geom..

[21]  Michael Joswig,et al.  Polymake: an approach to modular software design in computational geometry , 2001, SCG '01.