Abstract
Given a finite simplicial graph ℊ, and an assignment of groups to the verticles of ℊ, 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 ℱℊ in ℊ, 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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
