arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2105.07517cs.CC
收藏

染色的无应力平方和下界

A Stress-Free Sum-of-Squares Lower Bound for Coloring

Pravesh K. Kothari, Peter Manohar

摘要:

我们证明了,以高概率的选择一个随机图$G$从Erdens-Rényi分布$G(n,1/2)$,一个自然的$n^{O(\varepsilon^2 \log n)}$ -时间,度$O(\varepsilon^2 \log n)$平方和半定规划不能反驳存在一个有效的$k$ -着色的$G$为$k = n^{1/2 +\varepsilon}$。我们的结果意味着基本半定程序(Lovász θ函数的一个紧密变体)的反驳保证不能通过自然的$o(\log n)$度平方和加强而得到明显的改善,并且这紧到$k$中的$n^{o(1)}$松弛。据我们所知,这是着色$G(n,1/2)$的第一个下界,即使是在任何SDP层次结构中的基本SDP的单轮加强。我们的证明依赖于一个新的变体的实例保持非逐点完全约简内的SoS从着色图找到大的独立集。(也许令人惊讶的是)短,简单,不需要复杂的谱范数界的随机矩阵的依赖项目,否则必须在许多类似的结果[BHK+16,HKP+17,KB 19,GJJ+20,MRX20]。我们的结果正式持有的顶点被允许属于多个颜色类的约束系统,我们离开的扩展到正式更强的着色,顶点必须属于唯一的颜色类,作为一个突出的开放问题制定。

英文摘要:

We prove that with high probability over the choice of a random graph $G$ from the Erdős-Rényi distribution $G(n,1/2)$, a natural $n^{O(\varepsilon^2 \log n)}$-time, degree $O(\varepsilon^2 \log n)$ sum-of-squares semidefinite program cannot refute the existence of a valid $k$-coloring of $G$ for $k = n^{1/2 +\varepsilon}$. Our result implies that the refutation guarantee of the basic semidefinite program (a close variant of the Lovász theta function) cannot be appreciably improved by a natural $o(\log n)$-degree sum-of-squares strengthening, and this is tight up to a $n^{o(1)}$ slack in $k$. To the best of our knowledge, this is the first lower bound for coloring $G(n,1/2)$ for even a single round strengthening of the basic SDP in any SDP hierarchy. Our proof relies on a new variant of instance-preserving non-pointwise complete reduction within SoS from coloring a graph to finding large independent sets in it. Our proof is (perhaps surprisingly) short, simple and does not require complicated spectral norm bounds on random matrices with dependent entries that have been otherwise necessary in the proofs of many similar results [BHK+16, HKP+17, KB19, GJJ+20, MRX20]. Our result formally holds for a constraint system where vertices are allowed to belong to multiple color classes; we leave the extension to the formally stronger formulation of coloring, where vertices must belong to unique colors classes, as an outstanding open problem.

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

↑