High Dimensional Expanders Imply Agreement Expanders

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

We show that high dimensional expanders imply derandomized direct product tests, with a number of subsets that is linear in the size of the universe. Direct product tests belong to a family of tests called agreement tests that are important components in PCP constructions and include, for example, low degree tests such as line vs. line and plane vs. plane. For a generic hypergraph, we introduce the notion of agreement expansion, which captures the usefulness of the hypergraph for an agreement test. We show that explicit bounded degree agreement expanders exist, based on Ramanujan complexes.
Original languageEnglish
Title of host publication2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS)
PublisherIEEE Computer Society
Pages974-985
Number of pages12
ISBN (Electronic)9781538634646
ISBN (Print)1538634643
DOIs
StatePublished - 13 Nov 2017
Event58th IEEE Annual Symposium on Foundations of Computer Science (FOCS) - United States, CA, Berkeley, Berkeley, United States
Duration: 15 Oct 201717 Oct 2017

Publication series

NameAnnual IEEE Symposium on Foundations of Computer Science

Conference

Conference58th IEEE Annual Symposium on Foundations of Computer Science (FOCS)
Country/TerritoryUnited States
CityBerkeley
Period15/10/1717/10/17

Keywords

  • agreement tests
  • direct product
  • direct sum
  • high dimensional expanders

All Science Journal Classification (ASJC) codes

  • General Computer Science

Cite this