Redundant relators in cyclic presentations of groups (Q6082367)

From MaRDI portal
scientific article; zbMATH DE number 7761122
Language Label Description Also known as
English
Redundant relators in cyclic presentations of groups
scientific article; zbMATH DE number 7761122

    Statements

    Redundant relators in cyclic presentations of groups (English)
    0 references
    0 references
    0 references
    0 references
    6 November 2023
    0 references
    A presentation of a group \(G\) is said to be redundant if it contains a freely redundant relator, that is, if it has a relator that is either freely trivial or that is freely conjugate to another relator or to the inverse of another relator. A presentation with no freely redundant relators is called concise and a concise presentation obtained by removing freely redundant relators from a presentation is called a concise refinement of that presentation. A cyclic presentation is a presentation with an equal number of generators and relators that admits a particular cyclic symmetry, and the corresponding group is called a cyclically presented group (for an overview see the book of \textit{D. L. Johnson}, [Presentations of groups. 2nd ed. Cambridge: Cambridge University Press (1997; Zbl 0906.20019)]). In the paper under review, the authors classify the redundant cyclic presentations and they show that the class of groups defined by such presentations satisfies the Tits alternative. A cyclic presentation is \((m,k,\nu)\)-special if it has length \(k\) relators, where the star graph has \(\nu\) isomorphic components, each of which is the incidence graph of a generalised \(m\)-gon. Another task that the authors complete in this paper is the classification of the redundant and concise \((m, k, \nu)\)-special cyclic presentations.
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    presentation
    0 references
    redundant relator
    0 references
    cyclic presentation
    0 references
    Tits alternative
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references