SearcharxivSearch

arXiv · 1807.00622

Automorphisms of graph products of groups and acylindrical hyperbolicity

Abstract

This article is dedicated to the study of the acylindrical hyperbolicity of automorphism groups of graph products of groups. Our main result is that, if $\Gamma$ is a finite graph which contains at least two vertices and is not a join and if $\mathcal{G}$ is a collection of finitely generated irreducible groups, then either $\Gamma \mathcal{G}$ is infinite dihedral or $\mathrm{Aut}(\Gamma \mathcal{G})$ is acylindrically hyperbolic. This theorem is new even for right-angled Artin groups and right-angled Coxeter groups. Various consequences are deduced from this statement and from the techniques used to prove it. For instance, we show that the automorphism groups of most graph products verify vastness properties such as being SQ-universal; we show that many automorphism groups of graph products do not satisfy Kazhdan's property (T); we solve the isomorphism problem between graph products in some cases; and we show that a graph product of coarse median groups, as defined by Bowditch, is coarse median itself.

Explore related subjects

Keep this discovery

BibTeXRIS

Anthony Genevois. 2018-07-02. Automorphisms of graph products of groups and acylindrical hyperbolicity. https://arxiv.org/abs/1807.00622

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