# Pseudorandom Sets in Grassmann Graph Have Near-Perfect Expansion

@article{Khot2018PseudorandomSI,
title={Pseudorandom Sets in Grassmann Graph Have Near-Perfect Expansion},
author={Subhash Khot and Dor Minzer and Shmuel Safra},
journal={2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS)},
year={2018},
pages={592-601}
}
• Published 1 October 2018
• Mathematics
• 2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS)
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…
On non-optimally expanding sets in Grassmann graphs
• Mathematics
Israel Journal of Mathematics
• 2021
We study the structure of non-expanding sets in the Grassmann graph. We put forth a hypothesis stating that every small set whose expansion is smaller than 1– δ must be correlated with one of a
Small Set Expansion in The Johnson Graph
• Mathematics, Computer Science
Electron. Colloquium Comput. Complex.
• 2018
It is proved that any small set of vertices in the graph either has near perfect edge expansion or is not pseudorandom, which shows that slices of the noisy hypercube only have non-expanding small sets of a certain simple structure.
Tight Approximation Ratio for Minimum Maximal Matching
• Mathematics, Computer Science
IPCO
• 2019
With a stronger variant of the Unique Games Conjecture --- that is Small Set Expansion Hypothesis --- the authors are able to improve the hardness result up to the factor of $\frac{3}{2}$.
Expansion in the Johnson Graph
• Mathematics
• 2019
The (generalized) Johnson graph is given by slices of the hypercube, and is important for understanding probabilistically checkable proof systems and hardness of approximation. Characterizing the
Results in Extremal Graph Theory, Ramsey Theory and Additive Combinatorics
This dissertation contains results from various areas of Combinatorics. In Chapter 2, we consider a central problem in Extremal Graph Theory. The extremal number (or Turán number) ex(n,H) of a graph
High Dimensional Expanders: Random Walks, Pseudorandomness, and Unique Games
• Mathematics
Electron. Colloquium Comput. Complex.
• 2020
This work studies the spectral structure of walks on the stronger two-sided variant, which capture wide generalizations of important objects like the Johnson and Grassmann graphs, and provides the first polynomial time algorithm for affine unique games over the Johnson scheme.
Eigenstripping, Spectral Decay, and Edge-Expansion on Posets
• Mathematics, Computer Science
ArXiv
• 2022
This work quantifies the advantage of diﬀerent poset architectures in both a spectral and combinatorial sense, highlighting how regularity controls the spectral decay and edge-expansion of corresponding random walks.
Small-Set Expansion in Shortcode Graph and the 2-to-2 Conjecture
• Mathematics
Electron. Colloquium Comput. Complex.
• 2018
Dinur, Khot, Kindler, Minzer and Safra (2016) recently showed that the (imperfect completeness variant of) Khot's 2 to 2 games conjecture follows from a combinatorial hypothesis about the soundness
On the proof of the 2-to-2 Games Conjecture
• Subhash Khot
• Mathematics
Current Developments in Mathematics
• 2019
This article gives an overview of the recent proof of the 2-to-2 Games Conjecture in [68, 39, 38, 69] (with additional contributions from [75, 18, 67]). The proof requires an understanding of
The Quest for Strong Inapproximability Results with Perfect Completeness
• Mathematics, Computer Science
ACM Trans. Algorithms
• 2021
It is proved that an “almost Unique” version of Label Cover can be approximated within a constant factor on satisfiable instances of CSPs, and this work is motivated by the pursuit of a better understanding of the approximability of perfectly satisfiable instance of C SPs.

## References

SHOWING 1-10 OF 55 REFERENCES
On non-optimally expanding sets in Grassmann graphs
• Mathematics
Electron. Colloquium Comput. Complex.
• 2017
The Expansion Hypothesis has been subsequently proved in its full form thereby proving the agreement hypothesis of [Dinur, Khot, Kindler, Minzer and Safra, STOC 2018] and completing the proof of the 2-to-1 Games Conjecture (albeit with imperfect completeness).
On independent sets, 2-to-2 games, and Grassmann graphs
• Mathematics
Electron. Colloquium Comput. Complex.
• 2016
We present a candidate reduction from the 3-Lin problem to the 2-to-2 Games problem and present a combinatorial hypothesis about Grassmann graphs which, if correct, is sufficient to show the
Graph expansion and the unique games conjecture
• Mathematics
STOC '10
• 2010
This work investigates the connection between Graph Expansion and the Unique Games Conjecture and shows that under a slightly stronger UGC that assumes mild expansion of small sets, it is UG-hard to approximate small set expansion.
Vertex cover might be hard to approximate to within 2-epsilon
• Computer Science, Mathematics
J. Comput. Syst. Sci.
• 2008
Beating the Random Ordering is Hard: Inapproximability of Maximum Acyclic Subgraph
• Mathematics
2008 49th Annual IEEE Symposium on Foundations of Computer Science
• 2008
We prove that approximating the max. acyclic subgraph problem within a factor better than 1/2 is unique games hard. Specifically, for every constant epsiv > 0 the following holds: given a directed
Hypercontractivity, sum-of-squares proofs, and their applications
• Mathematics, Computer Science
STOC '12
• 2012
Reductions between computing the 2->4 norm and computing the injective tensor norm of a tensor, a problem with connections to quantum information theory and the study of Khot's Unique Games Conjecture are shown.
Interactive proofs and the hardness of approximating cliques
• Computer Science, Mathematics
JACM
• 1996
The connection between cliques and efficient multi-prover interaction proofs, is shown to yield hardness results on the complexity of approximating the size of the largest clique in a graph.
Improved Inapproximability Results for Maximum k-Colorable Subgraph
• Mathematics
APPROX-RANDOM
• 2009
It is proved that given a graph promised to be k -colorable, it is NP-hard to find a k -coloring that properly colors more than a fraction of edges.
Making the Long Code Shorter
• Computer Science, Mathematics
2012 IEEE 53rd Annual Symposium on Foundations of Computer Science
• 2012
A new code is constructed that is exponentially more efficient, but can still be used in many of these applications, and a connection between the local testability of linear codes and small set expansion in certain related Cayley graphs is shown.
On Khot’s unique games conjecture
In 2002, Subhash Khot formulated the Unique Games Conjecture, a conjecture about the computational complexity of certain optimization problems. The conjecture has inspired a remarkable body of work,