Two-Level Polytopes with a Prescribed Facet

  • Samuel Fiorini
  • Vissarion Fisikopoulos
  • Marco Macchia
Conference paper

DOI: 10.1007/978-3-319-45587-7_25

Part of the Lecture Notes in Computer Science book series (LNCS, volume 9849)
Cite this paper as:
Fiorini S., Fisikopoulos V., Macchia M. (2016) Two-Level Polytopes with a Prescribed Facet. In: Cerulli R., Fujishige S., Mahjoub A. (eds) Combinatorial Optimization. ISCO 2016. Lecture Notes in Computer Science, vol 9849. Springer, Cham

Abstract

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.

Copyright information

© Springer International Publishing Switzerland 2016

Authors and Affiliations

  • Samuel Fiorini
    • 1
  • Vissarion Fisikopoulos
    • 1
  • Marco Macchia
    • 1
  1. 1.Département de MathématiqueUniversité libre de BruxellesBrusselsBelgium

Personalised recommendations