TY - JOUR
T1 - Double coset enumeration of symmetrically generated groups
AU - Bray, John
AU - Curtis, Robert
PY - 2004/4/1
Y1 - 2004/4/1
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=27244456318&partnerID=8YFLogxK
U2 - 10.1515/jgth.2004.002
DO - 10.1515/jgth.2004.002
M3 - Article
SN - 1435-4446
SN - 1435-4446
SN - 1435-4446
SN - 1435-4446
SN - 1435-4446
SN - 1435-4446
SN - 1435-4446
SN - 1435-4446
SN - 1435-4446
SN - 1435-4446
SN - 1435-4446
SN - 1435-4446
VL - 7
SP - 167
EP - 185
JO - Journal of Group Theory
JF - Journal of Group Theory
IS - 2
ER -