An algorithmic problem for nilpotent groups and rings

DOI10.1007/BF00971840MaRDI QIDQ1144655zbMATH OpenOpenAlexFDO

Authors Vladimir 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

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

Cites work

• scientific article; zbMATH DE number 3336816 (Why is no real title available?)
• Conjugacy in Nilpotent Groups
• Finitely Generated Nilpotent Groups with Isomorphic Finite Quotients

Cited in

(2)

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

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

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