An algorithmic problem for nilpotent groups and rings

DOI10.1007/BF00971840zbMath0444.20031OpenAlexW2009856405MaRDI QIDQ1144655

Vladimir N. Remeslennikov

Publication date: 1980

Published in: Siberian Mathematical Journal (Search for Journal in Brave)

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

zbMATH Keywords

nilpotent groupsepimorphism problemnilpotent Lie rings

Mathematics Subject Classification ID

Nil and nilpotent radicals, sets, ideals, associative rings (16N40) Nilpotent groups (20F18) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10) Solvable, nilpotent (super)algebras (17B30) Arithmetic rings and other special commutative rings (13F99)

Related Items (2)

Diophantine questions in the class of finitely generated nilpotent groups ⋮ Algorithmic problems in Engel groups and cryptographic applications

Cites Work

• Conjugacy in Nilpotent Groups
• Finitely Generated Nilpotent Groups with Isomorphic Finite Quotients
• Unnamed Item

This page was built for publication: An algorithmic problem for nilpotent groups and rings