On non-optimally expanding sets in Grassmann graphs
type: Item
instance of: scholarly article
title: On non-optimally expanding sets in Grassmann graphs
author: Dor Minzer
author: Irit Dinur
author: Subhash Khot
author: Guy Kindler
author: Shmuel Safra
published in: Israel Journal of Mathematics
publication date: 2021-08-24T00:00:00Z
Mathematics Subject Classification ID: 68Qxx
Mathematics Subject Classification ID: 05Cxx
Mathematics Subject Classification ID: 05Exx
zbMATH DE Number: 7384532
MaRDI profile type: Publication
full work available at URL: s11856-021-2164-7
OpenAlex ID: W3170971055
cites work: Q3992965
cites work: Q5090379
cites work: On non-optimally expanding sets in Grassmann graphs
cites work: Towards a proof of the 2-to-1 games conjecture?
cites work: Friedgut--Kalai--Naor theorem for slices of the Boolean cube
cites work: An orthogonal basis for functions over a slice of the Boolean hypercube
cites work: Invariance principle on the slice
cites work: Harmonicity and invariance on slices of the Boolean cube
cites work: The Erdős-Ko-Rado theorem for vector spaces
cites work: Erdős–Ko–Rado Theorems: Algebraic Approaches
cites work: Some optimal inapproximability results
cites work: Q3002760
cites work: Simple analysis of graph tests for linearity and PCP
cites work: On the power of unique 2-prover 1-round games
cites work: On independent sets, 2-to-2 games, and Grassmann graphs
cites work: Q3191598
cites work: A new point of NP-hardness for unique games
cites work: On Certain Sets of Integers
cites work: A positive combinatorial formula for the complexity of the \(q\)-analog of the \(n\)-cube
cites work: The Goldman-Rota identity and the Grassmann scheme
cites work: A PCP characterization of NP with optimal amortized query complexity
cites work: Q4542548
DOI: 10.1007/S11856-021-2164-7
description: scientific article; zbMATH DE number 7384532