Uncountably many permutation stable groups

DOI10.1007/S11856-022-2425-0MaRDI QIDQ6327891arXivFDO

Authors Arie Levit, Alexander Lubotzky

Publication date 25 October 2019

Published in arXiv

Full work available at URL https://doi.org/10.1007/S11856-022-2425-0

Mathematics Subject Classification ID

Symmetric groups (20B30) Generators, relations, and presentations of groups (20F05)

arXiv classification

math.DSmath.GR

Abstract: In a 1937 paper B.H. Neumann constructed an uncountable family of $2$-generated groups. We prove that all of his groups are permutation stable by analyzing the structure of their invariant random subgroups.

This page was built for publication: Uncountably many permutation stable groups

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6327891)