  
  [1X1 [33X[0;0YIntroduction[133X[101X
  
  [33X[0;0YThis package is about group recognition.[133X
  
  [33X[0;0YIn  computational group theory, group recognition is the task of identifying
  a  given  group.  The  main  goal is to determine whether the given group is
  isomorphic  to  a  well-understood  group,  such  as  a symmetric group or a
  classical matrix group, and to construct an explicit isomorphism between the
  two groups. The first task is called [21Xnaming[121X or [21Xnon-constructive[121X recognition,
  the latter task is called [21Xconstructive[121X recognition.[133X
  
  [33X[0;0YThe  [5Xrecog[105X  package  is  a  generic  framework that implements algorithms to
  recognise  groups,  regardless of what computational representation is used.
  This means, that the code in this package is useful at least for permutation
  groups, matrix groups and projective groups over finite fields. The setup is
  described in [NS06].[133X
  
  [33X[0;0YThe framework allows to build composition trees and handles the built-up and
  usage  of  these trees in a generic way. It also contains a method selection
  (described  in  Chapter  [14X5[114X)  that allows to install recognition methods in a
  convenient  way  and that automatically tries to try the different available
  methods in a sensible order.[133X
  
  
  [1X1.1 [33X[0;0YOverview over this manual[133X[101X
  
  [33X[0;0YChapter [14X2[114X describes the installation of this package.[133X
  
  [33X[0;0YChapter   [14X3[114X   presents   a   user-friendly  introduction  to  this  package.
  Furthermore,  some  instructive  examples  of  the usage of this package are
  shown  in  section  [14X3.3[114X and possible applications of a completed recognition
  tree are explained in section [14X3.4[114X.[133X
  
  [33X[0;0YChapter  [14X4[114X  describes  the  generic,  recursive  procedure  used  for  group
  recognition  throughout  this package. At the heart of this procedure is the
  definition  of  [21XFindHomomorphism[121X  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 [21Xmethod selection[121X which
  is not to be confused with the [5XGAP[105X method selection.[133X
  
  [33X[0;0YOur own method selection system is described in detail in Chapter [14X5[114X, because
  it   is  interesting  in  its  own  right  and  might  be  useful  in  other
  circumstances.[133X
  
  [33X[0;0YChapter [14X6[114X describes the available [21XFindHomomorphism[121X methods.[133X
  
  
  [1X1.2 [33X[0;0YFeedback and support[133X[101X
  
  [33X[0;0YIf  you  have any bug reports, feature requests, or suggestions, then please
  tell       us       via      the      issue      tracker      on      GitHub
  ([7Xhttps://github.com/gap-packages/recog/issues[107X).[133X
  
  [33X[0;0YIn  addition,  the [5Xrecog[105X package has a mailing list, at recog@gap-system.org
  ([7Xmailto:recog@gap-system.org[107X),  which  can  be used for holding discussions,
  sharing  information,  and  asking questions about the package. You can find
  more  information,  and  register  to receive the mail sent to this list, at
  [7Xhttps://mail.gap-system.org/mailman/listinfo/recog[107X.[133X
  
  
  [1X1.3 [33X[0;0YLiterature (selection)[133X[101X
  
  [33X[0;0YThere  is  a  lot  of  relevant  literature  on  the mathematics behind this
  package.  We  are working on enhancing this manual to cite it in appropriate
  places.  In  the  meantime, here is a list of references not currently cited
  elsewhere:  [BB99]  [BBS09]  [BK01] [BK06] [BLN+03] [BLN+05] [BLS97] [BNS06]
  [BS01]  [Bro01]  [Bro03]  [Bro08]  [CFL97]  [CL01]  [CL98]  [CLM+95] [CLO06]
  [DLLO13]  [DLO15]  [GH97] [GLO06] [HLOR96a] [HLOR96b] [HLO+08] [HR94] [IL00]
  [KK15]  [KM13]  [KM15]  [Lee01] [LO02] [LO09] [LO97a] [LO97b] [LMO07] [LO07]
  [LO16] [NP92] [Nie05] [O'B06] [O'B11] [Pak00] [Par84] [Ser03][133X
  
