arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2008.07153math.COcs.DM
收藏

二进制标量积

Binary scalar products

Andrey Kupavskii, Stefan Weltge

摘要:

令$A,B \subseteq \mathbb{R}^d $都跨越$\mathbb{R}^d$,使得$\langle a, b \rangle \in \{0,1\}$对所有$a \in A$、$b \in B$成立。我们表明,$ |A| \cdot |B| \le (d+1) 2^d $。这使我们能够解决Bohn,Faenza,Fiorini,Fisikopoulos,Macchia和Pashkovich(2015)关于2层多面体的猜想。这样的多面体具有这样的性质,即对于每个小面定义超平面$H$,存在平行超平面$H'$,使得$H \cup H'$包含所有顶点。证明了对每一个$d$维2-层次多面体$P$,$P$的顶点数与$P$的刻面数的乘积至多为$d 2^{d+1}$,并证明了这一点.

英文摘要:

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) 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 $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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑