On non-optimally expanding sets in Grassmann graphs
From MaRDI portal
Publication:2048867
DOI10.1007/S11856-021-2164-7OpenAlexW3170971055MaRDI QIDQ2048867FDOQ2048867
Authors: Dor Minzer, Irit Dinur, Subhash Khot, Guy Kindler, Shmuel Safra 
Publication date: 24 August 2021
Published in: Israel Journal of Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11856-021-2164-7
Recommendations
Cites Work
- Title not available (Why is that?)
- Some optimal inapproximability results
- Erdős-Ko-Rado theorems. Algebraic approaches
- On the power of unique 2-prover 1-round games
- On Certain Sets of Integers
- A PCP characterization of NP with optimal amortized query complexity
- Title not available (Why is that?)
- Simple analysis of graph tests for linearity and PCP
- Friedgut-Kalai-Naor theorem for slices of the Boolean cube
- An orthogonal basis for functions over a slice of the Boolean hypercube
- Invariance principle on the slice
- The Erdős-Ko-Rado theorem for vector spaces
- The Goldman-Rota identity and the Grassmann scheme
- A positive combinatorial formula for the complexity of the \(q\)-analog of the \(n\)-cube
- Query efficient PCPs with perfect completeness
- On independent sets, 2-to-2 games, and Grassmann graphs
- Harmonicity and invariance on slices of the Boolean cube
- A two-prover one-round game with strong soundness
- Towards a proof of the 2-to-1 games conjecture?
- On non-optimally expanding sets in Grassmann graphs
- Small-set expansion in shortcode graph and the 2-to-2 conjecture
- A new point of NP-hardness for unique games
Cited In (3)
This page was built for publication: On non-optimally expanding sets in Grassmann graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2048867)
