Diophantine questions in the class of finitely generated nilpotent groups
DOI10.1515/JGTH-2016-0504zbMATH Open1361.20025OpenAlexW2325273846MaRDI QIDQ285579FDOQ285579
Authors: Vitaliĭ Roman'kov Fehler beim Erstellen des Vorschaubildes:
Publication date: 19 May 2016
Published in: Journal of Group Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1515/jgth-2016-0504
Recommendations
Decidability of theories and sets of sentences (03B25) Mechanization of proofs and logical operations (03B35) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10) Nilpotent groups (20F18) Algebraic geometry over groups; equations over groups (20F70)
Cites Work
- Model-theoretic and algorithmic questions in group theory
- An algorithmic problem for nilpotent groups and rings
- Unsolvability of the endomorphic reducibility problem in free nilpotent groups and in free rings
- Equations over groups.
- Title not available (Why is that?)
- Title not available (Why is that?)
- Reduction of an arbitrary diophantine equation to one in 13 unknowns
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Equations in free metabelian groups
Cited In (16)
- Solvability of equations in classes of solvable groups and Lie algebras
- Quadratic equations in the Grigorchuk group.
- Low-complexity computations for nilpotent subgroup problems
- Equations in virtually class \(2\) nilpotent groups
- The Undecidability of the Unification Problem for Nilpotent Groups of Class ⩾ 5
- Full rank presentations and nilpotent groups: structure, Diophantine problem, and genericity
- Orientable quadratic equations in free metabelian groups
- Algebraically and verbally closed subgroups and retracts of finitely generated nilpotent groups
- Undecidability of the submonoid membership problem for free nilpotent group of class $l\geqslant 2$ of sufficiently large rank
- Post's Correspondence Problem for hyperbolic and virtually nilpotent groups
- Random nilpotent groups, polycyclic presentations, and Diophantine problems
- Solvability of independent systems of equations in finitely generated nilpotent groups
- Equations with one unknown in nilpotent groups
- The Diophantine problem in the classical matrix groups
- Post's correspondence problem: from computer science to algebra
- Diophantine problems in solvable groups
This page was built for publication: Diophantine questions in the class of finitely generated nilpotent groups
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q285579)
