Low-soundness direct-product testers and PCPs from Kaufman--Oppenheim complexes
By: Ryan O'Donnell, Noah G. Singer
Potential Business Impact:
Makes computer tests faster and shorter.
We study the Kaufman--Oppenheim coset complexes (STOC 2018, Eur. J. Comb. 2023), which have an elementary and strongly explicit description. Answering an open question of Kaufman, Oppenheim, and Weinberger (STOC 2025), we show that they support sparse direct-product testers in the low soundness regime. Our proof relies on the HDX characterization of agreement testing by Bafna--Minzer and Dikstein--Dinur (both STOC 2024), the recent result of Kaufman. et al, and follows techniques from Bafna--Lifshitz--Minzer and Dikstein--Dinur--Lubotzky (both FOCS 2024). Ultimately, the task reduces to showing dimension-independent coboundary expansion of certain $2$-dimensional subcomplexes of the KO complex; following the ``Dehn method'' of Kaufman and Oppenheim (ICALP 2021), we do this by establishing efficient presentation bounds for certain matrix groups over polynomial rings. As shown by Bafna, Minzer, and Vyas (STOC 2025), a consequence of our direct-product testing result is that the Kaufman--Oppenheim complexes can also be used to obtain PCPs with arbitrarily small constant soundness and quasilinear length. Thus the use of sophisticated number theory and algebraic group-theoretic tools in the construction of these PCPs can be avoided.
Similar Papers
Ideals, Gröbner Bases, and PCPs
Computational Complexity
Simplifies computer code checking with fewer steps.
A General Framework for Low Soundness Homomorphism Testing
Computational Complexity
Checks math rules in groups quickly.
On the Parallel Complexity of Identifying Groups and Quasigroups via Decompositions
Data Structures and Algorithms
Helps computers tell apart similar math groups.