多边形的扩展公式
Extended formulations for polygons
摘要:
多面体$P$的扩张复杂度是最小整数$k$,使得$P$是多面体$Q$与$k$刻面的投影。研究了平面上$n$ -图的扩张复杂性.首先,我们给出了一个新的证明,证明了正则$n$ -ε的扩张复杂性是$O(\log n)$,这是Ben-Tal和Nemirovski(2001)的工作的结果。我们的证明很容易推广到其他置换面体,并简化了Goemans(2009)和Kaibel and Pashkovich(2011)最近结果的证明。其次,我们证明了$\sqrt{2n}$关于一般$n$ -扩展复杂度的一个下界。最后,证明了存在$n$ -图,其顶点位于具有扩张复杂度$Ω(\sqrt{n}/\sqrt{\log n})$的$O(n) \times O(n^2)$整数网格上.
英文摘要:
The extension complexity of a polytope $P$ is the smallest integer $k$ such that $P$ is the projection of a polytope $Q$ with $k$ facets. We study the extension complexity of $n$-gons in the plane. First, we give a new proof that the extension complexity of regular $n$-gons is $O(\log n)$, a result originating from work by Ben-Tal and Nemirovski (2001). Our proof easily generalizes to other permutahedra and simplifies proofs of recent results by Goemans (2009), and Kaibel and Pashkovich (2011). Second, we prove a lower bound of $\sqrt{2n}$ on the extension complexity of generic $n$-gons. Finally, we prove that there exist $n$-gons whose vertices lie on a $O(n) \times O(n^2)$ integer grid with extension complexity $Ω(\sqrt{n}/\sqrt{\log n})$.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。