DeepAI AI Chat
Log In Sign Up

Testability in group theory

by   Oren Becker, et al.
Hebrew University of Jerusalem

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 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.


page 1

page 2

page 3

page 4


Recognizing the Commuting Graph of a Finite Group

In this paper we study the realizability question for commuting graphs o...

Stability and testability: equations in permutations

We initiate the study of property testing problems concerning equations ...

A Formalization of Finite Group Theory

Previous formulations of group theory in ACL2 and Nqthm, based on either...

The isomorphism problem for plain groups is in Σ_3^𝖯

Testing isomorphism of infinite groups is a classical topic, but from th...

Fourier and Circulant Matrices are Not Rigid

The concept of matrix rigidity was first introduced by Valiant in [Val77...

Addendum to "Tilings problems on Baumslag-Solitar groups"

In our article in MCU'2013 we state the the Domino problem is undecidabl...

The Complexity of Proportionality Degree in Committee Elections

Over the last few years, researchers have put significant effort into un...