TY - GEN
T1 - On sums of locally testable affine invariant properties
AU - Ben-Sasson, Eli
AU - Grigorescu, Elena
AU - Maatouk, Ghid
AU - Shpilka, Amir
AU - Sudan, Madhu
PY - 2011
Y1 - 2011
N2 - Affine-invariant properties are an abstract class of properties that generalize some central algebraic ones, such as linearity and low-degree-ness, that have been studied extensively in the context of property testing. Affine invariant properties consider functions mapping a big field double-struck F qn to the subfield double-struck Fq and include all properties that form an double-struck Fq-vector space and are invariant under affine transformations of the domain. Almost all the known locally testable affine-invariant properties have so-called "single-orbit characterizations" - namely they are specified by a single local constraint on the property, and the "orbit" of this constraint, i.e., translations of this constraint induced by affine-invariance. Single-orbit characterizations by a local constraint are also known to imply local testability. In this work we show that properties with single-orbit characterizations are closed under "summation". To complement this result, we also show that the property of being an n-variate low-degree polynomial over double-struck Fq has a single-orbit characterization (even when the domain is viewed as double-struck Fqn and so has very few affine transformations). As a consequence we find that the sum of any sparse affine-invariant property (properties satisfied by qO(n)-functions) with the set of degree d multivariate polynomials over double-struck F q has a single-orbit characterization (and is hence locally testable) when q is prime. We conclude with some intriguing questions/conjectures attempting to classify all locally testable affine-invariant properties.
AB - Affine-invariant properties are an abstract class of properties that generalize some central algebraic ones, such as linearity and low-degree-ness, that have been studied extensively in the context of property testing. Affine invariant properties consider functions mapping a big field double-struck F qn to the subfield double-struck Fq and include all properties that form an double-struck Fq-vector space and are invariant under affine transformations of the domain. Almost all the known locally testable affine-invariant properties have so-called "single-orbit characterizations" - namely they are specified by a single local constraint on the property, and the "orbit" of this constraint, i.e., translations of this constraint induced by affine-invariance. Single-orbit characterizations by a local constraint are also known to imply local testability. In this work we show that properties with single-orbit characterizations are closed under "summation". To complement this result, we also show that the property of being an n-variate low-degree polynomial over double-struck Fq has a single-orbit characterization (even when the domain is viewed as double-struck Fqn and so has very few affine transformations). As a consequence we find that the sum of any sparse affine-invariant property (properties satisfied by qO(n)-functions) with the set of degree d multivariate polynomials over double-struck F q has a single-orbit characterization (and is hence locally testable) when q is prime. We conclude with some intriguing questions/conjectures attempting to classify all locally testable affine-invariant properties.
KW - Direct sums
KW - Error-correcting codes
KW - Property testing
KW - Symmetries
UR - http://www.scopus.com/inward/record.url?scp=80052377552&partnerID=8YFLogxK
U2 - 10.1007/978-3-642-22935-0_34
DO - 10.1007/978-3-642-22935-0_34
M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???
AN - SCOPUS:80052377552
SN - 9783642229343
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 400
EP - 411
BT - Approximation, Randomization, and Combinatorial Optimization
T2 - 14th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2011 and the 15th International Workshop on Randomization and Computation, RANDOM 2011
Y2 - 17 August 2011 through 19 August 2011
ER -