Binary scalar products

Andrey Kupavskii, Stefan Weltge

Research output: Contribution to journalArticlepeer-review

1 Scopus citations

Abstract

Let A,B⊆Rd both span Rd such that 〈a,b〉∈{0,1} holds for all a∈A, b∈B. We show that |A|⋅|B|≤(d+1)2d. This allows us to settle a conjecture by Bohn, Faenza, Fiorini, Fisikopoulos, Macchia, and Pashkovich (2015) concerning 2-level polytopes. Such polytopes have the property that for every facet-defining hyperplane H there is a parallel hyperplane H such that H∪H contain all vertices. The authors conjectured that for every d-dimensional 2-level polytope P the product of the number of vertices of P and the number of facets of P is at most d2d+1, which we show to be true.

Original languageEnglish
Pages (from-to)18-30
Number of pages13
JournalJournal of Combinatorial Theory, Series B
Volume156
DOIs
StatePublished - Sep 2022

Keywords

  • 2-Level
  • Combinatorics
  • Facets
  • Polytopes
  • Vertices

Fingerprint

Dive into the research topics of 'Binary scalar products'. Together they form a unique fingerprint.

Cite this