Amaglobeli, Mikheil; Remeslennikov, Vladimir Algorithmic problems for class-2 nilpotents MR-groups. (English) Zbl 1361.20004 Georgian Math. J. 22, No. 4, 441-449 (2015). Summary: In this paper we investigate the basic algorithmic problems for class-2 nilpotent MR-groups. It is proved that, under an additional assumption of finite definiteness, all these problems have a positive solution and, in the general case, they have a negative solution for finitely generating groups. Cited in 6 Documents MSC: 20B07 General theory for infinite permutation groups 20F18 Nilpotent groups 20F05 Generators, relations, and presentations of groups Keywords:algorithmic problems; nilpotent groups; Lyndon R-groups; Hall R-groups; MR-groups; \(\alpha\)-commutators PDFBibTeX XMLCite \textit{M. Amaglobeli} and \textit{V. Remeslennikov}, Georgian Math. J. 22, No. 4, 441--449 (2015; Zbl 1361.20004) Full Text: DOI