No label defined (Q3342744)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 3875526
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 3875526 |
Statements
1984
0 references
finitely presented groups
0 references
survey
0 references
algorithmic problems
0 references
varieties of solvable groups
0 references
solvable word problem
0 references
finitely generated groups
0 references
Higman's embedding theorem
0 references
center-by-metabelian groups
0 references
simple groups
0 references
0.94364846
0 references
0.94319916
0 references
0.9393458
0 references
0.9333317
0 references
0.93143976
0 references
0.92621464
0 references
0.92268944
0 references
0.9224042
0 references
[For the entire collection see Zbl 0542.00008.] This is a survey, without proofs, on algorithmic problems for finitely presented (f.p.) groups, concentrating on three basic themes: a) the search for analogues of Higman's embedding theorem in certain varieties of solvable groups, b) the question of whether an f.p. solvable group of a certain type has solvable word problem, c) an algebraic characterisation of finitely generated groups with solvable word problem. a) After general considerations the author concludes that a ''right'' analogue of Higman's embedding theorem for varieties should be a characterization of finitely generated subgroups of the f.p. groups of the variety. Such a characterization for the variety C of center-by- metabelian groups was given by \textit{R. Strebel} [J. Lond. Math. Soc., II. Ser. 28, 481-491 (1983; Zbl 0496.20019)]: a necessary and sufficient condition that an f.g. group be embeddable in an f.p. center-by- metabelian group is that it be abelian-by-polycyclic. After discussing examples due to R. Strebel, the author concludes, that the conjectured Higman embedding theorem for the \(N_ 2A\)-variety has the following form: Conjecture. A necessary and sufficient condition for an f.g. group G to be embeddable in an f.p. nilpotent of class 2 by abelian group is that (i) G is residually finite, (ii) G has solvable word problem, (iii) G'' is of bounded torsion. b) As far as the word problem for solvable groups is concerned the author's opinion is that ''... what remains now to be done in this subject includes the determination of the precise boundary where solvable word problem passes into the unsolvable.'' The second concrete problem appears to him to be the most interesting in this area: Problem 1. Does an f.p. \(N_ 2A\)-group necessarily have solvable word problem? Problem 2. Does an f.p. solvable group with max-n necessarily have solvable word problem? c) The author formulates problems 3 and 4 of Higman. Is the class of f.p. simple groups recursively enumerable? Is a necessary and sufficient condition for an f.g. group G to have solvable word problem that there exist an f.g., f.p. simple group H, containing G as a subgroup? The author's observation is that a positive solution to problem 3 implies a positive solution to problem 4. Thus, the problems are not independent, as formely believed.
0 references