An Invitation to Computational Group Theory (1995)
| Venue: | Groups' 93 -- Galway/St. Andrews, volume 212 of London Math. Soc. Lecture Note Ser |
| Citations: | 3 - 0 self |
BibTeX
@INPROCEEDINGS{Neubüser95aninvitation,
author = {J. Neubüser},
title = {An Invitation to Computational Group Theory},
booktitle = {Groups' 93 -- Galway/St. Andrews, volume 212 of London Math. Soc. Lecture Note Ser},
year = {1995},
pages = {457--475},
publisher = {Cambridge University Press}
}
OpenURL
Abstract
Algebra" in 1967 [Lee70]. Its proceedings contain a survey of what had been tried until then [Neu70] but also some papers that lead into the Decade of discoveries (1967--1977). At the Oxford conference some of those computational methods were presented for the first time that are now, in some cases varied and improved, work horses of CGT systems: Sims' methods for handling big permutation groups [Sim70], the Knuth-Bendix method for attempting to construct a rewrite system from a presentation [KB70], variations of the Todd-Coxeter method for the determination of presentations of subgroups [Men70]. Others, like J. D. Dixon's method for the determination of the character table [Dix67], the p-Nilpotent-Quotient method of I. D. Macdonald [Mac74] and the Reidemeister-Schreier method of G. Havas [Hav74] for subgroup presentations were published within a few years from that conference. However at least equally important for making group theorists aware of CGT were a number of applications of...







