Positive elements and sufficient conditions for solvability of the submonoid membership problem for nilpotent groups of class two

DOI10.33048/semi.2022.19.034MaRDI QIDQ2676823

Vitaliĭ Roman'kov

Publication date: 28 September 2022

Published in: Sibirskie Èlektronnye Matematicheskie Izvestiya (Search for Journal in Brave)

Mathematics Subject Classification ID

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

Related Items

Undecidability of the submonoid membership problem for free nilpotent group of class $l\geqslant 2$ of sufficiently large rank

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Tilings and submonoids of metabelian groups.
• Recursive unsolvability of group theoretic problems
• Group-based cryptography
• Model-theoretic and algorithmic questions in group theory
• Algorithmically insoluble problems about finitely presented solvable groups, Lie and associative algebras. I
• Algorithmically insoluble problems about finitely presented solvable groups, Lie and associative algebras. II
• Some general algorithms. II: Nilpotent groups
• The occurrence problem for extensions of Abelian groups by nilpotent groups
• The algorithmic theory of polycyclic-by-finite groups
• Automorphisms of groups
• Conjugacy in polycyclic groups
• Some algorithmic problems for solvable groups
• Conjugate separability in polycyclic groups
• Conjugacy problem in metabelian groups
• Algorithmic problems for metabelian groups
• Two problems for solvable and nilpotent groups
• On rationality of verbal subsets in a group
• Rational sets in commutative monoids
• The rational subset membership problem for groups: a survey
• Decidable Properties of Polycyclic Groups
• The solubility of certain decision problems in arithmetic and algebra
• Word Problems Solvable in Logspace
• The Algorithmic Theory of Finitely Generated Metabelian Groups
• Reduction of an arbitrary diophantine equation to one in 13 unknowns
• Low-complexity computations for nilpotent subgroup problems
• Algorithmic theory of solvable groups
• On Reachability Problems for Low-Dimensional Matrix Semigroups
• Complexity and Randomness in Group Theory