Low Acceptance Agreement Tests via Bounded-Degree Symplectic HDXs
Fuente:
arXiv
Enregistré dans:
| Auteurs principaux: | , , |
|---|---|
| Format: | Preprint |
| Publié: |
2024
|
| Sujets: | |
| Accès en ligne: | |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866909167574319104 |
|---|---|
| author | Dikstein, Yotam Dinur, Irit Lubotzky, Alexander |
| author_facet | Dikstein, Yotam Dinur, Irit Lubotzky, Alexander |
| contents | We solve the derandomized direct product testing question in the low acceptance regime, by constructing new high dimensional expanders that have no small connected covers. We show that our complexes have swap cocycle expansion, which allows us to deduce the agreement theorem by relying on previous work.
Derandomized direct product testing, also known as agreement testing, is the following problem. Let X be a family of k-element subsets of [n] and let $\{f_s:s\toΣ\}_{s\in X}$ be an ensemble of local functions, each defined over a subset $s\subset [n]$. Suppose that we run the following so-called agreement test: choose a random pair of sets $s_1,s_2\in X$ that intersect on $\sqrt k$ elements, and accept if $f_{s_1},f_{s_2}$ agree on the elements in $s_1\cap s_2$. We denote the success probability of this test by $Agr(\{f_s\})$. Given that $Agr(\{f_s\})=ε>0$, is there a global function $G:[n]\toΣ$ such that $f_s = G|_s$ for a non-negligible fraction of $s\in X$ ?
We construct a family X of k-subsets of $[n]$ such that $|X| = O(n)$ and such that it satisfies the low acceptance agreement theorem. Namely,
$Agr (\{f_s\}) > ε\; \; \longrightarrow$ there is a function $G:[n]\toΣ$ such that $\Pr_s[f_s\overset{0.99}{\approx} G|_s]\geq poly(ε)$.
A key idea is to replace the well-studied LSV complexes by symplectic high dimensional expanders (HDXs). The family X is just the k-faces of the new symplectic HDXs. The later serve our needs better since their fundamental group satisfies the congruence subgroup property, which implies that they lack small covers. We also give a polynomial-time algorithm to construct this family of symplectic HDXs. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2402_01078 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Low Acceptance Agreement Tests via Bounded-Degree Symplectic HDXs Dikstein, Yotam Dinur, Irit Lubotzky, Alexander Computational Complexity Combinatorics Group Theory We solve the derandomized direct product testing question in the low acceptance regime, by constructing new high dimensional expanders that have no small connected covers. We show that our complexes have swap cocycle expansion, which allows us to deduce the agreement theorem by relying on previous work. Derandomized direct product testing, also known as agreement testing, is the following problem. Let X be a family of k-element subsets of [n] and let $\{f_s:s\toΣ\}_{s\in X}$ be an ensemble of local functions, each defined over a subset $s\subset [n]$. Suppose that we run the following so-called agreement test: choose a random pair of sets $s_1,s_2\in X$ that intersect on $\sqrt k$ elements, and accept if $f_{s_1},f_{s_2}$ agree on the elements in $s_1\cap s_2$. We denote the success probability of this test by $Agr(\{f_s\})$. Given that $Agr(\{f_s\})=ε>0$, is there a global function $G:[n]\toΣ$ such that $f_s = G|_s$ for a non-negligible fraction of $s\in X$ ? We construct a family X of k-subsets of $[n]$ such that $|X| = O(n)$ and such that it satisfies the low acceptance agreement theorem. Namely, $Agr (\{f_s\}) > ε\; \; \longrightarrow$ there is a function $G:[n]\toΣ$ such that $\Pr_s[f_s\overset{0.99}{\approx} G|_s]\geq poly(ε)$. A key idea is to replace the well-studied LSV complexes by symplectic high dimensional expanders (HDXs). The family X is just the k-faces of the new symplectic HDXs. The later serve our needs better since their fundamental group satisfies the congruence subgroup property, which implies that they lack small covers. We also give a polynomial-time algorithm to construct this family of symplectic HDXs. |
| title | Low Acceptance Agreement Tests via Bounded-Degree Symplectic HDXs |
| topic | Computational Complexity Combinatorics Group Theory |
| url | https://arxiv.org/abs/2402.01078 |