## An algorithm for the construction of a defining set of relations for a finite group |

### What people are saying - Write a review

We haven't found any reviews in the usual places.

### Contents

Introduction | 1 |

The double coset Cannon algorithm DCCA | 25 |

Realizing the DCCA | 43 |

3 other sections not shown

### Common terms and phrases

algorithm 2.20 application of lemma base Cannon's algorithm Cayley graph chapter colouring procedure computation connected components const String construction coset enumeration cout DCCA Definition denote derivable from Rh described double coset trick element end for end end if end endl epimorphism equivalence classes F(Ch faithful permutation representation finite groups FlagArray following algorithm for(unsigned long fundamental circuit fundamental groupoid fundamental relator belonging Gollan group G guox GWRD H-component holding in G implementation Kkomp komp lemma Let G maximal tree T\t module nesscore nickname normal subgroup notation from 2.1 nrptr obtained orbit path PermGroupWithRelations permutation group point stabilizer Proof redundant relations relations for G relations produced relations w.r.t. Remark Rh of relations satisfying Schreier vector searchmode set of relations sporadic simple group strong generating set subgroup H symbolic cosets t-edges tEdges theorem uncoloured edge unsigned long unsigned long gen verbosity vertices void