Document

# Testing Intersecting and Union-Closed Families

## File

LIPIcs.ITCS.2024.33.pdf
• Filesize: 1.37 MB
• 23 pages

## Acknowledgements

This work was partially completed while some of the authors were visiting the Simons Institute for the Theory of Computing at UC Berkeley.

## Cite As

Xi Chen, Anindya De, Yuhao Li, Shivam Nadimpalli, and Rocco A. Servedio. Testing Intersecting and Union-Closed Families. In 15th Innovations in Theoretical Computer Science Conference (ITCS 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 287, pp. 33:1-33:23, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
https://doi.org/10.4230/LIPIcs.ITCS.2024.33

## Abstract

Inspired by the classic problem of Boolean function monotonicity testing, we investigate the testability of other well-studied properties of combinatorial finite set systems, specifically intersecting families and union-closed families. A function f: {0,1}ⁿ → {0,1} is intersecting (respectively, union-closed) if its set of satisfying assignments corresponds to an intersecting family (respectively, a union-closed family) of subsets of [n]. Our main results are that - in sharp contrast with the property of being a monotone set system - the property of being an intersecting set system, and the property of being a union-closed set system, both turn out to be information-theoretically difficult to test. We show that: - For ε ≥ Ω(1/√n), any non-adaptive two-sided ε-tester for intersectingness must make 2^{Ω(n^{1/4}/√{ε})} queries. We also give a 2^{Ω(√{n log(1/ε)})}-query lower bound for non-adaptive one-sided ε-testers for intersectingness. - For ε ≥ 1/2^{Ω(n^{0.49})}, any non-adaptive two-sided ε-tester for union-closedness must make n^{Ω(log(1/ε))} queries. Thus, neither intersectingness nor union-closedness shares the poly(n,1/ε)-query non-adaptive testability that is enjoyed by monotonicity. To complement our lower bounds, we also give a simple poly(n^{√{nlog(1/ε)}},1/ε)-query, one-sided, non-adaptive algorithm for ε-testing each of these properties (intersectingness and union-closedness). We thus achieve nearly tight upper and lower bounds for two-sided testing of intersectingness when ε = Θ(1/√n), and for one-sided testing of intersectingness when ε = Θ(1).

## Subject Classification

##### ACM Subject Classification
• Theory of computation → Streaming, sublinear and near linear time algorithms
• Mathematics of computing → Combinatorics
##### Keywords
• Sublinear algorithms
• property testing
• computational complexity
• monotonicity
• intersecting families
• union-closed families

## Metrics

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

## References

1. Ryan Alweiss, Brice Huang, and Mark Sellke. Improved Lower Bound for Frankl’s Union-Closed Sets Conjecture. Available at https://arxiv.org/pdf/2211.11731.pdf, 2022.
2. A. Belovs and E. Blais. A polynomial lower bound for testing monotonicity. In Proceedings of the 48th ACM Symposium on Theory of Computing, 2016.
3. Hadley Black, Deeparnab Chakrabarty, and C. Seshadhri. A o(d) ⋅ polylog n Monotonicity Tester for Boolean Functions over the Hypergrid [n]^d. In Artur Czumaj, editor, Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2018, New Orleans, LA, USA, January 7-10, 2018, pages 2133-2151. SIAM, 2018.
4. Hadley Black, Deeparnab Chakrabarty, and C. Seshadhri. Domain Reduction for Monotonicity Testing: A o(d) Tester for Boolean Functions in d-Dimensions. In Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, SODA 2020, Salt Lake City, UT, USA, January 5-8, 2020, pages 1975-1994. SIAM, 2020.
5. Hadley Black, Deeparnab Chakrabarty, and C. Seshadhri. Directed Isoperimetric Theorems for Boolean Functions on the Hypergrid and an Õ(n√d) Monotonicity Tester. In Proceedings of the 55th Annual ACM Symposium on Theory of Computing, STOC 2023, Orlando, FL, USA, June 20-23, 2023, pages 233-241. ACM, 2023.
6. Manuel Blum, Michael Luby, and Ronitt Rubinfeld. Self-testing/correcting with applications to numerical problems. Journal of Computer and System Sciences, 47:549-595, 1993. Earlier version in STOC'90.
7. Anselm Blumer, Andrzej Ehrenfeucht, David Haussler, and Manfred K. Warmuth. Learnability and the Vapnik-Chervonenkis dimension. Journal of the ACM, 36(84):929-965, October 1989.
8. Mark Braverman, Subhash Khot, Guy Kindler, and Dor Minzer. Improved monotonicity testers via hypercube embeddings. In 14th Innovations in Theoretical Computer Science Conference, ITCS 2023, January 10-13, 2023, MIT, Cambridge, Massachusetts, USA, volume 251 of LIPIcs, pages 25:1-25:24. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023.
9. Jop Briët, Sourav Chakraborty, David García-Soriano, and Arie Matsliah. Monotonicity testing and shortest-path routing on the cube. Comb., 32(1):35-53, 2012.
10. Henning Bruhn and Oliver Schaudt. The journey of the union-closed conjecture. Graphs and Combinatorics, 31:2043-2074, 2015. URL: https://doi.org/10.1007/s00373-014-1515-0.
11. Deeparnab Chakrabarty and C. Seshadhri. A o(n) monotonicity tester for boolean functions over the hypercube. In Proceedings of the 45th ACM Symposium on Theory of Computing, pages 411-418, 2013.
12. Deeparnab Chakrabarty and C. Seshadhri. Optimal bounds for monotonicity and lipschitz testing over hypercubes and hypergrids. In Symposium on Theory of Computing Conference, STOC'13, Palo Alto, CA, USA, June 1-4, 2013, pages 419-428. ACM, 2013.
13. Deeparnab Chakrabarty and C. Seshadhri. Adaptive boolean monotonicity testing in total influence time. In 10th Innovations in Theoretical Computer Science Conference, ITCS 2019, January 10-12, 2019, San Diego, California, USA, volume 124 of LIPIcs, pages 20:1-20:7. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019.
14. Gilad Chase, Yuval Filmus, Dor Minzer, Elchanan Mossel, and Nitin Saurabh. Approximate polymorphisms. In Stefano Leonardi and Anupam Gupta, editors, STOC '22: 54th Annual ACM SIGACT Symposium on Theory of Computing, Rome, Italy, June 20-24, 2022, pages 195-202. ACM, 2022.
15. Zachary Chase and Shachar Lovett. Approximate union closed conjecture. Available at https://arxiv.org/abs/2211.11689, 2022.
16. Xi Chen, Anindya De, Yuhao Li, Shivam Nadimpalli, and Rocco A. Servedio. Mildly exponential lower bounds on tolerant testers for monotonicity, unateness, and juntas. SODA 2024, To appear, 2024. URL: https://doi.org/10.48550/arXiv.2309.12513.
17. Xi Chen, Anindya De, Rocco A. Servedio, and Li-Yang Tan. Boolean Function Monotonicity Testing Requires (Almost) n^1/2 Non-adaptive Queries. In Proceedings of the Forty-Seventh Annual ACM on Symposium on Theory of Computing, STOC 2015, pages 519-528, 2015.
18. Xi Chen, Rocco A. Servedio, and Li-Yang Tan. New algorithms and lower bounds for testing monotonicity. In Proceedings of the 55th IEEE Symposium on Foundations of Computer Science, pages 286-295, 2014.
19. Xi Chen, Erik Waingarten, and Jinyu Xie. Beyond Talagrand functions: new lower bounds for testing monotonicity and unateness. In Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing (STOC), pages 523-536, 2017.
20. Irit Dinur and Ehud Friedgut. Intersecting families are essentially contained in juntas. Combinatorics, Probability and Computing, 18(1-2):107-122, 2009. URL: https://doi.org/10.1017/S0963548308009309.
21. Yevgeniy Dodis, Oded Goldreich, Eric Lehman, Sofya Raskhodnikova, Dana Ron, and Alex Samorodnitsky. Improved testing algorithms for monotonocity. In Proceedings of RANDOM, pages 97-108, 1999.
22. D. Ellis, N. Keller, and N. Lifshitz. Stability versions of Erdös-Ko-Rado type theorems, via isoperimetry. J. Eur. Math. Soc, 21:3857-3902, 2019.
23. David Ellis. Intersection Problems in Extremal Combinatorics: Theorems, Techniques and Questions Old and New, pages 115-173. Cambridge University Press, 2022.
24. P. Erdös, C. Ko, and R. Rado. Intersection theorems for systems of finite sets. Quart. J. Math. Oxford (Series 2), 12:313-320, 1961.
25. Yuval Filmus, Noam Lifshitz, Dor Minzer, and Elchanan Mossel. AND testing and robust judgement aggregation. In Konstantin Makarychev, Yury Makarychev, Madhur Tulsiani, Gautam Kamath, and Julia Chuzhoy, editors, Proccedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing, STOC 2020, Chicago, IL, USA, June 22-26, 2020, pages 222-233. ACM, 2020.
26. E. Fischer, E. Lehman, I. Newman, S. Raskhodnikova, R. Rubinfeld, and A. Samorodnitsky. Monotonicity testing over general poset domains. In Proc. 34th Annual ACM Symposium on the Theory of Computing, pages 474-483, 2002.
27. Pter Frankl. Extremal set systems. In Handbook of combinatorics, pages 2:1293-1329, 1995.
28. E. Friedgut. On the measure of intersecting families, uniqueness and stability. Combinatorica, 28:503-528, 2008.
29. Justin Gilmer. A constant lower bound for the union-closed sets conjecture. Available at https://arxiv.org/abs/2211.09055, 2022.
30. Oded Goldreich, Shafi Goldwasser, Eric Lehman, Dana Ron, and Alex Samordinsky. Testing monotonicity. Combinatorica, 20(3):301-337, 2000.
31. Oded Goldreich, Shafi Goldwasser, and Dana Ron. Property testing and its connection to learning and approximation. Journal of the ACM, 45:653-750, 1998.
32. S. Halevy and E. Kushilevitz. Distribution-Free Property Testing. SIAM J. Comput., 37(4):1107-1138, 2007.
33. Daniel M. Kane. A monotone function given by a low-depth decision tree that is not an approximate junta. Theory Comput., 9:587-592, 2013.
34. Subhash Khot, Dor Minzer, and Muli Safra. On monotonicity testing and boolean isoperimetric-type theorems. SIAM J. Comput., 47(6):2238-2276, 2018.
35. Philip N. Klein and Neal E. Young. On the number of iterations for dantzig-wolfe optimization and packing-covering approximation algorithms. SIAM J. Comput., 44(4):1154-1172, 2015. URL: https://doi.org/10.1137/12087222X.
36. Kevin Matulef, Ryan O'Donnell, Ronitt Rubinfeld, and Rocco A. Servedio. Testing halfspaces. SIAM Journal on Computing, 39(5):2004-2047, 2010.
37. Ramesh Krishnan S. Pallavoor, Sofya Raskhodnikova, and Erik Waingarten. Approximating the distance to monotonicity of boolean functions. Random Struct. Algorithms, 60(2):233-260, 2022.
38. M. Parnas, D. Ron, and A. Samorodnitsky. Testing Basic Boolean Formulae. SIAM J. Disc. Math., 16:20-46, 2002. URL: https://citeseer.ifi.unizh.ch/parnas02testing.html.
39. Luke Pebody. Extension of a Method of Gilmer. Available at https://arxiv.org/abs/2211.13139, 2022.
40. Will Sawin. An improved lower bound for the union-closed set conjecture. Available at https://arxiv.org/abs/2211.11504, 2022.
41. M. Talagrand. How much are increasing sets positively correlated? Combinatorica, 16(2):243-258, 1996.
42. A. Yao. Probabilistic computations: Towards a unified measure of complexity. In Proc. Seventeenth Annual Symposium on Foundations of Computer Science (STOC), pages 222-227, 1977.
X

Feedback for Dagstuhl Publishing

### Thanks for your feedback!

Feedback submitted

### Could not send message

Please try again later or send an E-mail