Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
156 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
45 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Binary scalar products (2008.07153v1)

Published 17 Aug 2020 in math.CO and cs.DM

Abstract: Let $A,B \subseteq \mathbb{R}d $ both span $\mathbb{R}d$ such that $\langle a, b \rangle \in {0,1}$ holds for all $a \in A$, $b \in B$. We show that $ |A| \cdot |B| \le (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 \cup 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 $d 2{d+1}$, which we show to be true.

Citations (4)

Summary

We haven't generated a summary for this paper yet.