Undecidability of the submonoid membership problem for free nilpotent group of class $l\geqslant 2$ of sufficiently large rank
From MaRDI portal
Publication:6085106
DOI10.4213/im9342eOpenAlexW4387757270MaRDI QIDQ6085106
No author found.
Publication date: 2 December 2023
Published in: Izvestiya: Mathematics (Search for Journal in Brave)
Full work available at URL: http://mathnet.ru/eng/im9342
nilpotent groupHilbert's tenth problemsubmonoid membership probleminterpretability of equations in groups
Solvable groups, supersolvable groups (20F16) Generators, relations, and presentations of groups (20F05) Nilpotent groups (20F18)
Cites Work
- Tilings and submonoids of metabelian groups.
- Group-based cryptography
- Model-theoretic and algorithmic questions in group theory
- Infinite groups
- Two problems for solvable and nilpotent groups
- Rational sets in commutative monoids
- Positive elements and sufficient conditions for solvability of the submonoid membership problem for nilpotent groups of class two
- The rational subset membership problem for groups: a survey
- Undecidable diophantine equations
- Reduction of an arbitrary diophantine equation to one in 13 unknowns
- POLYCYCLIC, METABELIAN OR SOLUBLE OF TYPE (FP)∞ GROUPS WITH BOOLEAN ALGEBRA OF RATIONAL SETS AND BIAUTOMATIC SOLUBLE GROUPS ARE VIRTUALLY ABELIAN
- On homomorphisms onto finite groups
- Complexity and Randomness in Group Theory
- DIOPHANTINE REPRESENTATION OF ENUMERABLE PREDICATES
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Undecidability of the submonoid membership problem for free nilpotent group of class $l\geqslant 2$ of sufficiently large rank