Skip to main content

A General Purpose Group Theory Program

  • Conference paper

Part of the Lecture Notes in Mathematics book series (LNM,volume 372)

Abstract

Questions concerning particular finite groups, which cannot be easily answered by hand methods, can sometimes be resolved with the aid of a computer. Among the more spectacular problems which have been solved using machines, we mention only the construction of character tables for Large finite simple groups by Conway, Livingstone, Hunt and others, the construction of the Lyons simple group by Sims and the determination of the four-dimensional crystal groups by Neubüser and colleagues.

Keywords

  • Finite Group
  • Simple Group
  • Permutation Group
  • Nilpotent 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

Chapter
USD   29.95
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   44.99
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   59.00
Price excludes VAT (Canada)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. A.J. Bayes, J. Kautsky and J.W. Wamsley, “Computation in nilpotent groups (application)”, these Proc.

    Google Scholar 

  2. John J. Cannon, “Computing local structure of large finite groups”, Computers in algebra and nurber theory, pp. 161–176 (SIAM-AMS Proceedings, 4. Amer. Math. Soc., Providence, Rhode Island, 1971 ).

    Google Scholar 

  3. John J. Cannon, “Construction of defining relators for finite groups”, Discrete Math. 5 (1973), 105–129.

    CrossRef  MathSciNet  MATH  Google Scholar 

  4. John J. Cannon, Lucien A. Dimino, George Havas and Jane M. Watson, “Implementation and analysis of the Todd-Coxeter algorithm”, Math. Corso. 27 (1973), 463-490.

    Google Scholar 

  5. 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 ).

    Google Scholar 

  6. 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 ).

    Google Scholar 

  7. Lucien A. Dimino, GRAPPA: Group theoretic applications aid (Bell Telephone Laboratories, Inc., Murray Hill, New Jersey, 1972 ).

    Google Scholar 

  8. Lucien A. Dimino, Unpublished manuscript, 1970.

    Google Scholar 

  9. John D. Dixon, “High speed computation of group characters”, Numer. Math. 10 (1967), 446–450. MR37#325.

    CrossRef  MathSciNet  Google Scholar 

  10. Peter Dreyer, “Ein Program zur Berechnung der Auflösbaren Untergruppen von Permutationsgruppen”, Diplomarbeit, Keil, 1970.

    Google Scholar 

  11. Volkmar Felsch und Joachim Neuböser, “Ein Program zur Berechnung des Untergruppenverbandes einer endlichen Gruppe”, Mitt. Rh.-W. Inst. Math., Bonn 2 (1963), 39–74.

    Google Scholar 

  12. 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.

    Google Scholar 

  13. G. Glauberman, “Global and local properties of finite groups”, Finite simple groups, pp. 1–64 ( Academic Press, London, New York, 1971 ).

    Google Scholar 

  14. Marshall Hall, Jr, The theory of groups ( The Macmillan Co., New York, 1959 ). MR21#1996.

    Google Scholar 

  15. George Havas, “A Reidemeister-Schreier program”, these Proc.

    Google Scholar 

  16. 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.

    Google Scholar 

  17. John Leech, “Computer proof of relations in groups”, Proc. Conf. on group theory and computation (Galway, 1973 ).

    Google Scholar 

  18. Evelyne Lepique, “Ein Program zur Berechnung von Untergruppen von gegebenem index in endlich präsentierten Gruppen”, Diplomarbeit, Aachen, 1972.

    Google Scholar 

  19. I.D. Macdonald, “On a class of finitely presented groups”, Canad. J. Math. 14 (1962), 602-613.MR25#3992.

    Google Scholar 

  20. I.D. Macdonald, “A computer application to finite p-groups”, J. Austral. Math. Soc. 17 (1974), 102–112.

    CrossRef  MathSciNet  MATH  Google Scholar 

  21. Wilhelm Magnus, Abraham Karrass, Donald Solitar, Combinatorial group theory (Pure and Appl. Math. 13. Interscience [John Wiley 8 Sons], New York, London, Sydney, 1966 ). MR34#7617.

    Google Scholar 

  22. J. Neuböser, “Untersuchungen des Untergruppenverbandes endlicher Gruppen auf einer programmgesteurten elektronischen Dualmaschine”, Murer. Math. 2 (1960), 280–292. MR22#8713.

    Google Scholar 

  23. 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 ).

    Google Scholar 

  24. 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.

    Google Scholar 

  25. 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 ).

    Google Scholar 

  26. 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 ).

    Google Scholar 

  27. A. Sinkov, Personal communication, 1972.

    Google Scholar 

  28. J.W. Wamsley, “Computation in nilpotent groups (theory)”, these Proc.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and Permissions

Copyright information

© 1974 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

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/978-3-662-21571-5_17

Download citation

  • DOI: https://doi.org/10.1007/978-3-662-21571-5_17

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-06845-7

  • Online ISBN: 978-3-662-21571-5

  • eBook Packages: Springer Book Archive