A note on the Todd-Coxeter coset enumeration algorithm

DOI10.1017/S0013091500015790MaRDI QIDQ4093646zbMATH OpenFDO

Authors M. J. Beetham, C. M. Campbell

Publication date 1976

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

Full work available at URL https://doi.org/10.1017/S0013091500015790

Mathematics Subject Classification ID

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

Cites work

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

Cited in

(11)

• Infinite groups
• A class of deficiency zero soluble groups of derived length 4
• Classes of groups related to F^a,b,c
• Deficiency zero groups involving Fibonacci and Lucas numbers
• Deficiency zero groups in which prime power of generators are central
• An infinite family of finite $2$-groups with deficiency zero
• An infinite family of finite 3-groups with deficiency zero
• Scalable parallel coset enumeration: bulk definition and the memory wall
• Computing with groups and their character tables
• Fibonacci lengths involving the Wall number k(n).
• On the commutator lengths of certain classes of finitely presented groups.

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4093646)