Automorphisms of Graph Products of Groups and Acylindrical Hyperbolicity

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 <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="normal upper Gamma"> <mml:semantics> <mml:mi mathvariant="normal">Γ</mml:mi> <mml:annotation encoding="application/x-tex">\Gamma</mml:annotation> </mml:semantics> </mml:math> </inline-formula> is a finite graph which contains at least two vertices and is not a join and if <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="script upper G"> <mml:semantics> <mml:mrow class="MJX-TeXAtom-ORD"> <mml:mi class="MJX-tex-caligraphic" mathvariant="script">G</mml:mi> </mml:mrow> <mml:annotation encoding="application/x-tex">\mathcal {G}</mml:annotation> </mml:semantics> </mml:math> </inline-formula> is a collection of finitely generated irreducible groups, then either <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="normal upper Gamma script upper G"> <mml:semantics> <mml:mrow> <mml:mi mathvariant="normal">Γ</mml:mi> <mml:mrow class="MJX-TeXAtom-ORD"> <mml:mi class="MJX-tex-caligraphic" mathvariant="script">G</mml:mi> </mml:mrow> </mml:mrow> <mml:annotation encoding="application/x-tex">\Gamma \mathcal {G}</mml:annotation> </mml:semantics> </mml:math> </inline-formula> is infinite dihedral or <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="normal upper A normal u normal t left-parenthesis normal upper Gamma script upper G right-parenthesis"> <mml:semantics> <mml:mrow> <mml:mrow class="MJX-TeXAtom-ORD"> <mml:mi mathvariant="normal">A</mml:mi> <mml:mi mathvariant="normal">u</mml:mi> <mml:mi mathvariant="normal">t</mml:mi> </mml:mrow> <mml:mo stretchy="false">(</mml:mo> <mml:mi mathvariant="normal">Γ</mml:mi> <mml:mrow class="MJX-TeXAtom-ORD"> <mml:mi class="MJX-tex-caligraphic" mathvariant="script">G</mml:mi> </mml:mrow> <mml:mo stretchy="false">)</mml:mo> </mml:mrow> <mml:annotation encoding="application/x-tex">\mathrm {Aut}(\Gamma \mathcal {G})</mml:annotation> </mml:semantics> </mml:math> </inline-formula> 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.

Authors

Publication Details

Journal
Memoirs of the American Mathematical Society
Published
2024-09-01
DOI
https://doi.org/10.1090/memo/1509
Citations
13
Primary Topic
Geometric and Algebraic Topology
Type
article
Field-Weighted Citation Impact
4.05
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Automorphisms of Graph Products of Groups and Acylindrical Hyperbolicity

Anthony Genevois
13 citations
Memoirs of the American Mathematical Society
Geometric and Algebraic Topology
4.05
article

Automorphisms of Graph Products of Groups and Acylindrical Hyperbolicity

Anthony Genevois
article en
13 citations

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 <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="normal upper Gamma"> <mml:semantics> <mml:mi mathvariant="normal">Γ</mml:mi> <mml:annotation encoding="application/x-tex">\Gamma</mml:annotation> </mml:semantics> </mml:math> </inline-formula> is a finite graph which contains at least two vertices and is not a join and if <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="script upper G"> <mml:semantics> <mml:mrow class="MJX-TeXAtom-ORD"> <mml:mi class="MJX-tex-caligraphic" mathvariant="script">G</mml:mi> </mml:mrow> <mml:annotation encoding="application/x-tex">\mathcal {G}</mml:annotation> </mml:semantics> </mml:math> </inline-formula> is a collection of finitely generated irreducible groups, then either <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="normal upper Gamma script upper G"> <mml:semantics> <mml:mrow> <mml:mi mathvariant="normal">Γ</mml:mi> <mml:mrow class="MJX-TeXAtom-ORD"> <mml:mi class="MJX-tex-caligraphic" mathvariant="script">G</mml:mi> </mml:mrow> </mml:mrow> <mml:annotation encoding="application/x-tex">\Gamma \mathcal {G}</mml:annotation> </mml:semantics> </mml:math> </inline-formula> is infinite dihedral or <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="normal upper A normal u normal t left-parenthesis normal upper Gamma script upper G right-parenthesis"> <mml:semantics> <mml:mrow> <mml:mrow class="MJX-TeXAtom-ORD"> <mml:mi mathvariant="normal">A</mml:mi> <mml:mi mathvariant="normal">u</mml:mi> <mml:mi mathvariant="normal">t</mml:mi> </mml:mrow> <mml:mo stretchy="false">(</mml:mo> <mml:mi mathvariant="normal">Γ</mml:mi> <mml:mrow class="MJX-TeXAtom-ORD"> <mml:mi class="MJX-tex-caligraphic" mathvariant="script">G</mml:mi> </mml:mrow> <mml:mo stretchy="false">)</mml:mo> </mml:mrow> <mml:annotation encoding="application/x-tex">\mathrm {Aut}(\Gamma \mathcal {G})</mml:annotation> </mml:semantics> </mml:math> </inline-formula> 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.

Memoirs of the American Mathematical SocietyVol. 301(1509)
Openalex Percentile: Top 8%
Geometric and Algebraic Topology
4.05
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.