When is the graph product of hyperbolic groups hyperbolic? (Q1914049)

From MaRDI portal
Revision as of 09:11, 30 July 2024 by Openalex240730090724 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
When is the graph product of hyperbolic groups hyperbolic?
scientific article

    Statements

    When is the graph product of hyperbolic groups hyperbolic? (English)
    0 references
    0 references
    24 September 1997
    0 references
    Given a finite simplicial graph \({\mathcal G}\) and a group \(G_v\) assigned to each vertex \(v\), the graph product \(G{\mathcal G}\) is the free product of the vertex groups with added relations that imply elements of adjacent vertex groups commute. Given a vertex \(v\) of \(\mathcal G\), the link graph of \(v\), denoted by \({\mathcal L}_v\), is the subgraph of \(\mathcal G\) generated by the vertices of \(\mathcal G\) adjacent to \(v\). The author proves the following Theorem: Let \({\mathcal G}\) be a simplicial graph with word hyperbolic groups assigned to its vertices. Let \({\mathcal F}_{\mathcal G}\) be the full subgraph of \(\mathcal G\) generated by the vertices associated with finite groups. Then, the graph product \(G{\mathcal G}\) is word hyperbolic if and only if the following three conditions hold: (i) the full subgraph generated by the vertices in \({\mathcal G}-{\mathcal F}_{\mathcal G}\) is a null-graph; (ii) for \(v\in{\mathcal G}-{\mathcal F}_{\mathcal G}\), \({\mathcal L}_v\) is a complete graph; (iii) every circuit in \({\mathcal F}_{\mathcal G}\) of length four contains a chord. The main point in the proof involves the construction of a \(\text{CAT}(-1)\) cubical complex admitting a discrete, cocompact action of \(G{\mathcal F}_{\mathcal G}\).
    0 references
    Gromov-hyperbolic groups
    0 references
    word hyperbolic groups
    0 references
    cubical complexes
    0 references
    hyperbolization
    0 references
    graph products
    0 references
    Bridson groups
    0 references
    finite simplicial graphs
    0 references
    free products
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references