Skip to main content Accessibility help
×
Hostname: page-component-cd9895bd7-gxg78 Total loading time: 0 Render date: 2024-12-23T13:48:07.150Z Has data issue: false hasContentIssue false

25 - Addendum to: “An elementary introduction to coset table methods in computational group theory”

Published online by Cambridge University Press:  07 September 2010

Colin M. Campbell
Affiliation:
School of Mathematics and Statistics, University of St Andrews, North Haugh, St Andrews, Fife KY16 9SS, Scotland
George Havas
Affiliation:
ARC Centre for Complex Systems, School of Information Technology and Electrical Engineering, The University of Queensland, Queensland 4072, Australia
Edmund F. Robertson
Affiliation:
School of Mathematics and Statistics, University of St Andrews, North Haugh, St Andrews, Fife KY16 9SS, Scotland
Get access

Summary

Even after 25 years the article by Joachim Neubiiser remains the first source to which all three of us refer those who want to find out about the use of coset tables for studying groups. Our view is confirmed by the 14 Reference Citations from 1998 to 2005 which MathSciNet reveals for this article. Here we loosely follow the structure of the original article and provide some updates on the area (oriented towards our own interests).

First we point out that two newer books include comprehensive details on coset enumeration and related topics in works which are much broader studies. They give excellent coverage of the areas addressed in this article and, further, provide much additional material. They also provide some alternative points of view and many references (as do the other materials cited here).

One of Neubüser's aims in writing his survey was to provide a unified view on coset table methods in computational group theory. He addressed the way coset table concepts were developed, implemented and used. In Derek Holt follows the same kind of approach, including a long chapter “Coset Enumeration” and a shorter one “Presentations for Given Groups”. Charles Sims in focuses on finitely presented groups and he takes a perspective significantly based on some fundamental methods from theoretical computer science, namely automata theory and formal languages.

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

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 [email protected] 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
×