1 citations · 2 across the 5 of their papers we have counts for
6 papers
Conditional Non-Soficity of p-adic Deligne Extensions: on a Theorem of Gohla and Thom
Michael Chapman, Yotam Dikstein, Alexander Lubotzky
A long standing problem asks whether every group is sofic, i.e., can be separated by almost-homomorphisms to the symmetric group . Similar problems have been asked with res…
The Aldous--Lyons Conjecture I: Subgroup Tests
Lewis Bowen, Michael Chapman, Alexander Lubotzky +1
This paper, and its companion [BCV24], are devoted to a negative resolution of the Aldous--Lyons Conjecture [AL07, Ald07]. This conjecture, originated in probability theory, is wel…
Non-commutative error correcting codes and proper subgroup testing
Michael Chapman, Irit Dinur, Alexander Lubotzky
Property testing has been a major area of research in computer science in the last three decades. By property testing we refer to an ensemble of problems, results and algorithms wh…
Stability of Homomorphisms, Coverings and Cocycles II: Examples, Applications and Open problems
Michael Chapman, Alexander Lubotzky
Coboundary expansion (with coefficients), and variations on it, have been the focus of intensive research in the last two decades. It was used to study random comple…
Efficiently stable presentations from error-correcting codes
Michael Chapman, Thomas Vidick, Henry Yuen
We introduce a notion of \emph{efficient stability} for finite presentations of groups. Informally, a finite presentation using generators and relations is \emph{stable} if…
Stability of Homomorphisms, Coverings and Cocycles I: Equivalence
Michael Chapman, Alexander Lubotzky
This paper is motivated by recent developments in group stability, high dimensional expansion, local testability of error correcting codes and topological property testing. In Part…