Helly meets Garside and Artin (Q2049897)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Helly meets Garside and Artin
scientific article

    Statements

    Helly meets Garside and Artin (English)
    0 references
    0 references
    0 references
    27 August 2021
    0 references
    A graph is Helly if every family of pairwise intersecting combinatorial balls has a nonempty intersection. A group is a Helly group if it admits a geometrical (i.e.\ proper and cocompact) action on a Helly graph. If \(G\) acts geometrically on a Helly graph \(\Gamma\), then it also acts geometrically on the injective hull of the set of vertices of \(\Gamma\). The latter admits a unique convex geodesic bicombing. As a consequence, Helly groups satisfy several important properties. In particular, they admit EZ- and Tits boundaries, the Farrell-Jones and the coarse Baum-Connes conjecture hold for these groups and the higher-order homological and homotopical Dehn functions are Euclidean. Helly groups are also known to be biautomatic. Details and references for these properties are summarized by the authors in Subsection 1.3. More details on Helly groups can also be found in [\textit{J. Chalopin} et al., ``Helly groups'', Preprint, \url{arXiv:2002.06895}]. As their main theorem, the authors show that weak Garside groups of finite type and FC-type Artin groups are Helly groups. For this, the authors introduce the notion of a (generalized) cell Helly complex. In particular, weak Garside groups of finite type and FC-type Artin groups have the above mentioned properties.
    0 references
    Artin groups
    0 references
    nonpositively curved groups
    0 references
    Helly groups
    0 references
    Farrell-Jones conjecture
    0 references
    Baum-Connes conjecture
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

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