Under the auspices of the Computational Complexity Foundation (CCF)

REPORTS > DETAIL:

Paper:

TR12-001 | 1st January 2012 06:24

Testing Low Complexity Affine-Invariant Properties

TR12-001
Authors: Arnab Bhattacharyya, Eldar Fischer, Shachar Lovett
Publication: 3rd January 2012 23:23
Invariance with respect to linear or affine transformations of the domain is arguably the most common symmetry exhibited by natural algebraic properties. In this work, we show that any low complexity affine-invariant property of multivariate functions over finite fields is testable with a constant number of queries. This immediately reproves, for instance, that the Reed-Muller code over $\mathbb{F}_p$ of degree $d < p$ is testable, with an argument that uses no detailed algebraic information about polynomials, except that low degree is preserved by composition with affine maps.
The complexity of an affine-invariant property $\mathcal{P}$ refers to the maximum complexity, as defined by Green and Tao (Ann. Math. 2008), of the sets of linear forms used to characterize $\mathcal{P}$. A more precise statement of our main result is that for any fixed prime $p \geq 2$ and fixed integer $R \geq 2$, any affine-invariant property $\mathcal{P}$ of functions $f: \mathbb{F}_p^n \to [R]$ is testable, assuming the complexity of the property is less than $p$. Our proof involves developing analogs of graph-theoretic techniques in an algebraic setting, using tools from higher-order Fourier analysis.