Generalisations of the Todd-Coxeter Algorithm
The Todd-Coxeter coset enumeration algorithm was perhaps the first non-trivial algorithm from pure mathematics to be programmed for a digital computer. Recently the author has developed two related algorithms, the double coset enumeration algorithm and the vector enumeration algorithm. This paper establishes a common framework for the three algorithms, based on a related algorithm for constructing transformation representations of monoids.
KeywordsRegular Representation Free Representation Double Coset Enumeration Algorithm Permutation Representation
Unable to display preview. Download preview PDF.
- S. Carmody, and R. F. C. Walters, The Todd—Coxeter Procedure and Left Kan Extensions,this volume, pp. 53–76.Google Scholar
- J. Leech, Coset Enumeration, in: M. D. Atkinson (ed.), Computational Group Theory, New York: Academic Press, 1984, pp. 3–18.Google Scholar
- L. H. Soicher, private communication.Google Scholar
- E. F. Robertson, Programs to enumerate semigroups and using these programs to study semigroup presentations, talk delivered at the Oberwolfach workshop on Computational Group Theory, 1992.Google Scholar