SearcharxivSearch

arXiv · 2304.10235

The pro-$k$-solvable topology on a free group

Abstract

We prove that, given a finitely generated subgroup $H$ of a free group $F$, the following questions are decidable: is $H$ closed (dense) in $F$ for the pro-(met)abelian topology? is the closure of $H$ in $F$ for the pro-(met)abelian topology finitely generated? We show also that if the latter question has a positive answer, then we can effectively construct a basis for the closure, and the closure has decidable membership problem in any case. Moreover, it is decidable whether $H$ is closed for the pro-${\bf V}$ topology when ${\bf V}$ is an equational pseudovariety of finite groups, such as the pseudovariety ${\bf S}_k$ of all finite solvable groups with derived length $\leq k$. We also connect the pro-abelian topology with the topologies defined by abelian groups of bounded exponent.

Explore related subjects

Keep this discovery

BibTeXRIS

Claude Marion, Pedro V. Silva, Gareth Tracey. 2023-04-20. The pro-$k$-solvable topology on a free group. https://arxiv.org/abs/2304.10235

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