On Sums of Locally Testable Affine Invariant Properties

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 Fqn to the subfield Fq and include all properties that form an 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 affineinvariance. 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 Fq has a single-orbit characterization (even when the domain is viewed as 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 Fq 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.

[1]  Madhu Sudan,et al.  Algebraic property testing: the role of invariance , 2008, STOC '08.

[2]  Rajeev Motwani,et al.  Randomized Algorithms , 1995, SIGA.

[3]  Sanjeev Arora,et al.  Probabilistic checking of proofs; a new characterization of NP , 1992, Proceedings., 33rd Annual Symposium on Foundations of Computer Science.

[4]  Simon Litsyn,et al.  Almost orthogonal linear codes are locally testable , 2005, 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05).

[5]  Asaf Shapira,et al.  A Unified Framework for Testing Linear-Invariant Properties , 2010, 2010 IEEE 51st Annual Symposium on Foundations of Computer Science.

[6]  Carsten Lund,et al.  Proof verification and the hardness of approximation problems , 1998, JACM.

[7]  Shachar Lovett,et al.  The Complexity of Boolean Functions in Different Characteristics , 2009, 2009 24th Annual IEEE Conference on Computational Complexity.

[8]  A. Shapira A proof of Green's conjecture regarding the removal properties of sets of linear equations , 2008, 0807.4901.

[9]  Eyal Kushilevitz,et al.  Private information retrieval , 1995, Proceedings of IEEE 36th Annual Foundations of Computer Science.

[10]  Avi Wigderson,et al.  Rank bounds for design matrices with applications to combinatorial geometry and locally correctable codes , 2010, STOC '11.

[11]  Eli Ben-Sasson,et al.  Limits on the Rate of Locally Testable Affine-Invariant Codes , 2011, APPROX-RANDOM.

[12]  Noga Alon,et al.  A combinatorial characterization of the testable graph properties: it's all about regularity , 2006, STOC '06.

[13]  Shachar Lovett,et al.  Testing of exponentially large codes, by a new extension to Weil bound for character sums , 2010, Electron. Colloquium Comput. Complex..

[14]  Noga Alon,et al.  Testing Reed-Muller codes , 2005, IEEE Transactions on Information Theory.

[15]  Atri Rudra,et al.  Testing low-degree polynomials over prime fields , 2004, 45th Annual IEEE Symposium on Foundations of Computer Science.

[16]  Shubhangi Saraf,et al.  Local list-decoding and testing of random linear codes from high error , 2010, STOC '10.

[17]  D. Král,et al.  A removal lemma for systems of linear equations over finite fields , 2008, 0809.1846.

[18]  Dana Ron,et al.  Testing Polynomials over General Fields , 2006, SIAM J. Comput..

[19]  Richard Zippel,et al.  Probabilistic algorithms for sparse polynomials , 1979, EUROSAM.

[20]  Avishay Tal,et al.  On the degree of univariate polynomials over the integers , 2012, ITCS '12.

[21]  Madhu Sudan Invariance in Property Testing , 2010, Electron. Colloquium Comput. Complex..

[22]  Jonathan Katz,et al.  On the efficiency of local decoding procedures for error-correcting codes , 2000, STOC '00.

[23]  Dana Ron,et al.  Property testing and its connection to learning and approximation , 1996, Proceedings of 37th Conference on Foundations of Computer Science.

[24]  Madhu Sudan,et al.  Testing Linear-Invariant Non-Linear Properties , 2009, STACS.

[25]  Yuval Ishai,et al.  On Locally Decodable Codes, Self-correctable Codes, and t -Private PIR , 2007, APPROX-RANDOM.

[26]  Madhu Sudan,et al.  2-Transitivity Is Insufficient for Local Testability , 2008, Computational Complexity Conference.

[27]  Eli Ben-Sasson,et al.  Symmetric LDPC Codes are not Necessarily Locally Testable , 2011, 2011 IEEE 26th Annual Conference on Computational Complexity.

[28]  Ronitt Rubinfeld,et al.  Robust Characterizations of Polynomials with Applications to Program Testing , 1996, SIAM J. Comput..

[29]  Jacob T. Schwartz,et al.  Fast Probabilistic Algorithms for Verification of Polynomial Identities , 1980, J. ACM.

[30]  Yuval Ishai,et al.  On Locally Decodable Codes, Self-Correctable Codes, and t-Private PIR , 2010, Algorithmica.

[31]  Madhu Sudan,et al.  Sparse Random Linear Codes are Locally Decodable and Testable , 2007, 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07).

[32]  Emil Artin,et al.  The orders of the linear groups , 1955 .

[33]  László Lovász,et al.  Graph limits and parameter testing , 2006, STOC '06.