Search arXivSearch

arXiv · 1901.04538

On the geometry of van Kampen diagrams of graph products of groups

Abstract

In this article, we propose a geometric framework dedicated to the study of van Kampen diagrams of graph products of groups. As an application, we find information on the word and the conjugacy problems. The main new result of the paper deals with the computation of conjugacy length functions. More precisely, if $\Gamma$ is a finite graph and $\mathcal{G}= \{ G_u \mid u \in V(\Gamma) \}$ a collection of finitely generated groups indexed by the vertices of $\Gamma$, then $$\max\limits_{u \in V(\Gamma)} \mathrm{CLF}_{G_u}(n) \leq \mathrm{CLF}_{\Gamma \mathcal{G}}(n) \leq (D+1) \cdot n + \max\limits_{\Delta \subset \Gamma \ \text{complete}} \sum\limits_{u \in V(\Delta)} \mathrm{CLF}_{G_u}(n)$$ for every $n \geq 1$, where $D$ denotes the maximal diameter of a connected component of the opposite graph $\Gamma^{\mathrm{opp}}$. As a consequence, a graph product of groups with linear conjugacy length functions has linear conjugacy length function as well.

Explore related subjects

Keep this discovery

BibTeXRIS

Anthony Genevois. 2019-01-14. On the geometry of van Kampen diagrams of graph products of groups. https://arxiv.org/abs/1901.04538

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