TY - JOUR
T1 - Binary scalar products
AU - Kupavskii, Andrey
AU - Weltge, Stefan
N1 - Publisher Copyright:
© 2022 Elsevier Inc.
PY - 2022/9
Y1 - 2022/9
N2 - 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.
AB - 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.
KW - 2-Level
KW - Combinatorics
KW - Facets
KW - Polytopes
KW - Vertices
UR - http://www.scopus.com/inward/record.url?scp=85128526806&partnerID=8YFLogxK
U2 - 10.1016/j.jctb.2022.04.001
DO - 10.1016/j.jctb.2022.04.001
M3 - Article
AN - SCOPUS:85128526806
SN - 0095-8956
VL - 156
SP - 18
EP - 30
JO - Journal of Combinatorial Theory, Series B
JF - Journal of Combinatorial Theory, Series B
ER -