The third commutant membership problem in solvable groups (Q1288228)

From MaRDI portal
Revision as of 12:15, 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
The third commutant membership problem in solvable groups
scientific article

    Statements

    The third commutant membership problem in solvable groups (English)
    0 references
    0 references
    0 references
    11 May 1999
    0 references
    It is known that, for every finitely generated and recursively defined group, the second commutant membership problem is solvable [see \textit{I. V. Latkin}, Sib. Mat. Zh. 28, No. 5(165), 102-110 (1987; Zbl 0654.03027)]. In the article under review, the following theorem is proven: There is a finitely presented solvable group of derived length 4 for which the word problem is solvable and the third commutant membership problem is unsolvable.
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    finitely presented solvable groups
    0 references
    occurrence problem
    0 references
    Minsky machine
    0 references
    solvable word problem
    0 references
    0 references