Testability of relations between permutations
Oren Becker, Alexander Lubotzky, Jonathan Mosheiff

TL;DR
This paper introduces a framework for testing whether tuples of permutations satisfy certain relations using few queries, connecting graph expansion properties and group theory to determine testability.
Contribution
It develops criteria for testability of permutation relations via graph expansion, unifies stability and testability concepts, and surveys related computational results.
Findings
Graph-based criteria for testability and non-testability.
Deep connection between permutation relations and graph expansion.
Reformulation of permutation stability as a testability problem.
Abstract
We initiate the study of property testing problems concerning relations between permutations. In such problems, the input is a tuple of permutations on , and one wishes to determine whether this tuple satisfies a certain system of relations , or is far from every tuple that satisfies . If this computational problem can be solved by querying only a small number of entries of the given permutations, we say that is testable. For example, when and consists of the single relation , this corresponds to testing whether , where and denote composition of permutations. We define a collection of graphs, naturally associated with the system , that encodes all the information relevant to the testability of . We then prove two theorems that…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
