Proximity Oblivious Testing and the Role of Invariances [chapter]

Oded Goldreich, Tali Kaufman
2011 Lecture Notes in Computer Science  
We present a general notion of properties that are characterized by local conditions that are invariant under a sufficiently rich class of symmetries. Our framework generalizes two popular models of testing graph properties as well as the algebraic invariances studied by Kaufman and Sudan (STOC'08). Our focus is on the case that the property is characterized by a constant number of local conditions and a rich set of invariances. We show that, in the aforementioned models of testing graph
more » ... ies, characterization by such invariant local conditions is closely related to proximity oblivious testing (as defined by Goldreich and Ron, STOC'09). In contrast to this relation, we show that, in general, characterization by invariant local conditions is neither necessary nor sufficient for proximity oblivious testing. Furthermore, we show that easy testability is not guaranteed even when the property is characterized by local conditions that are invariant under a 1-transitive group of permutations.
doi:10.1007/978-3-642-22670-0_19 fatcat:6ys3dpyplrcijje5nurrqtdhjy