Search arXivSearch

arXiv · 1809.08091

Automorphisms of graph products of groups from a geometric perspective

Abstract

This article studies automorphism groups of graph products of arbitrary groups. We completely characterise automorphisms that preserve the set of conjugacy classes of vertex groups as those automorphisms that can be decomposed as a product of certain elementary automorphisms (inner automorphisms, partial conjugations, automorphisms associated to symmetries of the underlying graph). This allows us to completely compute the automorphism group of certain graph products, for instance in the case where the underlying graph is finite, connected, leafless and of girth at least $5$. If in addition the underlying graph does not contain separating stars, we can understand the geometry of the automorphism groups of such graph products of groups further: we show that such automorphism groups do not satisfy Kazhdan's property (T) and are acylindrically hyperbolic. Applications to automorphism groups of graph products of finite groups are also included. The approach in this article is geometric and relies on the action of graph products of groups on certain complexes with a particularly rich combinatorial geometry. The first such complex is a particular Cayley graph of the graph product that has a quasi-median geometry, a combinatorial geometry reminiscent of (but more general than) CAT(0) cube complexes. The second (strongly related) complex used is the Davis complex of the graph product, a CAT(0) cube complex that also has a structure of right-angled building.

Explore related subjects

Keep this discovery

BibTeXRIS

Anthony Genevois, Alexandre Martin. 2018-09-21. Automorphisms of graph products of groups from a geometric perspective. https://doi.org/10.1112/plms.12282

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