English

Binary scalar products

Combinatorics 2020-08-18 v1 Discrete Mathematics

Abstract

Let A,BRdA,B \subseteq \mathbb{R}^d both span Rd\mathbb{R}^d such that a,b{0,1}\langle a, b \rangle \in \{0,1\} holds for all aAa \in A, bBb \in B. We show that AB(d+1)2d |A| \cdot |B| \le (d+1) 2^d . 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 HH there is a parallel hyperplane HH' such that HHH \cup H' contain all vertices. The authors conjectured that for every dd-dimensional 2-level polytope PP the product of the number of vertices of PP and the number of facets of PP is at most d2d+1d 2^{d+1}, which we show to be true.

Keywords

Cite

@article{arxiv.2008.07153,
  title  = {Binary scalar products},
  author = {Andrey Kupavskii and Stefan Weltge},
  journal= {arXiv preprint arXiv:2008.07153},
  year   = {2020}
}

Comments

10 pages

R2 v1 2026-06-23T17:53:58.179Z