Constant Degree Direct Product Testers with Small Soundness

Mitali Bafna, Noam Lifshitz, Dor Minzer

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

Let X be a d-dimensional simplicial complex. A function F: X(k)→0,1k is said to be a direct product function if there exists a function f: x(1)→0,1 such that F(Σ)=(f(Σ1), ·, f(Σk)) for each k-face Σ, In an effort to simplify components of the PCP theorem, Goldreich and Safra [1] introduced the problem of direct product testing, which asks whether one can test if F: X(k)→0,1k - is correlated with a direct product function by querying f on only 2 inputs. Dinur and Kaufman [2] conjectured that there exist bounded degree complexes with a direct product test in the small soundness regime. We resolve their conjecture by showing that for all Δ > 0, there exists a family of high-dimensional expanders with degree OΔ(1) and a 2-query direct product tester with soundness Δ We use the characterization given by [3] and independently by [4], who showed that some form of non-Abelian coboundary expansion (which they called 'Unique-Games coboundary expansion') is a necessary and sufficient condition for a complex to admit such direct product testers. Our main technical contribution is a general technique for showing coboundary expansion of complexes with coefficients in a non-Abelian group. This allows us to prove that the high dimensional expanders constructed by [5] satisfy the conditions of [3], thus admitting a 2-query direct product tester with small soundness.

Original languageEnglish
Title of host publicationProceedings - 2024 IEEE 65th Annual Symposium on Foundations of Computer Science, FOCS 2024
PublisherIEEE Computer Society
Pages862-869
Number of pages8
ISBN (Electronic)9798331516741
DOIs
StatePublished - 2024
Externally publishedYes
Event65th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2024 - Chicago, United States
Duration: 27 Oct 202430 Oct 2024

Publication series

NameProceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS
ISSN (Print)0272-5428

Conference

Conference65th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2024
Country/TerritoryUnited States
CityChicago
Period27/10/2430/10/24

Bibliographical note

Publisher Copyright:
© 2024 IEEE.

Keywords

  • agreement testing
  • high-dimensional expanders
  • probabilistically checkable proofs

Fingerprint

Dive into the research topics of 'Constant Degree Direct Product Testers with Small Soundness'. Together they form a unique fingerprint.

Cite this