Geodesic
An algorithm for determining defining relations of a subgroup
Glasgow mathematical journal, Tome 18 (1977) no. 1, pp. 51-56

Voir la notice de l'article provenant de la source Cambridge University Press

Suppose that G is a finitely presented group, and that we are given a set of generators for a subgroup H of finite index in G. In this paper we describe an algorithm by which a set of defining relations may be found for H in these generators.The algorithm is suitable for programming on a digital computer. It appears to have significant computational advantages over the method of Mendelsohn [8] (which is based on the Schreier-Reidemeister results, see for example [4, pp. 91–95]) in those cases where the generators of H are given as other than the familiar Schreier-Reidemeister generators. 
McLain, D. H. An algorithm for determining defining relations of a subgroup. Glasgow mathematical journal, Tome 18 (1977) no. 1, pp. 51-56. doi: 10.1017/S0017089500003025
@article{10_1017_S0017089500003025,
     author = {McLain, D. H.},
     title = {An algorithm for determining defining relations of a subgroup},
     journal = {Glasgow mathematical journal},
     pages = {51--56},
     year = {1977},
     volume = {18},
     number = {1},
     doi = {10.1017/S0017089500003025},
     url = {http://geodesic.mathdoc.fr/articles/10.1017/S0017089500003025/}
}
TY  - JOUR
AU  - McLain, D. H.
TI  - An algorithm for determining defining relations of a subgroup
JO  - Glasgow mathematical journal
PY  - 1977
SP  - 51
EP  - 56
VL  - 18
IS  - 1
UR  - http://geodesic.mathdoc.fr/articles/10.1017/S0017089500003025/
DO  - 10.1017/S0017089500003025
ID  - 10_1017_S0017089500003025
ER  - 
%0 Journal Article
%A McLain, D. H.
%T An algorithm for determining defining relations of a subgroup
%J Glasgow mathematical journal
%D 1977
%P 51-56
%V 18
%N 1
%U http://geodesic.mathdoc.fr/articles/10.1017/S0017089500003025/
%R 10.1017/S0017089500003025
%F 10_1017_S0017089500003025

[1] 1.Benson, C. T. and Mendelsohn, N. S., A calculus for a certain class of word problems, J. Combinatorial Theory 1 (1966), 202–208. Google Scholar | DOI

[2] 2.Leech, J., Coset enumeration on digital computers, Proc. Cambridge Philos. Soc. 59 (1963), 257–267. Google Scholar | DOI

[3] 3.Leech, J. (ed.), Computational problems in abstract algebra (Pergamon, 1970). Google Scholar

[4] 4.Magnus, W., Karrass, A. and Solitar, D., Combinational group theory (Interscience, 1966). Google Scholar

[5] 5.McCarthy, J., Lisp 1.5 programmer's manual (MIT Press, 1968). Google Scholar

[6] 6.Mendelsohn, N. S., An algorithmic solution for a word problem in group theory, Canad. J. Math. 16 (1964), 509–516. Google Scholar | DOI

[7] 7.Mendelsohn, N. S., Correction to: an algorithmic solution for a word problem in group theory, Canad. J. Math. 17 (1965), 505. Google Scholar | DOI

[8] 8.Mendelsohn, N. S., Defining relations for subgroups of finite index of groups with a finite presentation, in reference [3] above, 43–44. Google Scholar

[9] 9.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 | DOI

[10] 10.Wijngaarden, A. Van, Mailloux, B. J., Peck, J. E. L. and Koster, C. H. A., Report on the algorithmic language Algol 68, Numer. Math. 14 (1969), 79–218. Google Scholar

Cité par Sources :