Equations with one unknown in nilpotent groups

DOI10.1007/BF01141772MaRDI QIDQ791648zbMATH OpenFDO

Authors N. N. Repin

Publication date 1984

Published in Mathematical Notes (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BF01141772

zbMATH Keywords

coefficient-free equationsfinitely generated nilpotent groupfinitely presented nilpotent groupfree nilpotent groupsolvability of equations

Mathematics Subject Classification ID

Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10) Nilpotent groups (20F18)

Review text

In [Algebra Logika 16, 457-471 (1977; Zbl 0411.20021)] the reviewer proved that the solution problem for the coefficient-free equations \(f(x_ 1,x_ 2,...,x_ n)=g\) in the free nilpotent group F of class \(\ell \geq 9\) is unsolvable. The question studied by the author is that of solving equations with one unknown in a finitely generated nilpotent group. He proves: Theorem. There exists a finitely presented nilpotent group G for which the problem of recognizing the solvability of equations with one unknown is undecidable. The proof of this theorem, like that of the above-mentioned result of the reviewer is based on a simulation of Diophantine equations in a nilpotent group. At the IX. All-Union Symp. group theory, Moscow (1984), the author announced the following results: the group G in Theorem may be chosen of class 3 or may be chosen as free nilpotent group of class \(\ell \geq 10^{20}\).

Recommendations

• scientific article; zbMATH DE number 3901023
• Equations in nilpotent groups.
• Diophantine questions in the class of finitely generated nilpotent groups
• scientific article; zbMATH DE number 4097637
• Equation-Solving in Free Nilpotent groups Class 2 and 3

Cites work

• Undecidable diophantine equations

Cited in

(18)

• Solutions of equations over -nilpotent groups
• On the finite approximability of equations in finitely generated nilpotent groups
• Full rank presentations and nilpotent groups: structure, Diophantine problem, and genericity
• On solvability of equations with endomorphisms in nilpotent groups
• Solvability of independent systems of equations in finitely generated nilpotent groups
• Diophantine questions in the class of finitely generated nilpotent groups
• Equations in nilpotent groups.
• scientific article; zbMATH DE number 3901023 (Why is no real title available?)
• The Undecidability of the Unification Problem for Nilpotent Groups of Class ⩾ 5
• Unification in Varieties of Groups: Nilpotent Varieties
• scientific article; zbMATH DE number 2112655 (Why is no real title available?)
• Diophantine problems in solvable groups
• Recognizing powers in nilpotent groups and nilpotent images of free groups
• On the solutions of equations over nilpotent groups of class 2.
• Undecidability of the submonoid membership problem for free nilpotent group of class l\geqslant 2 of sufficiently large rank
• Post's correspondence problem: from computer science to algebra
• Post's Correspondence Problem for hyperbolic and virtually nilpotent groups
• Equations in virtually class \(2\) nilpotent groups

This page was built for publication: Equations with one unknown in nilpotent groups

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q791648)