Pseudorandom Sets in Grassmann Graph Have Near-Perfect Expansion

We prove that pseudorandom sets in the Grassmann graph have near-perfect expansion. This completes the last missing piece of the proof of the 2-to-2-Games Conjecture (albeit with imperfect completeness). The Grassmann graph has induced subgraphs that are themselves isomorphic to Grassmann graphs of lower orders. A set of vertices is called pseudorandom if its density within all such subgraphs (of constant order) is at most slightly higher than its density in the entire graph. We prove that pseudorandom sets have almost no edges within them. Namely, their edge-expansion is very close to 1.

[1]  Yuan Zhou,et al.  Hypercontractivity, sum-of-squares proofs, and their applications , 2012, STOC '12.

[2]  Subhash Khot.  On the Unique Games Conjecture (Invited Survey) , 2010, Computational Complexity Conference.

[3]  Subhash Khot,et al.  A Two Prover One Round Game with Strong Soundness , 2011, FOCS.

[4]  Luca Trevisan,et al.  Inapproximability of Combinatorial Optimization Problems , 2004, Electron. Colloquium Comput. Complex..

[5]  Ehud Friedgut,et al.  Boolean Functions With Low Average Sensitivity Depend On Few Coordinates , 1998, Comb..

[6]  L. Russo.  An approximate zero-one law , 1982 .

[7]  Yuval Rabani,et al.  On the Hardness of Approximating Multicut and Sparsest-Cut , 2005, Computational Complexity Conference.

[8]  Subhash Khot,et al.  On the power of unique 2-prover 1-round games , 2002, Proceedings 17th IEEE Annual Conference on Computational Complexity.

[9]  Johan Håstad.  On the efficient approximability of constraint satisfaction problems , 2007 .

[10]  Prasad Raghavendra,et al.  Optimal algorithms and inapproximability results for every CSP? , 2008, STOC.

[11]  Dima Grigoriev,et al.  Linear lower bound on degrees of Positivstellensatz calculus proofs for the parity , 2001, Theor. Comput. Sci..

[12]  Subhash Khot,et al.  NP-hardness of approximately solving linear equations over reals , 2011, STOC '11.

[13]  Grant Schoenebeck,et al.  Linear Level Lasserre Lower Bounds for Certain k-CSPs , 2008, 2008 49th Annual IEEE Symposium on Foundations of Computer Science.

[14]  Nisheeth K. Vishnoi,et al.  The unique games conjecture, integrality gap for cut problems and embeddability of negative type metrics into l/sub 1/ , 2005, 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05).

[15]  László Lovász,et al.  Two-prover one-round proof systems: their power and their problems (extended abstract) , 1992, STOC '92.

[16]  Subhash Khot,et al.  Hardness of Approximation , 2016, ICALP.

[17]  Jonas Holmerin,et al.  Clique Is Hard to Approximate within n1-o(1) , 2000, ICALP.

[18]  Alexandra Kolla,et al.  How to Play Unique Games Against a Semi-random Adversary: Study of Semi-random Models of Unique Games , 2011, 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science.

[19]  Elchanan Mossel,et al.  Conditional Hardness for Approximate Coloring , 2009, SIAM J. Comput..

[20]  Guy Kindler,et al.  On non-optimally expanding sets in Grassmann graphs , 2017, Electron. Colloquium Comput. Complex..

[21]  Ran Raz,et al.  A parallel repetition theorem , 1995, STOC '95.

[22]  Prasad Raghavendra,et al.  Rounding Semidefinite Programming Hierarchies via Global Correlation , 2011, 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science.

[23]  L. Trevisan.  On Khot’s unique games conjecture , 2012 .

[24]  Thomas Holenstein,et al.  Parallel repetition: simplifications and the no-signaling case , 2007, STOC '07.

[25]  Sanjeev Arora,et al.  Subexponential Algorithms for Unique Games and Related Problems , 2010, 2010 IEEE 51st Annual Symposium on Foundations of Computer Science.

[26]  Venkatesan Guruswami,et al.  Improved Inapproximability Results for Maximum k-Colorable Subgraph , 2009, APPROX-RANDOM.

[27]  Subhash Khot,et al.  SDP gaps and UGC-hardness for MAXCUTGAIN , 2006, IEEE Annual Symposium on Foundations of Computer Science.

[28]  Nisheeth K. Vishnoi,et al.  The Unique Games Conjecture, Integrality Gap for Cut Problems and Embeddability of Negative Type Metrics into l1 , 2005, FOCS.

[29]  Subhash Khot,et al.  Candidate hard unique game , 2016, STOC.

[30]  Prasad Raghavendra,et al.  Graph expansion and the unique games conjecture , 2010, STOC '10.

[31]  Subhash Khot,et al.  Vertex cover might be hard to approximate to within 2-/spl epsiv/ , 2003, 18th IEEE Annual Conference on Computational Complexity, 2003. Proceedings..

[32]  S. Safra,et al.  On the hardness of approximating minimum vertex cover , 2005 .

[33]  Nisheeth K. Vishnoi,et al.  Unique games on expanding constraint graphs are easy: extended abstract , 2008, STOC.

[34]  László Lovász,et al.  Interactive proofs and the hardness of approximating cliques , 1996, JACM.

[35]  Prasad Raghavendra,et al.  Beating the Random Ordering is Hard: Inapproximability of Maximum Acyclic Subgraph , 2008, 2008 49th Annual IEEE Symposium on Foundations of Computer Science.

[36]  Prasad Raghavendra,et al.  Making the Long Code Shorter , 2012, 2012 IEEE 53rd Annual Symposium on Foundations of Computer Science.

[37]  Ryan O'Donnell,et al.  Optimal Inapproximability Results for MAX-CUT and Other 2-Variable CSPs? , 2007, SIAM J. Comput..

[38]  Subhash Khot,et al.  On independent sets, 2-to-2 games, and Grassmann graphs , 2017, Electron. Colloquium Comput. Complex..

[39]  Mihir Bellare,et al.  Free bits, PCPs and non-approximability-towards tight results , 1995, Proceedings of IEEE 36th Annual Foundations of Computer Science.

[40]  Johan Håstad,et al.  Some optimal inapproximability results , 2001, JACM.

[41]  Sanjeev Arora,et al.  Probabilistic checking of proofs; a new characterization of NP , 1992, Proceedings., 33rd Annual Symposium on Foundations of Computer Science.

[42]  Subhash Khot.  Inapproximability of NP-complete Problems, Discrete Fourier Analysis, and Geometry , 2011 .

[43]  Guy Kindler,et al.  Towards a proof of the 2-to-1 games conjecture? , 2018, Electron. Colloquium Comput. Complex..

[44]  Venkatesan Guruswami,et al.  Improved Inapproximability Results for Maximum k-Colorable Subgraph , 2013, Theory Comput..

[45]  Anup Rao,et al.  Parallel repetition in projection games and a concentration bound , 2008, SIAM J. Comput..

[46]  Carsten Lund,et al.  Proof verification and the hardness of approximation problems , 1998, JACM.