SearcharxivSearch

arXiv · 2409.20513

Profinite rigidity for free-by-cyclic groups with centre

Abstract

A free-by-cyclic group $F_N\rtimes_\phi\mathbb{Z}$ has non-trivial centre if and only if $[\phi]$ has finite order in ${\rm{Out}}(F_N)$. We establish a profinite ridigity result for such groups: if $\Gamma_1$ is a free-by-cyclic group with non-trivial centre and $\Gamma_2$ is a finitely generated free-by-cyclic group with the same finite quotients as $\Gamma_1$, then $\Gamma_2$ is isomorphic to $\Gamma_1$. One-relator groups with centre are similarly rigid. We prove that finitely generated free-by-(finite cyclic) groups are profinitely rigid in the same sense; the proof revolves around a finite poset $\mathbf{fsc}(G)$ that carries information about the centralisers of finite subgroups of $G$ -- it is a complete invariant for these groups. These results provide contrasts with the lack of profinite rigidity among surface-by-cyclic groups and (free abelian)-by-cyclic groups, as well as general virtually-free groups.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Martin R. Bridson, Paweł Piwek. 2024-09-30. Profinite rigidity for free-by-cyclic groups with centre. https://doi.org/10.1112/jlms.70181

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