Skip to content
Preprint

Acylindrical Hyperbolicity and Pure Conjugating Automorphisms in Graph Products of Groups

Sep 2026 · 0 citations · 26 references
Mathematics

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.

View source

Similar papers

Preprint Aug 2026

Finite groups that are the product of every pair of non-conjugate maximal subgroups are soluble

We prove that every finite group that is the product of every pair of its non-conjugate maximal subgroups is soluble, answering Problem 10.34 of the Kourovka Notebook. The almost-simple case was proved by Tikhonenko and Tyutyanov. We treat the remaining minimal-counterexample branch, where the unique minimal normal sub...

Richie Sater · 0 citations
Preprint Aug 2026

Hyperbolicity and obstructions to PL actions of the circle

We investigate acylindrically hyperbolic groups acting on the circle by piecewise linear homeomorphisms. We prove that a finitely generated acylindrically hyperbolic group acting faithfully by piecewise linear homeomorphisms of the circle is virtually free, is virtually a closed hyperbolic surface group, or virtually s...

Leonardo Dinamarca, Maximiliano Escayola, Sang-hyun Kim et al. · 1 citation
Open access Aug 2026

The infinite-dimensional geometry of conjugation-invariant generating sets

We consider a number of examples of groups together with an infinite conjugation-invariant generating set, including the free group with the generating set of all separable elements, surface groups with the generating set of all non-filling curves, mapping class groups and outer automorphism groups of free groups wit...

Sabine Chu, G. Domat, Christine Gao et al. · 0 citations
Preprint Sep 2026

Incidence complexes realization and profinite Rigidity

We prove realization theorems for marked profinite groups by means of divisible fillings and completed cellular-incidence complexes. For a nonseparating curve on a closed surface, the divisible curve-power quotients realize the closure of the cut-surface subgroup as an exact intersection and determine the full profinit...

Yong Hou · 0 citations
Preprint Sep 2026

Automorphism groups of Cayley graphs on almost simple groups with normal connection sets

We determine the full automorphism group of every connected Cayley graph on an almost simple group with a normal connection set. We also characterize exactly when the full automorphism group is generated by right translations, group automorphisms preserving the connection set, and inversion. Our results substantially g...

Meng-Yue Cao, Ben-Jian Lv, Bin-Zhou Xia · 0 citations
Preprint Aug 2026

Gromov Hyperbolicity of Substitution graphs

In this paper, we construct a class of infinite graphs, called substitution graphs. The vertex set consists of all finite words over a finite alphabet. A directed graph is formed by adding vertical edges connecting each word to its children and horizontal edges defined recursively by two finite directed graphs G and J:...

Qing-Cheng Zeng, Cheng Zeng, Yu-Mei Xue et al. · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.