On the finite approximability of equations in finitely generated nilpotent groups (Q1191217)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On the finite approximability of equations in finitely generated nilpotent groups |
scientific article; zbMATH DE number 59454
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the finite approximability of equations in finitely generated nilpotent groups |
scientific article; zbMATH DE number 59454 |
Statements
On the finite approximability of equations in finitely generated nilpotent groups (English)
0 references
27 September 1992
0 references
Let \(G\) be a finitely generated nilpotent group, \(a\) an arbitrary element of \(G\), and \(w\) a word in \(x_ 1,\dots,x_ n\) which does not belong to the commutator subgroup of the free group generated by \(x_ 1,\dots,x_ n\). The author proves that if \(w(x_ 1,\dots,x_ n) = a\) has no solution in \(G\), then there exists an epimorphism \(\varphi: G \to K\) onto a finite group \(K\) such that the equation \(w(x_ 1,\dots,x_ n) = \varphi(a)\) has no solution in \(K\) either. Based on this, an algorithm for deciding whether \(w(x_ 1,\dots,x_ n) = a\) can be solved in \(G\) is presented. On the other hand, a result of N. N. Repin is quoted, showing that no such algorithm exists without restrictions on the word \(w\).
0 references
algorithm for solving equations in groups
0 references
finitely generated nilpotent group
0 references
epimorphism
0 references