SearcharxivSearch

arXiv · math/0306364

Group laws and free subgroups in topological groups

Abstract

We prove that a permutation group in which different finite sets have different stabilizers cannot satisfy any group law. For locally compact topological groups with this property we show that almost all finite subsets of the group generate free subgroups. We derive consequences of these theorems on Thompson's group $F$, weakly branch groups, automorphism groups of regular trees and profinite groups with alternating composition factors of unbounded degree.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Miklos Abert. 2003-06-25. Group laws and free subgroups in topological groups. https://arxiv.org/abs/math/0306364

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Reversibility and its asymptotic counting in Picard group

We investigate reversible elements in the Picard modular group $\mathrm{PSL}(2,\mathbb{Z}[i])$. We show that reversibility coincides with strong reversibility for Kleinian groups, in particular for the Picard group. We classify reversible elements in the Picard group and characterize loxodromic reversible elements up to conjugacy. We prove that each such conjugacy class contains exactly eight special representatives. We also obtain asymptotic estimates for the number of reversible conjugacy classes with bounded trace.

math.GR

Conjugator length in finitely generated groups

We describe all functions $\mathbb{N}\rightarrow \mathbb{N}$ that can be realized, up to the standard equivalence, as conjugator length functions of finitely generated groups. Furthermore, we show that any two increasing functions $f,g\colon \mathbb N\to \mathbb N$ can be simultaneously realized as conjugator length functions of finitely generated, commensurable (in particular, quasi-isometric) groups.

math.GR

The spectrum of conjugator length functions

A recent program tries to find which functions appear as conjugator length functions. In this note, we show that any (computable) increasing function larger than $n$ appears as $\mathrm{Cl}_G$ for some finitely generated (recursively presented) group. On the other hand, we demonstrate that either $\mathrm{Cl}_G$ must be constant or $\mathrm{Cl}_G(n)\succ n$. Combining these, we obtain a complete description of which functions appear as conjugator length functions of finitely generated groups.

math.GR