A note on the Todd-Coxeter coset enumeration algorithm-Reference-Cited by-同舟云学术

A note on the Todd-Coxeter coset enumeration algorithm

Published:1976-03 Issue:1 Volume:20 Page:73-79
ISSN:0013-0915
Container-title:Proceedings of the Edinburgh Mathematical Society
language:en
Short-container-title:Proceedings of the Edinburgh Mathematical Society

Author:

Beetham M. J.,Campbell C. M.

Abstract

In (8) Todd and Coxeter described an algorithm for enumerating the cosets of a finitely generated subgroup of finite index in a finitely presented group. Several authors ((1), (2), (5), (6), (7)) have discussed a modification of the algorithm to give also a presentation of the subgroup in terms of the given generators.

Publisher

Cambridge University Press (CUP)

Subject

General Mathematics

Reference8 articles.

1. A practical method for enumerating cosets of a finite abstract group

2. Implementation and analysis of the Todd-Coxeter algorithm

3. A calculus for a certain class of word problems in groups

4. The orders of certain Metacyclic Groups

5. (2) Campbell C. M. , Dissertation, McGill University, 1965.

Cited by 10 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. An infinite family of finite 3-groups with deficiency zero;Journal of Algebra and Its Applications;2019-07

2. Fibonacci lengths involving the wall number k(n);Journal of Applied Mathematics and Computing;2006-01

3. On the commutator lengths of certain classes of finitely presented groups;International Journal of Mathematics and Mathematical Sciences;2006

4. Scalable Parallel Coset Enumeration: Bulk Definition and the Memory Wall;Journal of Symbolic Computation;2002-05

5. A class of deficiency zero soluble groups of derived length 4;Proceedings of the Royal Society of Edinburgh: Section A Mathematics;1992