Related papers: Virtually free groups are stable in permutations

We prove that a uniquely 2-divisible group that admits an almost regular involutory automorphism is solvable.

We show that if a group is not virtually cyclic and is hyperbolic relative to a family of proper subgroups, then it has a hyperbolically embedded subgroup which contains a finitely generated non-abelian free group as a finite index…

We characterize the stabilized automorphism group for odometers and Toeplitz subshifts and then prove an invariance property of the stabilized automorphism group of these dynamical systems. A particular case of interest is that for torsion…

We obtain a homological characterisation of virtually free-by-cyclic groups among groups that are hyperbolic and virtually compact special. As a consequence, we show that many groups known to be coherent actually possess the stronger…

We prove that an arbitrary compact metrizable group can be realized as the automorphism group of a graphing; this is a continuous analogue to Frucht's theorem recovering arbitrary finite groups are automorphism groups of finite graphs. The…

We prove several rigidity properties for random quotients of mapping class groups of surfaces, namely whose kernel is normally generated by the n-th steps of finitely many independent random walks. Firstly, we generalise a celebrated…

We classify the finite quasisimple groups whose commuting graph is perfect and we give a general structure theorem for finite groups whose commuting graph is perfect.

We prove that the outer automorphism group of a free group of countably infinite rank is complete.

An automorphism of a group is said to be normal if it preserves each normal subgroup. In this paper, we determine the normal automorphisms of a free metabelian nilpotent group.

Let $\Gamma$ be a connected $G$-vertex-transitive graph, let $v$ be a vertex of $\Gamma$ and let $L=G_v^{\Gamma(v)}$ be the permutation group induced by the action of the vertex-stabiliser $G_v$ on the neighbourhood $\Gamma(v)$. Then…

Let $\Gamma$ be a finite connected $G$-vertex-transitive graph and let $v$ be a vertex of $\Gamma$. If the permutation group induced by the action of the vertex-stabiliser $G_v$ on the neighbourhood $\Gamma(v)$ is permutation isomorphic to…

We show that a minimal toplogical dynamical system that is frequently stable if and only if it is almost automorphic.

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…

We prove that a finitely generated group $G$ is virtually free if and only if there exists a generating set for $G$ and $k > 0$ such that all $k$-locally geodesic words with respect to that generating set are geodesic.

We prove that the commutator is stable in permutations endowed with the Hamming distance, that is, two permutations that almost commute are near two commuting permutations. Our result extends to $k$-tuples of almost commuting permutations,…

We study the problem of realizing families of subgroups as the set of stabilizers of configurations from a subshift of finite type (SFT). This problem generalizes both the existence of strongly and weakly aperiodic SFTs. We show that a…

We start up the study of the stability of general graph pairs. This notion is a generalization of the concept of the stability of graphs. We say that a pair of graphs $(\Gamma,\Sigma)$ is stable if $Aut(\Gamma\times\Sigma) \cong…

An arbitrary homomorphism between groups is nonincreasing for stable commutator length, and there are infinitely many (injective) homomorphisms between free groups which strictly decrease the stable commutator length of some elements.…

A group $G$ is called automatically continuous if any homomorphism from a completely metrizable or locally compact Hausdorff group to $G$ has open kernel. In this paper, we study preservation of automatic continuity under group-theoretic…

We show that on an arbitrary finitely generated non virtually solvable linear group, any two independent random walks will eventually generate a free subgroup. In fact, this will hold for an exponential number of independent random walks.