DMCA
Green’s conjecture and testing linearinvariant properties (2009)
| Venue: | In Proc. 41st Annual ACM Symposium on the Theory of Computing |
| Citations: | 22 - 3 self |
BibTeX
@INPROCEEDINGS{Shapira09green’sconjecture,
author = {Asaf Shapira},
title = {Green’s conjecture and testing linearinvariant properties},
booktitle = {In Proc. 41st Annual ACM Symposium on the Theory of Computing},
year = {2009},
pages = {159--166}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
A system of ℓ linear equations in p unknowns Mx = b is said to have the removal property if every set S ⊆ {1,..., n} which contains o(n p−ℓ) solutions of Mx = b can be turned into a set S ′ containing no solution of Mx = b, by the removal of o(n) elements. Green [GAFA 2005] proved that a single homogenous linear equation always has the removal property, and conjectured that every set of homogenous linear equations has the removal property. In this paper we confirm Green’s conjecture by showing that every set of linear equations (even non-homogenous) has the removal property. We also discuss some applications of our result in theoretical computer science, and in particular, use it to resolve a conjecture of Bhattacharyya, Chen, Sudan and Xie [4] related to algorithms for testing properties of boolean functions. 1 Background on removal lemmas The (triangle) removal lemma of Ruzsa and Szemerédi [18], which is by now a cornerstone result in combinatorics, states that a graph on n vertices that contains only o(n 3) triangles can be made triangle free by the removal of only o(n 2) edges. Or in other words, if a graph has asymptomatically few triangles then it is asymptotically close to being triangle free. While the lemma was proved
