Acylindrical Hyperbolicity and Pure Conjugating Automorphisms in Graph Products of Groups
Abstract
We study graph products of groups over defining graphs of arbitrary cardinality from two closely related viewpoints. First, we characterize acylindrical hyperbolicity. If the defining graph is irreducible, has at least two vertices, and has a finite star base, then every parabolically full subgroup is either virtually cyclic or acylindrically hyperbolic. For vertex-full subgroups the finite star base condition is also necessary. In particular, the graph product itself is acylindrically hyperbolic exactly when the graph has a finite star base and the group is not virtually cyclic, or equivalently is not the infinite dihedral group. We also give the corresponding classification for reducible defining graphs. Second, motivated by our earlier work on countable right-angled Coxeter groups, we study pure conjugating automorphisms in the topology of pointwise convergence. We prove that they are topologically generated by finite-support factorwise automorphisms and partial conjugations, and establish closedness, density, exact-equality, and discreteness results. The same finite star base condition that appears in the acylindrical hyperbolicity criterion governs closedness and discreteness in the star-connected case; for arbitrary graphs, its natural refinement is the existence of a finite component witness set. Finally, for graph products of abelian groups we obtain a canonical topological semidirect decomposition of the pure conjugating automorphism group.
Related
- ℓ2-Betti numbers and Σ-invariants of graph products of cyclic groups and their automorphisms
- Hyperbolicity and fundamental groups of complex quasi-projective varieties (III): applications
- Sharp Gromov Hyperbolicity Constants for Cartesian Products of Finitely Many Trees
- On the word and period growth of some groups of tree automorphisms
- On κ-existentially closed groups with few automorphisms
BibTeX
@misc{paolini2026acylindrical,
title = {{Acylindrical Hyperbolicity and Pure Conjugating Automorphisms in Graph Products of Groups}},
author = {Gianluca Paolini and Jean-Luc Rabideau},
howpublished = {arXiv},
year = {2026},
month = sep,
doi = {10.48550/arxiv.2609.01837},
eprint = {2609.01837},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2609.01837},
}
RIS
TY - UNPB
TI - Acylindrical Hyperbolicity and Pure Conjugating Automorphisms in Graph Products of Groups
AU - Gianluca Paolini
AU - Jean-Luc Rabideau
PY - 2026
DA - 2026/09/01
PB - arXiv
DO - 10.48550/arxiv.2609.01837
UR - https://arxiv.org/abs/2609.01837
AB - We study graph products of groups over defining graphs of arbitrary cardinality from two closely related viewpoints. First, we characterize acylindrical hyperbolicity. If the defining graph is irreducible, has at least two vertices, and has a finite star base, then every parabolically full subgroup is either virtually cyclic or acylindrically hyperbolic. For vertex-full subgroups the finite star base condition is also necessary. In particular, the graph product itself is acylindrically hyperbolic exactly when the graph has a finite star base and the group is not virtually cyclic, or equivalently is not the infinite dihedral group. We also give the corresponding classification for reducible defining graphs. Second, motivated by our earlier work on countable right-angled Coxeter groups, we study pure conjugating automorphisms in the topology of pointwise convergence. We prove that they are topologically generated by finite-support factorwise automorphisms and partial conjugations, and establish closedness, density, exact-equality, and discreteness results. The same finite star base condition that appears in the acylindrical hyperbolicity criterion governs closedness and discreteness in the star-connected case; for arbitrary graphs, its natural refinement is the existence of a finite component witness set. Finally, for graph products of abelian groups we obtain a canonical topological semidirect decomposition of the pure conjugating automorphism group.
ER -