Goto Chapter: Top 1 2 3 4 5 Bib Ind
 [Top of Book]  [Contents]   [Previous Chapter]   [Next Chapter] 

1 Introduction
 1.1 Philosophy
 1.2 Overview over this manual
 1.3 Feedback

1 Introduction

1.1 Philosophy

This package is about group recognition. It provides a generic framework to implement methods of group recognition, regardless of what computational representation is used. This means, that the code in this package is useful at least for permutation groups, matrix groups, projective groups and for the context of black box groups. The setup is described in [NS06].

The framework allows to build composition trees and handles the builtup and usage of these trees in a generic way. It also contains a method selection (described in Chapter 3) that allows install recognition methods in a convenient way and that automatically tries to try the different available methods in a sensible order.

1.2 Overview over this manual

Chapter 2 describes the installation of this package. Chapter 4 describes the generic, recursive procedure used for group recognition throughout this package. At the heart of this procedure is the definition of "FindHomomorphism" methods, which is also described in that chapter. For the choice of the right method for finding a homomorphism (or an isomorphism) we use another generic procedure, the "method selection" which is not to be confused with the GAP method selection. Our own method selection is described in detail in Chapter 3, because it is interesting in its own right and might be useful in other circumstances. Finally, in Chapter 5 we describe, what one can do with a completed recognition tree.

1.3 Feedback

For bug reports, feature requests and suggestions, please use our issue tracker.

 [Top of Book]  [Contents]   [Previous Chapter]   [Next Chapter] 
Goto Chapter: Top 1 2 3 4 5 Bib Ind

generated by GAPDoc2HTML