High dimensional expanders imply agreement expanders

DOI10.1109/FOCS.2017.94MaRDI QIDQ6946292zbMATH OpenFDO

Authors Irit Dinur, Tali Kaufman

Publication date 6 August 2025

Full work available at URL https://doi.org/10.1109/FOCS.2017.94

Mathematics Subject Classification ID

Theory of computing (68Qxx) Discrete mathematics in relation to computer science (68Rxx) Algorithms in computer science (68Wxx)

Cited in

(16)

• Baby PIH: Parameterized inapproximability of min CSP
• Solving unique games over globally hypercontractive graphs
• Expanderizing higher-order random walks
• Sparse cuts in hypergraphs from random walks on simplicial complexes
• Sparse high dimensional expanders via local lifts
• Coboundary and cosystolic expansion without dependence on dimension or degree
• Expanderizing higher-order random walks
• Localization schemes: a framework for proving mixing bounds for Markov chains
• Agreement tests on graphs and hypergraphs
• Fast sampling via spectral independence beyond bounded-degree graphs
• Explicit SoS lower bounds from high-dimensional expanders
• Relaxed locally correctable codes with improved parameters
• Coboundary and cosystolic expansion from strong symmetry
• Garland's technique for posets and high-dimensional Grassmannian expanders
• Algebra is half the battle: verifying presentations of graded unipotent Chevalley groups
• Optimal mixing of Glauber dynamics: entropy factorization via high-dimensional expansion

This page was built for publication: High dimensional expanders imply agreement expanders

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6946292)