
AbstractThis paper is a journal counterpart to [5], in which we initiate the study of property testing problems concerning a finite system of relations E between permutations, generalizing the study of stability in permutations. To every such system E, a group Γ = ΓE is associated and the testability of E 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.
FOS: Computer and information sciences, Computer Science - Data Structures and Algorithms, FOS: Mathematics, Mathematics - Combinatorics, Data Structures and Algorithms (cs.DS), Group Theory (math.GR), Combinatorics (math.CO), Mathematics - Group Theory
FOS: Computer and information sciences, Computer Science - Data Structures and Algorithms, FOS: Mathematics, Mathematics - Combinatorics, Data Structures and Algorithms (cs.DS), Group Theory (math.GR), Combinatorics (math.CO), Mathematics - Group Theory
| citations This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 2 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
