Remote Access Proceedings of the American Mathematical Society
Green Open Access

Proceedings of the American Mathematical Society

ISSN 1088-6826(online) ISSN 0002-9939(print)



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

Author: Derek J. S. Robinson
Journal: Proc. Amer. Math. Soc. 130 (2002), 3461-3464
MSC (2000): Primary 20F10, 20F16
Published electronically: April 22, 2002
MathSciNet review: 1918821
Full-text PDF

Abstract | References | Similar Articles | Additional Information

Abstract: It is shown that there is an algorithm to decide if two given subgroups of a polycyclic-by-finite group permute. This is accomplished by finding an algorithm which is able to determine if a derivation is surjective.

References [Enhancements On Off] (What's this?)

  • 1. G. Baumslag, F. B. Cannonito, D. J. S. Robinson and D. Segal, The algorithmic theory of polycyclic-by-finite groups, J. Algebra 142 (1991), 118-149. MR 92i:20036
  • 2. J. C. Lennox and D. J. S. Robinson, Soluble products of nilpotent groups, Rend. Sem. Mat. Univ. Padova 62 (1980), 261-280. MR 81j:20050
  • 3. J. C. Lennox and J. S. Wilson, A note on permutable subgroups, Arch. Math. (Basel) 28 (1977), 113-116. MR 58:11135
  • 4. D. Segal, Decidable properties of polycyclic groups, Proc. London Math. Soc. (3) 61 (1990), 497-528. MR 91h:20050

Similar Articles

Retrieve articles in Proceedings of the American Mathematical Society with MSC (2000): 20F10, 20F16

Retrieve articles in all journals with MSC (2000): 20F10, 20F16

Additional Information

Derek J. S. Robinson
Affiliation: Department of Mathematics, University of Illinois at Urbana-Champaign, 1409 West Green Street, Urbana, Illinois 61801

Received by editor(s): May 29, 2001
Received by editor(s) in revised form: July 5, 2001
Published electronically: April 22, 2002
Communicated by: Steven D. Smith
Article copyright: © Copyright 2002 American Mathematical Society

American Mathematical Society