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 u ∈ V() CLFGu(n) ≤ CLF G(n) ≤ (D+1) · n + ⊂ \ complete Σu ∈ V() CLFGu(n) for 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.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.