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.
| Original language | English |
|---|---|
| Pages (from-to) | 657-678 |
| Number of pages | 22 |
| Journal | Israel Journal of Mathematics |
| Volume | 251 |
| Issue number | 2 |
| Early online date | 29 Dec 2022 |
| DOIs | |
| State | Published - Dec 2022 |
ASJC Scopus subject areas
- General Mathematics
Fingerprint
Dive into the research topics of 'Uncountably many permutation stable groups'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver