SearcharxivSearch

arXiv · 1110.2708

Generalising some results about right-angled Artin groups to graph products of groups

Abstract

We prove three results about the graph product $G=\G(Γ;G_v, v \in V(Γ))$ of groups $G_v$ over a graph $Γ$. The first result generalises a result of Servatius, Droms and Servatius, proved by them for right-angled Artin groups; we prove a necessary and sufficient condition on a finite graph $Γ$ for the kernel of the map from $G$ to the associated direct product to be free (one part of this result already follows from a result in S. Kim's Ph.D. thesis). The second result generalises a result of Hermiller and Sunic, again from right-angled Artin groups; we prove that for a graph $Γ$ with finite chromatic number, $G$ has a series in which every factor is a free product of vertex groups. The third result provides an alternative proof of a theorem due to Meier, which provides necessary and sufficient conditions on a finite graph $Γ$ for $G$ to be hyperbolic.

Explore related subjects

Keep this discovery

BibTeXRIS

Derek F. Holt, Sarah Rees. 2011-10-25. Generalising some results about right-angled Artin groups to graph products of groups. https://arxiv.org/abs/1110.2708

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