<p>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, and matrix groups and projective groups over finite fields. The setup is described in <a href="chapBib_mj.html#biBNS06">[NS06]</a>.</p>
<p>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 <a href="chap4_mj.html#X8058CC8187162644"><span class="RefLink">4</span></a>) that allows to install recognition methods in a convenient way and that automatically tries to try the different available methods in a sensible order.</p>
<h4>1.2 <span class="Heading">Overview over this manual</span></h4>
<p>Chapter <a href="chap2_mj.html#X7AA0519A7CFE18C2"><span class="RefLink">2</span></a> describes the installation of this package.</p>
<p>Chapter <a href="chap3_mj.html#X7F73983582251807"><span class="RefLink">3</span></a> describes the generic, recursive procedure used for group recognition throughout this package. At the heart of this procedure is the definition of <q>FindHomomorphism</q> 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 <q>method selection</q> which is not to be confused with the <strong class="pkg">GAP</strong> method selection.</p>
<p>Our own method selection system is described in detail in Chapter <a href="chap4_mj.html#X8058CC8187162644"><span class="RefLink">4</span></a>, because it is interesting in its own right and might be useful in other circumstances.</p>
<p>Chapter <a href="chap6_mj.html#X78C5295B86AD0C66"><span class="RefLink">6</span></a> describes the available <q>FindHomomorphism</q> methods.</p>
<p>Chapter <a href="chap5_mj.html#X851A3F04786123D5"><span class="RefLink">5</span></a> explains what one can do with a completed recognition tree.</p>
<p>Finally, Chapter <a href="chap7_mj.html#X7A489A5D79DA9E5C"><span class="RefLink">7</span></a> shows some instructive examples of the usage of this package.</p>
<h4>1.3 <span class="Heading">Feedback and support</span></h4>
<p>If you have any bug reports, feature requests, or suggestions, then please tell us via the <spanclass="URL"><a href="https://github.com/gap-packages/recog/issues">issue tracker on GitHub</a></span>.</p>
<p>In addition, the <strong class="pkg">recog</strong> package has a mailing list, at <span class="URL"><a href="mailto:recog@gap-system.org">recog@gap-system.org</a></span>, 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 <span class="URL"><a href="https://mail.gap-system.org/mailman/listinfo/recog">https://mail.gap-system.org/mailman/listinfo/recog</a></span>.</p>
