arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1111.0405cs.CC
收藏

使长代码更短,并应用于唯一游戏猜想

Making the long code shorter, with applications to the Unique Games Conjecture

Boaz Barak, Parikshit Gopalan, Johan Hastad, Raghu Meka, Prasad Raghavendra, David Steurer

摘要:

长码是解决近似困难的重要工具,特别是在与唯一对策猜想有关的问题中。我们构建了一个新的代码,是指数更有效,但仍然可以在许多这些应用程序中使用。使用新的代码,我们获得指数改善了几个已知的结果,包括以下几个:1。对于任何eps > 0,我们证明了存在一个n顶点图G,其中每个o(n)顶点集都有扩张1 - eps,但G的邻接矩阵有超过exp(log^delta n)个大于1 - eps的特征值,其中delta只依赖于eps.这回答了Arora,Barak和Steurer(FOCS 2010)的一个公开问题,他们询问是否可以在具有poly(log n)这样的特征值的布尔超立方体上改进噪声图。2.一个小工具,将具有线性约束模K的独特游戏实例减少到具有字母表k的实例,其爆破为K^polylog(K),比先前已知的爆破为2^K的小工具有所改进。3.唯一游戏的n变量完整性缺口,在SDP + Sherali Adams层次的exp(poly(log log n))轮中幸存,改进了以前已知的poly(log log n)边界。我们在某些相关的Cayley图中展示了线性码的局部可测性和小集合扩张之间的联系,并利用这种联系去随机化布尔超立方体上的噪声图。

英文摘要:

The long code is a central tool in hardness of approximation, especially in questions related to the unique games conjecture. We construct a new code that is exponentially more efficient, but can still be used in many of these applications. Using the new code we obtain exponential improvements over several known results, including the following: 1. For any eps > 0, we show the existence of an n vertex graph G where every set of o(n) vertices has expansion 1 - eps, but G's adjacency matrix has more than exp(log^delta n) eigenvalues larger than 1 - eps, where delta depends only on eps. This answers an open question of Arora, Barak and Steurer (FOCS 2010) who asked whether one can improve over the noise graph on the Boolean hypercube that has poly(log n) such eigenvalues. 2. A gadget that reduces unique games instances with linear constraints modulo K into instances with alphabet k with a blowup of K^polylog(K), improving over the previously known gadget with blowup of 2^K. 3. An n variable integrality gap for Unique Games that that survives exp(poly(log log n)) rounds of the SDP + Sherali Adams hierarchy, improving on the previously known bound of poly(log log n). We show a connection between the local testability of linear codes and small set expansion in certain related Cayley graphs, and use this connection to derandomize the noise graph on the Boolean hypercube.

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

↑