Uncountably many permutation stable groups
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.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.