Geodesic
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 University Press

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/}
}
TY  - JOUR
AU  - Trotter, H. F.
TI  - A Machine Program for Coset Enumeration
JO  - Canadian mathematical bulletin
PY  - 1964
SP  - 357
EP  - 368
VL  - 7
IS  - 3
UR  - http://geodesic.mathdoc.fr/articles/10.4153/CMB-1964-033-x/
DO  - 10.4153/CMB-1964-033-x
ID  - 10_4153_CMB_1964_033_x
ER  - 
%0 Journal Article
%A Trotter, H. F.
%T A Machine Program for Coset Enumeration
%J Canadian mathematical bulletin
%D 1964
%P 357-368
%V 7
%N 3
%U http://geodesic.mathdoc.fr/articles/10.4153/CMB-1964-033-x/
%R 10.4153/CMB-1964-033-x
%F 10_4153_CMB_1964_033_x

[1] 1. Todd, J.A. and Coxeter, H. S. M., A practical method for enumerating cosets of a finite abstract group, Proc. Edinburgh Math. Soc. (2), 5(1936), 26–34. Google Scholar

[2] 2. Coxeter, H.S.M. and Moser, W.O.J., Generators and relations for discrete groups, Ergebnisse der Math. 14 (Springer;Berlin, 1957). Google Scholar

[3] 3. Leech, J., Coset enumeration on digital computers, Proc. Camb. Phil. Soc. 59 (1963), 257–267. Google Scholar

[4] 4. Mendelsohn, N. S., An algorithmic solution for a word problem in group theory, Dept. of Math. Publications, Univ. of Manitoba, 1963. Google Scholar

[5] 5. Schreier, O., Die Untergruppen der freien Gruppen, Hamb. Abh., 5 (1926), 161–183. Google Scholar

Cité par Sources :