Rescuing the Whitehead method for free products. II: The algorithm (Q795164)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Rescuing the Whitehead method for free products. II: The algorithm
scientific article

    Statements

    Rescuing the Whitehead method for free products. II: The algorithm (English)
    0 references
    0 references
    0 references
    1984
    0 references
    The authors continue their study of adapting the Whitehead method on the free products of groups begun in a previous paper [Part I, ibid. 185, 487-504 (1984; Zbl 0537.20010)]. In the present paper they use their theorem to describe, under some assumptions on the factors and some additional argument, an algorithm to decide whether two elements of the free product belong to the same automorphism class. They again consider free products of finitely many (freely) indecomposable factors and distinguish two cases, the first being the case where none of the factors is infinite cyclic and the second the general case. Finally they give some examples and applications of their method.
    0 references
    Whitehead automorphism
    0 references
    algorithm
    0 references
    automorphism class
    0 references
    free products
    0 references
    indecomposable factors
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references