Algorithmic problems for class-2 nilpotents MR-groups

DOI10.1515/GMJ-2015-0046MaRDI QIDQ897447zbMATH OpenOpenAlexFDO

Authors M. G. Amaglobeli, Vladimir Remeslennikov

Publication date 7 December 2015

Published in Georgian Mathematical Journal (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1515/gmj-2015-0046

zbMATH Keywords

nilpotent groupsalgorithmic problems\(\alpha\)-commutatorsHall R-groupsLyndon R-groupsMR-groups

Mathematics Subject Classification ID

Generators, relations, and presentations of groups (20F05) Nilpotent groups (20F18) General theory for infinite permutation groups (20B07)

Recommendations

• Low-complexity computations for nilpotent subgroup problems
• Logspace and compressed-word computations in nilpotent groups
• Algorithmically insoluble problems about finitely presented solvable groups, Lie and associative algebras. II
• Computing in Nilpotent Matrix Groups
• Algorithms for computing with nilpotent matrix groups over infinite domains.

Cited in

(9)

• On nilpotent power \textit{MR}-groups
• The tensor completion functor in categories of exponential \textit{MR}-groups
• Varieties of exponential \textit{MR}-groups
• \(\mathsf{TC}^0\) circuits for algorithmic problems in nilpotent groups
• Exponential \(MR\)-groups: faithful \(R\)-completion
• Varieties of exponential \(R\)-groups
• Fundamentals of the theory of varieties of nilpotent MR-groups
• scientific article; zbMATH DE number 4116805 (Why is no real title available?)
• scientific article; zbMATH DE number 2014436 (Why is no real title available?)

This page was built for publication: Algorithmic problems for class-2 nilpotents MR-groups

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