Computers in group theory
Author:
Open Access
- 1 January 1969
- journal article
- Published by Association for Computing Machinery (ACM) in Communications of the ACM
- Vol. 12 (1) , 3-12
Abstract
Computers are being applied to an increasingly diverse range of problems in group theory. The most important areas of application at present are coset enumeration, sub-group lattices, automorphism groups of finite groups, character tables, and commutator calculus. Group theory programs range from simple combinatorial or numerical programs to large symbol manipulation systems. In this survey the more important algorithms in use are described and contrasted, and results which have been obtained using existing programs are indicated. An extensive bibliography is included.Keywords
This publication has 24 references indexed in Scilit:
- Computation of Isomorphism Classes of p-GroupsMathematics of Computation, 1969
- Über ein Programm zur Berechnung der Automorphismengruppe einer endlichen GruppeNumerische Mathematik, 1968
- High speed computation of group charactersNumerische Mathematik, 1967
- A calculus for a certain class of word problems in groupsJournal of Combinatorial Theory, 1966
- Generators for certain normal subgroups of (2,3,7)Mathematical Proceedings of the Cambridge Philosophical Society, 1965
- Ein Verfahren zur Berechnung des vollständigen Untergruppenverbandes endlicher Gruppen auf DualmaschinenNumerische Mathematik, 1965
- Coset enumeration on digital computersMathematical Proceedings of the Cambridge Philosophical Society, 1963
- ber eine Darstellung von Gruppenelementen in digitalen RechenautomatenNumerische Mathematik, 1962
- Some definitions of Klein's simple group of order 168 and other groupsProceedings of the Glasgow Mathematical Association, 1962
- Programmierung der Restklassenabzählung einer Gruppe nach UntergruppenNumerische Mathematik, 1961