SearcharxivSearch

arXiv · 1504.02559

Separability properties of automorphisms of graph products of groups

Abstract

We study properties of automorphisms of graph products of groups. We show that graph product $\Gamma\mathcal{G}$ has non-trivial pointwise inner automorphisms if and only if some vertex group corresponding to a central vertex has non-trivial pointwise inner automorphisms. We use this result to study residual finiteness of $\mathop{Out}(\Gamma \mathcal{G})$. We show that if all vertex groups are finitely generated residually finite and the vertex groups corresponding to central vertices satisfy certain technical (yet natural) condition, then $\mathop{Out}(\Gamma\mathcal{G})$ is residually finite. Finally, we generalise this result to graph products of residually $p$-finite groups to show that if $\Gamma\mathcal{G}$ is a graph product of finitely generated residually $p$-finite groups such that the vertex groups corresponding to central vertices satisfy the $p$-version of the technical condition then $\mathop{Out}(\Gamma\mathcal{G})$ is virtually residually $p$-finite. We use this result to prove bi-orderability of Torreli groups of some graph products of finitely generated residually torsion-free nilpotent groups.

Explore related subjects

Keep this discovery

BibTeXRIS

Michal Ferov. 2015-04-10. Separability properties of automorphisms of graph products of groups. https://arxiv.org/abs/1504.02559

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