Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
J. J. Cannon, L. A. Dimino, G. Havas, and J. M. Watson, Implementation and Analysis of the Todd—Coxeter Algorithm, Math. Comp. 27 (1973), 463–490.
S. Carmody, and R. F. C. Walters, The Todd—Coxeter Procedure and Left Kan Extensions,this volume, pp. 53–76.
G. Havas, Coset Enumeration Strategies, in: S. M. Watt (ed.), (Proceedings of the 1991 International Symposium on Symbolic and Algebraic Computation, New York: ACM Press, 1991, pp. 191–199.
J. Leech, Coset Enumeration on Digital Computers, Proc. Camb. Phil. Soc. 59 (1963), 257–267.
J. Leech, Coset Enumeration, in: M. D. Atkinson (ed.), Computational Group Theory, New York: Academic Press, 1984, pp. 3–18.
G. Labonté, An Algorithm for the Construction of Matrix Representations for Finitely Presented Non-commutative Algebras, J. Symbolic Comput. 9 (1990), 27–38.
S. A. Linton, Double Coset Enumeration, J. Symbolic Comput. 12 (1991), 415–426.
S. A. Linton, Constructing Matrix Representations of Finitely Presented Groups, J. Symbolic Comput. 12 (1991), 427–438.
S. A. Linton, On Vector Enumeration, Linear Algebra and its Applications 192 (1993), 235–248.
L. H. Soicher, private communication.
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.
J. A. Todd, H. S. M. Coxeter, A Practical Method for Enumerating Cosets of a Finite Abstract Group, Proc. Edinburgh Math. Soc. 5 (1936), 26–34.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1995 Springer Science+Business Media Dordrecht
About this chapter
Cite this chapter
Linton, S.A. (1995). Generalisations of the Todd-Coxeter Algorithm. In: Bosma, W., van der Poorten, A. (eds) Computational Algebra and Number Theory. Mathematics and Its Applications, vol 325. Springer, Dordrecht. https://doi.org/10.1007/978-94-017-1108-1_3
Download citation
DOI: https://doi.org/10.1007/978-94-017-1108-1_3
Publisher Name: Springer, Dordrecht
Print ISBN: 978-90-481-4560-7
Online ISBN: 978-94-017-1108-1
eBook Packages: Springer Book Archive