A note on the Todd-Coxeter coset enumeration algorithm

DOI10.1017/S0013091500015790zbMath0328.20032MaRDI QIDQ4093646

Colin M. Campbell, M. J. Beetham

Publication date: 1976

Published in: Proceedings of the Edinburgh Mathematical Society (Search for Journal in Brave)

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Permutations, words, matrices (05A05) Generators, relations, and presentations of groups (20F05) Software, source code, etc. for problems pertaining to group theory (20-04) Structure and classification of infinite or finite groups (20E99)

Related Items (11)

DEFICIENCY ZERO GROUPS IN WHICH PRIME POWER OF GENERATORS ARE CENTRAL ⋮ A class of deficiency zero soluble groups of derived length 4 ⋮ On the commutator lengths of certain classes of finitely presented groups. ⋮ Infinite groups ⋮ Scalable parallel coset enumeration: bulk definition and the memory wall ⋮ An infinite family of finite $2$-groups with deficiency zero ⋮ Classes of groups related to F^a,b,c ⋮ Computing with groups and their character tables ⋮ An infinite family of finite 3-groups with deficiency zero ⋮ Deficiency zero groups involving Fibonacci and Lucas numbers ⋮ Fibonacci lengths involving the Wall number \(k(n)\).

Cites Work

• Implementation and Analysis of the Todd-Coxeter Algorithm
• The orders of certain Metacyclic Groups
• A calculus for a certain class of word problems in groups

This page was built for publication: A note on the Todd-Coxeter coset enumeration algorithm