Keywords
- Finite Group
- Conjugacy Class
- Simple Group
- Permutation Group
- Solvable Group
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, access via your institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
A.J. Bayes, J. Kautsky and J.W. Wamsley, "Computation in nilpotent groups (application)", these Proc.
John J. Cannon, "Computing local structure of large finite groups", Computers in algebra and number theory, pp. 161–176 (SIAM-AMS Proceedings, 4. Amer. Math. Soc., Providence, Rhode Island, 1971).
John J. Cannon, "Construction of defining relators for finite groups", Discrete Math. 5 (1973), 105–129.
John J. Cannon, Lucien A. Dimino, George Havas and Jane M. Watson, "Implementation and analysis of the Todd-Coxeter algorithm", Math. Comp. 27 (1973), 463–490.
John J. Cannon, Robyn Gallagher and Kim McAllister, "Stackhander; A scheme for processing packed dynamic arrays (Technical Report, 5, Computer-Aided Mathematics Project, Department of Pure Mathematics, University of Sydney, Sydney, November, 1972).
John J. Cannon and George Havas, "Applications of the Todd-Coxeter algorithm", (Technical Report, 9, Computer-Aided Mathematics Project, Department of Pure Mathematics, University of Sydney, Sydney, June, 1973).
Lucien A. Dimino, GRAPPA: Group theoretic applications aid (Bell Telephone Laboratories, Inc., Murray Hill, New Jersey, 1972).
Lucien A. Dimino, Unpublished manuscript, 1970.
John D. Dixon, "High speed computation of group characters", Numer. Math. 10 (1967), 446–450. MR37#325.
Peter Dreyer, "Ein Program zur Berechnung der Auflösbaren Untergruppen von Permutationsgruppen", Diplomarbeit, Keil, 1970.
Volkmar Felsch and Joachim Neubüser, "Ein Program zur Berechnung des Untergruppenverbandes einer endlichen Gruppe", Mitt. Rh.-W. Inst. Math., Bonn 2 (1963), 39–74.
L. Gerhards and E. Altmann, "A computational method for determining the automorphism group of a finite solvable group", Computational problems in abstract algebra (Oxford, 1967), pp. 61–74 (Pergamon Press, Oxford, 1970). MR40#5374.
G. Glauberman, "Global and local properties of finite groups", Finite simple groups, pp. 1–64 (Academic Press, London, New York, 1971).
Marshall Hall, Jr, The theory of groups (The Macmillan Co., New York, 1959). MR21#1996.
George Havas, "A Reidemeister-Schreier program", these Proc.
H. Jürgensen, "Calculation with the elements of a finite group given by generators and defining relations", Computational problems in abstract algebra (Oxford, 1967), pp. 47–57 (Pergamon Press, Oxford, 1970). MR40#5374.
John Leech, "Computer proof of relations in groups", Proc. Conf. on group theory and computation (Galway, 1973).
Evelyne Lepique, "Ein Program zur Berechnung von Untergruppen von gegebenem Index in endlich präsentierten Gruppen", Diplomarbeit, Aachen, 1972.
I.D. Macdonald, "On a class of finitely presented groups", Canad. J. Math. 14 (1962), 602–613. MR25#3992.
I.D. Macdonald, "A computer application to finite p-groups", J. Austral. Math. Soc. 17 (1974), 102–112.
Wilhelm Magnus, Abraham Karrass, Donald Solitar, Combinatorial group theory (Pure and Appl. Math. 13. Interscience [John Wiley & Sons], New York, London, Sydney, 1966). MR34#7617.
J. Neubüser, "Untersuchungen des Untergruppenverbandes endlicher Gruppen auf einer programmgesteurten elektronischen Dualmaschine", Numer. Math. 2 (1960), 280–292. MR22#8713.
J. Neubüser, "Computing moderately large groups: some methods and applications", Computers in algebra and number theory, pp. 183–190(SIAM-AMS Proceedings, 4. Amer. Math. Soc., Providence, Rhode Island, 1971).
Charles C. Sims, "Computational methods in the study of permutation groups", Computational problems in abstract algebra (Oxford, 1967), pp. 169–183 (Pergamon Press, Oxford, 1970). MR41#1856.
Charles C. Sims, "Determining the conjugacy classes of a permutation group", Computers in algebra and number theory, pp. 191–195 (SIAM-AMS Proceedings, 4. Amer. Math. Soc., Providence, Rhode Island, 1971).
Charles C. Sims, "Computation with permutation groups", Proc. Second Symposium on Symbolic and algebraic manipulation, pp. 23–28 (Assoc. for Computing Machinery, New York, 1971).
A. Sinkov, Personal communication, 1972.
J.W. Wamsley, "Computation in nilpotent groups (theory)", these Proc.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1974 Springer-Verlag
About this chapter
Cite this chapter
Cannon, J. (1974). A general purpose group theory program. In: Newman, M.F. (eds) Proceedings of the Second International Conference on The Theory of Groups. Lecture Notes in Mathematics, vol 372. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0065171
Download citation
DOI: https://doi.org/10.1007/BFb0065171
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-06833-4
Online ISBN: 978-3-540-37801-3
eBook Packages: Springer Book Archive
