Testability in group theory
Group Theory
2024-07-11 v1 Data Structures and Algorithms
Combinatorics
Abstract
This paper is a journal counterpart to our FOCS 2021 paper, in which we initiate the study of property testing problems concerning a finite system of relations between permutations, generalizing the study of stability in permutations. To every such system , a group is associated and the testability of depends only on (just like in Galois theory, where the solvability of a polynomial is determined by the solvability of the associated group). This leads to the notion of testable groups, and, more generally, Benjamini-Schramm rigid groups. The paper presents an ensemble of tools to check if a given group is testable/BS-rigid or not.
Keywords
Cite
@article{arxiv.2204.04539,
title = {Testability in group theory},
author = {Oren Becker and Alexander Lubotzky and Jonathan Mosheiff},
journal= {arXiv preprint arXiv:2204.04539},
year = {2024}
}
Comments
22 pages