Double coset enumeration of symmetrically generated groups

John Bray, Robert Curtis

Research output: Contribution to journalArticle


Many finite groups, including all non-abelian finite simple groups, can be symmetrically generated by involutions. An algorithm is described which resembles the familiar Todd-Coxeter enumeration of single cosets and which performs a double coset enumeration for a group defined in this manner. Several rather small examples are worked by hand, and computer input and output is given for more interesting cases.
Original languageEnglish
Pages (from-to)167-185
Number of pages19
JournalJournal of Group Theory
Issue number2
Publication statusPublished - 1 Apr 2004


Dive into the research topics of 'Double coset enumeration of symmetrically generated groups'. Together they form a unique fingerprint.

Cite this