Double coset enumeration

Stephen A. Linton
1991 Journal of symbolic computation  
Coset enumeration is the principal method for solving the word problem in finitely presented groups. The technique has a long history and was one of the first applications of electronic computers to pure mathematics. Present applications are limited by the space available to store the coset table in computer memory. Enumerating double cosets offers a substantial saving of spaee in suitable cases. An algorithm is described with some notes on implementation.
doi:10.1016/s0747-7171(08)80094-6 fatcat:4dm4zzyh65exzeeshhjvl5w4di