Algorithmic problems for -power groups

DOI10.1007/BF02219648MaRDI QIDQ2552954zbMATH OpenFDO

Authors M. I. Kargapolov, Nikolai S. Romanovskiy, V. A. Churkin, Vladimir Remeslennikov, Vitaliĭ Roman'kov

Publication date 1971

Published in Algebra and Logic (Search for Journal in Brave)

Full work available at URL https://eudml.org/doc/186770

Mathematics Subject Classification ID

Special aspects of infinite or finite groups (20F99)

Cites work

• Conjugacy in Nilpotent Groups
• scientific article; zbMATH DE number 3266702 (Why is no real title available?)

Cited in

(13)

• Model-theoretic and algorithmic questions in group theory
• Theories of relatively free solvable groups with extra predicate
• General theory of groups
• Projective limits of nilpotent Hall groups.
• On the extraction of roots in exponential A-groups. II.
• The commutator width of some relatively free Lie algebras and nilpotent groups
• The twisted conjugacy problem for endomorphisms of polycyclic groups
• Parallel complexity for nilpotent groups
• Power-Commutative Nilpotent R-Powered Groups
• On the extraction of roots in exponential A-groups.
• Twisted conjugacy classes in nilpotent groups.
• Separability properties of nilpotent \(\mathbb{Q}[\mathrm{x}]\)-powered groups. II
• Subgroup lattices and the geometry of Hall's \(W\)-power groups.

This page was built for publication: Algorithmic problems for \(\sigma\)-power groups

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