Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userUncountably many permutation stable groups
69
0
0.0
(
0
)
Ask ChatGPT about the research
No Arabic 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.
rate research
Read More
We prove that all invariant random subgroups of the lamplighter group $L$ are co-sofic. It follows that $L$ is permutation stable, providing an example of an infinitely presented such a group. Our proof applies more generally to all permutational wreath products of finitely generated abelian groups. We rely on the pointwise ergodic theorem for amenable groups.
Given a prime $p$, we construct a permutation group containing at least $p^{p-2}$ non-conjugated regular elementary abelian subgroups of order $p^3$. This gives the first example of a permutation group with exponentially many non-conjugated regular subgroups.
We show that surface groups are flexibly stable in permutations. Our method is purely geometric and relies on an analysis of branched covers of hyperbolic surfaces. Along the way we establish a quantitative variant of the LERF property for surface groups which may be of independent interest.
Let $Gamma$ be a finite index subgroup of the mapping class group $MCG(Sigma)$ of a closed orientable surface $Sigma$, possibly with punctures. We give a precise condition (in terms of the Nielsen-Thurston decomposition) when an element $ginGamma$ has positive stable commutator length. In addition, we show that in these situations the stable commutator length, if nonzero, is uniformly bounded away from 0. The method works for certain subgroups of infinite index as well and we show $scl$ is uniformly positive on the nontrivial elements of the Torelli group. The proofs use our earlier construction in the paper Constructing group actions on quasi-trees and applications to mapping class groups of group actions on quasi-trees.
We prove that finitely generated virtually free groups are stable in permutations. As an application, we show that almost-periodic almost-automorphisms of labelled graphs are close to periodic automorphisms.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
