No label defined (Q3342745)
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 3875527
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 3875527 |
Statements
1984
0 references
finitely presented solvable groups
0 references
solvable Lie algebras
0 references
generators
0 references
isomorphism problem
0 references
derived length
0 references
direct decomposibility
0 references
Minsky machine
0 references
conjugacy problem
0 references
finite presentations
0 references
integral homology group
0 references
0.917102873325348
0 references
0.902945637702942
0 references
0.8951605558395386
0 references
[This article was pulished in the book announced in this Zbl 0542.00008.] The author's objective is to report on some as yet unpublished joint work of D. Gildenhuys, R. Strebel and himself concerned with a variety of algorithmically insoluble problems about finitely presented solvable groups, finitely presented (f.p.) solvable Lie algebras and f.p. associative algebras satisfying a polynomial identity. The starting point is the following main theorem. Theorem 2 (Baumslag, Gildenhuys and Strebel). There exists an f.p. solvable group U, of derived length 3, with the following properties: (i) there is a recursive set \(w_ 1,w_ 2,...\), of words in the given generators of U such that there is no algorithm whereby one can decide whether or not any of these words takes the value 1 in U; (ii) each of these words \(w_ 1,w_ 2,..\). represents an element in the center of U. A number of remarkable applications of the main theorem are formulated. Among them is the negative solution of the isomorphism problem for f.p. solvable groups, the impossibility of an algorithmic determination of the derived length of an f.p. solvable group, unrecognizability of direct decomposibility of an f.p. solvable group. The proof of the main theorem is based on \textit{O. G. Kharlampovich's} idea [Izv. Akad. Nauk SSSR, Ser. Mat. 45, 852-873 (1981; Zbl 0485.20023)] to imprint the working of a so- called Minsky machine onto an f.p. solvable group. The main difference between Kharlampovich's group and that of theorem 2, on the face of it, is condition (ii). In fact it is precisely on this condition that the proof of most of the applications of Theorem 2 depends. The author gives a sketch of the proof of the main theorem and discusses four problems which are unsolved: 1. Is there an f.p. solvable group with soluble word problem and insoluble conjugacy problem? 2. Is the set of all finite presentations of all f.p. solvable groups a recursively enumerable subset of the set of all finite presentations? 3. Let G be an f.p. metabelian group, \(n>1\) a positive integer and let \(H_ nG\) denote the n-dimensional integral homology group of G. Does \(H_ nG\) have a presentation with soluble word problem? 4. Can every abelian group with a recursively enumerable presentation be the center of an f.p. (solvable) group? - The approach above can be mimicried for Lie algebras and for associative algebras satisfying a polynomial identity. Reviewer's remark: A positive anwer to problem 3 for \(n=2\) is given by \textit{G. A. Noskov} [Computation of the Schur multiplicator of a finitely generated metabelian group. Preprint 508, Vychisl. center Sib. Otdel. Akad. Nauk, Novosibirsk (1984)]
0 references