Hostname: page-component-78c5997874-xbtfd Total loading time: 0 Render date: 2024-11-14T04:49:49.214Z Has data issue: false hasContentIssue false
  • English
  • Français

Coset enumeration on digital computers

Published online by Cambridge University Press:  24 October 2008

John Leech
John Leech
Affiliation:
Computing Laboratory, The UniversityGlasgow, W.2
Get access Rights & Permissions [Opens in a new window]

Extract

In 1936 Todd and Coxeter gave a method ((10), also described in (4), ch. 2) for establishing the order of a finite group defined by a set of relations

satisfied by its generators S1, S2,…, Sk. They enumerate systematically the cosets of a suitable subgroup whose order is evident from the defining relations for the whole group. They describe the method as being ‘purely mechanical’, and since that date the advent of electronic computers has led a number of people to programme the method for automatic execution. Most of this work has remained unpublished; an account is given here of work known to the author.

Type
Research Article
Information
Mathematical Proceedings of the Cambridge Philosophical Society , Volume 59 , Issue 2 , April 1963 , pp. 257 - 267
Copyright
Copyright © Cambridge Philosophical Society 1963

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

References

REFERENCES

(1)Bandler, P. A., M.A. thesis, Manchester, 1956.Google Scholar
(2)Coxeter, H. S. M., The abstract groups Gm,n,υ . Trans. American Math. Soc. 45 (1939), 73–150.Google Scholar
(3)Coxeter, H. S. M., The abstract group G3,7,16. Proc. Edinburgh Math. Soc. (2), 13 (1962), 47–61.CrossRefGoogle Scholar
(4)Coxeter, H. S. M., and Moser, W. O. J., Generators and relations for discrete groups. Ergebnisse der Math. NF, 14 (Springer; Berlin, 1957).Google Scholar
(5)Felsch, H., Programmierung der Restklassenabzählung einer Gruppe nach Untergruppen. Numerische Mathematik, 3 (1961), 250–256.CrossRefGoogle Scholar
(6)Hall, M., Review of (4). Bull. American Math. Soc. 64 (1958), 106–108.Google Scholar
(7)Leech, J., Some definitions of Klein's simple group of order 168 and other groups. Proc. Glasgow Math. Assoc. 5 (1962), 166–175.CrossRefGoogle Scholar
(7a) Appendix to (7).Google Scholar
(8)Leech, J., and Mennicke, J., Note on a conjecture of Coxeter. Proc. Glasgow Math. Assoc. 5 (1961), 25–29.Google Scholar
(9)Maddison, R., Diploma dissertation, University Mathematical Laboratory, Cambridge, 1958.Google Scholar
(10)Todd, J. A., and Coxeter, H. S. M., A practical method for enumerating cosets of a finite abstract group. Proc. Edinburgh Math. Soc. (2), 5 (1936), 26–34.Google Scholar