Skip to main content Accessibility help
×
Hostname: page-component-586b7cd67f-t7fkt Total loading time: 0 Render date: 2024-12-04T01:11:13.329Z Has data issue: false hasContentIssue false

8 - Some algorithms for polycyclic groups

Published online by Cambridge University Press:  05 April 2013

Frank B Cannonito
Affiliation:
University of California
C. M. Campbell
Affiliation:
University of St Andrews, Scotland
E. F. Robertson
Affiliation:
University of St Andrews, Scotland
Get access

Summary

Introduction

The algorithmic theory of some solvable groups appears now to be rather complete. In the near future two rather large papers will appear which will give complete details of the algorithms for polycyclic-by-finite groups devised by me together with Gilbert Baumslag, Derek J S Robinson and Dan Segal [BCRS]. In addition, Dan Segal will give additional algorithms for automorphisms of these groups which will conclude with a positive solution for the isomorphism problem [DS]. Another development that bears watching is the actual implementation of some of these algorithms for high speed computers. Indeed, Charles Sims has almost got the so-called “polycyclic quotient algorithm” devised by Gil Baumslag, myself and Chuck Miller [BCM IV] running; something that very few of us dreamed could happed (see [CS]). So for the first time a practical theory of computing in group theory with some real depth seems likely. No one can tell where this could lead.

The property of polycyclic-by-finite groups that facilitates this development is that they are coherent. That is, they and all their subgroups are finitely presented. Another important feature is that these groups have an easily recognized (finite) presentation. Indeed, if one writes down a so-called polycyclic presentation (see below), which inevitably presents a solvable group, then the polycyclic quotient algorithm referred to above enables you to effectively decide if the group presented is polycyclic [BCM IV].

Type
Chapter
Information
Publisher: Cambridge University Press
Print publication year: 1991

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Save book to Kindle

To save this book to your Kindle, first ensure no-reply@cambridge.org is added to your Approved Personal Document E-mail List under your Personal Document Settings on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part of your Kindle email address below. Find out more about saving to your Kindle.

Note you can select to save to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be saved to your device when it is connected to wi-fi. ‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.

Find out more about the Kindle Personal Document Service.

Available formats
×

Save book to Dropbox

To save content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about saving content to Dropbox.

Available formats
×

Save book to Google Drive

To save content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about saving content to Google Drive.

Available formats
×