Document

# Towards a General Direct Product Testing Theorem

## File

LIPIcs.FSTTCS.2018.11.pdf
• Filesize: 0.56 MB
• 17 pages

## Cite As

Elazar Goldenberg and Karthik C. S.. Towards a General Direct Product Testing Theorem. In 38th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 122, pp. 11:1-11:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
https://doi.org/10.4230/LIPIcs.FSTTCS.2018.11

## Abstract

The Direct Product encoding of a string a in {0,1}^n on an underlying domain V subseteq ([n] choose k), is a function DP_V(a) which gets as input a set S in V and outputs a restricted to S. In the Direct Product Testing Problem, we are given a function F:V -> {0,1}^k, and our goal is to test whether F is close to a direct product encoding, i.e., whether there exists some a in {0,1}^n such that on most sets S, we have F(S)=DP_V(a)(S). A natural test is as follows: select a pair (S,S')in V according to some underlying distribution over V x V, query F on this pair, and check for consistency on their intersection. Note that the above distribution may be viewed as a weighted graph over the vertex set V and is referred to as a test graph. The testability of direct products was studied over various domains and test graphs: Dinur and Steurer (CCC '14) analyzed it when V equals the k-th slice of the Boolean hypercube and the test graph is a member of the Johnson graph family. Dinur and Kaufman (FOCS '17) analyzed it for the case where V is the set of faces of a Ramanujan complex, where in this case V=O_k(n). In this paper, we study the testability of direct products in a general setting, addressing the question: what properties of the domain and the test graph allow one to prove a direct product testing theorem? Towards this goal we introduce the notion of coordinate expansion of a test graph. Roughly speaking a test graph is a coordinate expander if it has global and local expansion, and has certain nice intersection properties on sampling. We show that whenever the test graph has coordinate expansion then it admits a direct product testing theorem. Additionally, for every k and n we provide a direct product domain V subseteq (n choose k) of size n, called the Sliding Window domain for which we prove direct product testability.

## Subject Classification

##### ACM Subject Classification
• Theory of computation → Probabilistic computation
##### Keywords
• Property Testing
• Direct Product
• PCP
• Johnson graph
• Ramanujan Complex
• Derandomization

## Metrics

• Access Statistics
• Total Accesses (updated on a weekly basis)
0

## References

1. Sanjeev Arora and Madhu Sudan. Improved low-degree testing and its applications. In IN 29TH STOC, pages 485-495, 1997.
2. Amey Bhangale, Irit Dinur, and Inbal Livni Navon. Cube vs. Cube Low Degree Test. In 8th Innovations in Theoretical Computer Science Conference, ITCS 2017, January 9-11, 2017, Berkeley, CA, USA, pages 40:1-40:31, 2017. URL: http://dx.doi.org/10.4230/LIPIcs.ITCS.2017.40.
3. Andries E. Brouwer, Sebastian M. Cioabă, Ferdinand Ihringer, and Matt McGinnis. The smallest eigenvalues of Hamming graphs, Johnson graphs and other distance-regular graphs with classical parameters. Journal of Combinatorial Theory, Series B, 2018. URL: http://dx.doi.org/10.1016/j.jctb.2018.04.005.
4. Roee David, Irit Dinur, Elazar Goldenberg, Guy Kindler, and Igor Shinkar. Direct Sum Testing. SIAM J. Comput., 46(4):1336-1369, 2017. URL: http://dx.doi.org/10.1137/16M1061655.
5. Irit Dinur and Elazar Goldenberg. Locally Testing Direct Product in the Low Error Range. In 49th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2008, October 25-28, 2008, Philadelphia, PA, USA, pages 613-622, 2008. URL: http://dx.doi.org/10.1109/FOCS.2008.26.
6. Irit Dinur and Tali Kaufman. High Dimensional Expanders Imply Agreement Expanders. In 58th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2017, Berkeley, CA, USA, October 15-17, 2017, pages 974-985, 2017. URL: http://dx.doi.org/10.1109/FOCS.2017.94.
7. Irit Dinur and Inbal Livni Navon. Exponentially Small Soundness for the Direct Product Z-Test. In 32nd Computational Complexity Conference, CCC 2017, July 6-9, 2017, Riga, Latvia, pages 29:1-29:50, 2017. URL: http://dx.doi.org/10.4230/LIPIcs.CCC.2017.29.
8. Irit Dinur and Omer Reingold. Assignment Testers: Towards a Combinatorial Proof of the PCP Theorem. SIAM J. Comput., 36(4):975-1024, December 2006. URL: http://dx.doi.org/10.1137/S0097539705446962.
9. Irit Dinur and David Steurer. Direct Product Testing. In IEEE 29th Conference on Computational Complexity, CCC 2014, Vancouver, BC, Canada, June 11-13, 2014, pages 188-196, 2014. URL: http://dx.doi.org/10.1109/CCC.2014.27.
10. Oded Goldreich and Shmuel Safra. A Combinatorial Consistency Lemma with Application to Proving the PCP Theorem. SIAM J. Comput., 29(4):1132-1154, 2000. URL: http://dx.doi.org/10.1137/S0097539797315744.
11. Russell Impagliazzo, Valentine Kabanets, and Avi Wigderson. New Direct-Product Testers and 2-Query PCPs. SIAM J. Comput., 41(6):1722-1768, 2012. URL: http://dx.doi.org/10.1137/09077299X.
12. Ran Raz and Shmuel Safra. A Sub-constant Error-probability Low-degree Test, and a Sub-constant Error-probability PCP Characterization of NP. In Proceedings of the Twenty-ninth Annual ACM Symposium on Theory of Computing, STOC '97, pages 475-484, New York, NY, USA, 1997. ACM. URL: http://dx.doi.org/10.1145/258533.258641.