scientific article; zbMATH DE number 3875526
[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.
- scientific article; zbMATH DE number 3875527
- Algorithmically insoluble problems about finitely presented solvable groups, Lie and associative algebras. II
- Algorithmically insoluble problems about finitely presented solvable groups, Lie and associative algebras. I
- Algorithmically insoluble problems about finitely presented solvable groups, Lie and associative algebras. III
- Algorithmic problems for finite groups and finite semigroups
- Algorithmic problems for finite groups and finite \(0\)-simple semigroups
- scientific article; zbMATH DE number 3170376
- Some Algorithmic Problems for Lie Algebras
- Algorithms for finitely L-presented groups and their applications to some self-similar groups.
- On some algorithmic problems for groups and monoids
- Some remarks on the group variety \(N_ 2A\)
- Algorithmic problems in groups and semigroups. Based on talks given at the international conference, Lincoln, NE, USA, May 11--May 16, 1998
- Two problems for solvable and nilpotent groups
- scientific article; zbMATH DE number 3884377 (Why is no real title available?)
- scientific article; zbMATH DE number 3875527 (Why is no real title available?)
- SUBGROUPS OF FINITELY PRESENTED GROUPS WITH SOLVABLE CONJUGACY PROBLEM
- scientific article; zbMATH DE number 3948587 (Why is no real title available?)
- scientific article; zbMATH DE number 495579 (Why is no real title available?)
- scientific article; zbMATH DE number 1534357 (Why is no real title available?)
- The conjugacy problem and Higman embeddings
- Some Algorithmic Problems for Lie Algebras
- Algorithmic and asymptotic properties of groups.
- Finding non-trivial elements and splittings in groups.
- Obstruction to a Higman embedding theorem for residually finite groups with solvable word problem
- Embeddings in finitely presented groups which preserve the center.
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3342744)