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 Γ is a finite graph and G = {Gu | u ∈ V (Γ)} a collection of finitely generated groups indexed by the vertices of Γ, then maxfor every n ≥ 1, where D denotes the maximal diameter of a connected component of the opposite graph Γ opp . As a consequence, a graph product of groups with linear conjugacy length functions has linear conjugacy length function as well.

Morphisms between right-angled Coxeter groups and the embedding problem in dimension two

“…For more details, we refer to [Gre90] (see also [Gen19]) where the normal form is proved in a more general setting.…”

Special cube complexes revisited: a quasi-median generalisation

“…Every element of ΓG can be represented by a graphically reduced word, and this word is unique up to the shuffling operation. This allows us to define the length of an element g ∈ ΓG, denoted by |g|, as the length of any graphically reduced word representing g. For more information on graphically reduced words, we refer to [Gre90] (see also [HW99,Gen19b]).…”

Embeddings into Thompson's groups from quasi-median geometry

“…Every element of ΓG can be represented by a reduced word, and this word is unique up to the shuffling operation. This allows us to define the length of an element g ∈ ΓG as the length of any reduced word representing g; and its support, denoted by supp(g), as the set of vertices of Γ which corresponds exactly to the vertex-groups containing the syllables of g. For more information, we refer to [Gre90] (see also [HW99,Gen19]). The following definition will also be useful:…”