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.
- 6.Gawrilow, E., Joswig, M.: Polymake: an approach to modular software design in computational geometry. In: International Symposium on Computational Geometry (SOCG), pp. 222–231. ACM Press (2001)Google Scholar
- 8.Gouveia, J., Pashkovich, K., Robinson, R.Z., Thomas, R.R.: Four dimensional polytopes of minimum positive semidefinite rank (2015)Google Scholar
- 10.Grande, F.: On \(k\)-level matroids: geometry and combinatorics. Ph.D. thesis, Free University of Berlin (2015)Google Scholar
- 12.Grande, F., Sanyal, R.: Theta rank, levelness, matroid minors. arXiv preprint (2014). arXiv:1408.1262
- 17.Lovász, L.: Semidefinite programs and combinatorial optimization. In: Reed, B.A., Sales, C.L. (eds.) Recent Advances in Algorithms and Combinatorics. CMS Books in Mathematics, pp. 137–194. Springer, Heidelberg (2003)Google Scholar
- 18.Lovász, L., Saks, M.: Lattices, mobius functions and communications complexity. In: Proceedings of the 29th Annual Symposium on Foundations of Computer Science, SFCS 1988, pp. 81–90. IEEE Computer Society, Washington (1988)Google Scholar