A Machine Program for Coset Enumeration
Canadian mathematical bulletin, Tome 7 (1964) no. 3, pp. 357-368
Voir la notice de l'article provenant de la source Cambridge
We are concerned with an algorithm for determining the index (when it is finite) of a subgroup H of a group K when K is specified by a finite set of generators and relations and H is specified as generated by a finite set of words in the generators of K. A systematic computational attack on the problem was discovered by Coxeter and Todd [l], and has proved to be a very useful tool in problems involving generators and relations in groups [2]. Although the method was not completely formalized it was clearly possible to convert it into a computer program, and this has been done by a number of people. Leech has given a survey of this work in [3], where further references may be found.
Trotter, H. F. A Machine Program for Coset Enumeration. Canadian mathematical bulletin, Tome 7 (1964) no. 3, pp. 357-368. doi: 10.4153/CMB-1964-033-x
@article{10_4153_CMB_1964_033_x,
author = {Trotter, H. F.},
title = {A {Machine} {Program} for {Coset} {Enumeration}},
journal = {Canadian mathematical bulletin},
pages = {357--368},
year = {1964},
volume = {7},
number = {3},
doi = {10.4153/CMB-1964-033-x},
url = {http://geodesic.mathdoc.fr/articles/10.4153/CMB-1964-033-x/}
}
Cité par Sources :