On number of ends of graph products of groups

preprint2020arXivOpen access

Abstract

Given a finite simplicial graph Γ=(V,E)Γ=(V,E) with a vertex-labelling φ:V→{non-trivial finitely generated groups}φ:V\rightarrow\left\{\text{non-trivial finitely generated groups}\right\}, the graph product GΓG_Γ is the free product of the vertex groups φ(v)φ(v) with added relations that imply elements of adjacent vertex groups commute. For a quasi-isometric invariant P\mathcal{P}, we are interested in understanding under which combinatorial conditions on the graph ΓΓ the graph product GΓG_Γ has property P\mathcal{P}. In this article our emphasis is on number of ends of a graph product GΓG_Γ. In particular, we obtain a complete characterization of number of ends of a graph product of finitely generated groups.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.