When is the graph product of hyperbolic groups hyperbolic?
β Scribed by John Meier
- Publisher
- Springer
- Year
- 1996
- Tongue
- English
- Weight
- 771 KB
- Volume
- 61
- Category
- Article
- ISSN
- 0046-5755
No coin nor oath required. For personal study only.
β¦ Synopsis
Given a finite simplicial graph G, and an assignment of groups to the vertices of if, the graph product is the free product of the vertex groups modulo relations implying that adjacent vertex groups commute. We use Gromov's link criteria for cubical complexes and techniques of Davis and Moussang to study the curvature of graph products of groups. By constructing a CAT(-1) cubical complex, it is shown that the graph product of word hyperbolic groups is itself word hyperbolic if and only if the full subgraph ~a in G, generated by vertices whose associated groups are finite, satisfies three specific criteria. The construction shows that arbitrary graph products of finite groups are Bridson groups.
π SIMILAR VOLUMES
We show that plane hyperbolic geometry, expressed in terms of points and the ternary relation of collinearity alone, cannot be expressed by means of axioms of complexity at most βββ, but that there is an axiom system, all of whose axioms are ββββ sentences. This remains true for Klingenberg's genera
We show that every word-hyperbolic group is residually finite if and only if every word-hyperbolic group has a finite quotient.
We prove at Theorem 1 that any non-elementary hyperbolic group G possesses a non-trivial finitely presented quotient Q having no non-trivial subgroups of finite indices. The theorem was ''commissioned'' in August 1997 by H. Bass and A. Lubotzky because the statement was required to constructing of t