<h4>1.1 <span class="Heading">Motivation for this package</span></h4>
<p>This package is about orbit enumeration. It bundles fundamental algorithms for orbit enumeration as well as more sophisticated special-purpose algorithms for very large orbits.</p>
<p>The fundamental methods are basically an alternative implementation to the orbit algorithms in the <strong class="pkg">GAP</strong> library. We tried to make them more flexible and more efficient at the same time, therefore backwards compatibility with respect to the user interface had to be given up. In addition, more information about how an orbit was produced is retained and is available for further usage. These orbit enumeration algorithms build on even more fundamental code for hash tables.</p>
<p>The higher level algorithms basically implement the idea to enumerate an orbit <q>by suborbits</q> with respect to one or more subgroups. While these orbit-by-suborbit algorithms are much more efficient in many cases, they very often need careful and sometimes difficult preparations by the user. They are definitely not intended to be <q>push-the-button-tools</q> but require a considerable amount of knowledge from the <q>pilot</q>.</p>
<p>Quite a bit of the code in this package consists in fact of interactive tools to enable users to prepare the data for the orbit-by-suborbit algorithms to work.</p>
<h4>1.2 <span class="Heading">Overview over this manual</span></h4>
<p>Chapter <a href="chap2_mj.html#X80F00D467DD002D3"><span class="RefLink">2</span></a> describes the installation of this package. Chapter <a href="chap3_mj.html#X7D55DB437F5407E8"><span class="RefLink">3</span></a> describes our reimplementation of the basic orbit algorithm. Chapter <a href="chap4_mj.html#X8705763D8698C0B7"><span class="RefLink">4</span></a> describes our toolbox for hash tables, Chapter <a href="chap5_mj.html#X86BA72E27E278718"><span class="RefLink">5</span></a> explains caching data structures, whereas Chapter <a href="chap8_mj.html#X7F2630FB7AA3C73D"><span class="RefLink">8</span></a> describes our implementation of AVL trees. Chapter <a href="chap6_mj.html#X8151A51884B7EE2C"><span class="RefLink">6</span></a> covers tools to use random methods in groups. Chapter <a href="chap7_mj.html#X7DF379C283FE23EF"><span class="RefLink">7</span></a> describes a lot of tools to search in groups and orbits. These techniques are basically intended to provide the data structures necessary to run the code described in Chapter <a href="chap9_mj.html#X7CC7EC257DD466E3"><span class="RefLink">9</span></a> to use the orbit-by-suborbit algorithms. Currently, Chapter <a href="chap10_mj.html#X7BDEA65183A3AE7B"><span class="RefLink">10</span></a> is an empty placeholder. In some future version of this package it will contain a description of code which helps users to find nice quotients of modules which is also needed for the orbit-by-suborbit algorithms. However, since the interface to this code is not yet stable, we chose not to document it as of now, in particular because it relies on other not yet published packages as of the time of this writing. Finally, Chapter <a href="chap11_mj.html#X7A489A5D79DA9E5C"><span class="RefLink">11</span></a> shows an instructive examples for the more sophisticated usage of this package.</p>
Die Informationen auf dieser Webseite wurden
nach bestem Wissen sorgfältig zusammengestellt. Es wird jedoch weder Vollständigkeit, noch Richtigkeit,
noch Qualität der bereit gestellten Informationen zugesichert.
Bemerkung:
Die farbliche Syntaxdarstellung ist noch experimentell.
