List Agreement Expansion from Coboundary Expansion

10/27/2022
by   Roy Gotlib, et al.
0

One of the key components in PCP constructions are agreement tests. In agreement test the tester is given access to subsets of fixed size of some set, each equipped with an assignment. The tester is then tasked with testing whether these local assignments agree with some global assignment over the entire set. One natural generalization of this concept is the case where, instead of a single assignment to each local view, the tester is given access to l different assignments for every subset. The tester is then tasked with testing whether there exist l global functions that agree with all of the assignments of all of the local views. In this work we present sufficient condition for a set system to exhibit this generalized definition of list agreement expansion. This is, to our knowledge, the first work to consider this natural generalization of agreement testing. Despite initially appearing very similar to agreement expansion, list agreement expansion seem to require a different set of techniques. This is due to the fact that the natural extension of agreement testing does not suffice when testing for list agreement, as list agreement crucially relies on a global structure. It follows that if a local assignments satisfy list agreement they must not only agree locally but also exhibit some additional structure. In order to test for the existence of this additional structure we use a connection between covering spaces of a high dimensional complex and its coboundaries. We use this connection as a form of “decoupling”. Moreover, we show that any set system that exhibits list agreement expansion also supports direct sum testing. This is the first scheme for direct sum testing that works regardless of the parity of the sizes of the local sets. Prior to our work the schemes for direct sum testing were based on the parity of the sizes of the local tests.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
09/02/2019

Agreement testing theorems on layered set systems

We introduce a framework of layered subsets, and give a sufficient condi...
research
11/26/2017

Agreement tests on graphs and hypergraphs

Agreement tests are a generalization of low degree tests that capture a ...
research
07/22/2021

High dimensional expansion implies amplified local testability

In this work we show that high dimensional expansion implies locally tes...
research
08/18/2023

Agreement theorems for high dimensional expanders in the small soundness regime: the role of covers

Given a family X of subsets of [n] and an ensemble of local functions {f...
research
01/16/2023

An efficient implementation and a strengthening of Alon-Tarsi list coloring method

As one of the first applications of the polynomial method in combinatori...
research
08/18/2023

Characterizing Direct Product Testing via Coboundary Expansion

A d-dimensional simplicial complex X is said to support a direct product...
research
01/18/2019

Towards a General Direct Product Testing Theorem

The Direct Product encoding of a string a∈{0,1}^n on an underlying domai...

Please sign up or login with your details

Forgot password? Click here to reset