Derivations and the permutability of subgroups in polycyclic-by-finite groups

DOI10.1090/S0002-9939-02-06486-9zbMATH Open1004.20020MaRDI QIDQ4547017FDOQ4547017

Authors: Derek J. S. Robinson 

Publication date: 20 August 2002

Published in: Proceedings of the American Mathematical Society (Search for Journal in Brave)

Recommendations

• The algorithmic theory of polycyclic-by-finite groups
• scientific article; zbMATH DE number 1004942
• Algorithms for permutability in finite groups.
• On the Fitting subgroup of a polycyclic-by-finite group and its applications
• Computing with infinite polycyclic groups

zbMATH Keywords

algorithmsderivationspolycyclic-by-finite groupspermutable subgroupsdecidable properties in groupspermutability of subgroups in groups

Mathematics Subject Classification ID

Extensions, wreath products, and other compositions of groups (20E22) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10) Solvable groups, supersolvable groups (20F16)

Cites Work

• The algorithmic theory of polycyclic-by-finite groups
• Decidable Properties of Polycyclic Groups
• Soluble products of nilpotent groups
• A note on permutable subgroups

This page was built for publication: Derivations and the permutability of subgroups in polycyclic-by-finite groups

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