This is a preview of subscription content, log in via an institution to check access.
Literature Cited
M. I. Kargapolov, V. N. Remeslennikov, N. S. Romanovskii, V. A. Roman'kov, and V. A. Churkin, “Algorithmic questions for o-powered groups,” Algebra Logika,8, No. 6, 643–659 (1969).
A. I. Mal'tsev, “Two remarks on nilpotent groups,” Mat. Sb.,37, 567–572 (1955).
A. I. Mal'tsev, “Homomorphisms onto finite groups,” Uch. Zap. Ivanov. Pedagog. Inst.,18, 49–60 (1958).
Yu. V. Matiyasevich, “Enumerable sets are Diophantine,” Dokl. Akad. Nauk SSSR,191, No. 2, 279–282 (1970).
N. Blackburn, “Conjugacy in nilpotent groups,” Proc. Am. Math. Soc.,16, 143–148 (1965).
P. F. Pickel, “Finitely generated nilpotent groups with isomorphic finite quotients,” Trans. Am. Math. Soc.,160, 327–341 (1971).
Additional information
Institute of Mathematics, Siberian Branch, Academy of Sciences of the USSR, Novosibirsk. Translated from Sibirskii Matematicheskii Zhurnal, Vol. 20, No. 5, pp. 1077–1081, September–October, 1979.
Rights and permissions
About this article
Cite this article
Remeslennikov, V.N. An algorithmic problem for nilpotent groups and rings. Sib Math J 20, 761–764 (1979). https://doi.org/10.1007/BF00971840
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF00971840