Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 0910.4886

The automorphism group of a graph product with no SIL

Ruth Charney·Kim Ruane·Nathaniel Stambaugh·Anna Vijayan
View original source ↗Read source document ↗Export metadata ↓

Abstract

We study the automorphisms of graph products of cyclic groups, a class of groups that includes all right-angled Coxeter and right-angled Artin groups. We show that the group of automorphism generated by partial conjugations is itself a graph product of cyclic groups providing its defining graph does not contain any separating intersection of links (SIL). In the case that all the cyclic groups are finite, this implies that the automorphism group is virtually CAT(0); it has a finite index subgroup which acts geometrically on a right-angled building.

Explore related subjects

math.GR

Keep this discovery

BibTeXRIS

Ruth Charney, Kim Ruane, Nathaniel Stambaugh, Anna Vijayan. 2009-10-26. The automorphism group of a graph product with no SIL. https://arxiv.org/abs/0910.4886

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

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↗
arXiv2026

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↗
arXiv2026

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↗