SearcharxivSearch

arXiv · 1103.1099

Groups where free subgroups are abundant

Abstract

Given an infinite topological group G and a cardinal k>0, we say that G is almost k-free if the set of k-tuples in G^k which freely generate free subgroups of G is dense in G^k. In this note we examine groups having this property and construct examples. For instance, we show that if G is a non-discrete Hausdorff topological group that contains a dense free subgroup of rank k>0, then G is almost k-free. A consequence of this is that for any infinite set X, the group of all permutations of X is almost 2^|X|-free. We also show that an infinite topological group is almost aleph_0-free if and only if it is almost n-free for each positive integer n. This generalizes the work of Dixon and Gartside-Knight.

Explore related subjects

Keep this discovery

BibTeXRIS

Zachary Mesyan. 2011-03-06. Groups where free subgroups are abundant. https://doi.org/10.1016/j.jalgebra.2011.07.013

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