<p>This chapter describes the <strong class="pkg">GAP</strong> package Ferret. Ferret implements highly efficient implementations of a range of search algorithms on permutation groups. If you are interested in if Ferret can be applied to another problem, please contact the authors, who will be happy to look into if your problem can be solved with Ferret.</p>
</li>
</ul>
</li>
<li><p><em>Stabilizer(G, S)</em> for a permutation group G and a:</p>
<ul>
<li><p>permutation</p>
</li>
<li><p>transformation</p>
</li>
<li><p>partial permutation</p>
</li>
</ul>
</li>
</ul>
<p>If you would like to disable this functionality, you can use <a href="chap1.html#X7E455E297809B021"><span class="RefLink">1.1-1</span></a>.</p>
<div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">‣ EnableFerretOverloads</code>( [<var class="Arg">active</var>] )</td><td class="tdright">( function )</td></tr></table></div>
<p>if <var class="Arg">active</var> (a bool) is true, then enable Ferret specialisations of Intersection and Stabilizer. Call with <var class="Arg">active</var> false to disable.</p>
<div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">‣ FerretOverloadsEnabled</code>( )</td><td class="tdright">( function )</td></tr></table></div>
<p>Return if Ferret specialisations of Intersection and Stabilizer are currently enabled.</p>
<h4>1.2 <span class="Heading">Using 'Solve' to solve problems directly</span></h4>
<p>The main method of using Ferret's functionality is the Solve (2.1-3) method. This method intersects a list of permutation groups. The unusual feature is that these permutation groups can be represented in a variety of ways. They can be usual GAP permutation groups given as a list of generators, or they can be the group which is the stabilizer of combinatorial object under some action. Larger problems are then composed from these pieces. For example, the stabilizer of a set S under a group G can be expressed as the intersection of the group which stabilizes the set S and the group G. For this problem, there would be no point using Solve (2.1-3), as GAP's built in 'Stabilizer' function provides the same functionality. However, with <code class="func">Solve</code> (<a href="chap2.html#X7A415C2480970A43"><span class="RefLink">2.1-3</span></a>) we can intersect any number of groups at the same time, for example finding the intersection of two groups G and H, the stabilizer of a set S and the stabilizer of a set of sets T, with the following code:</p>
<p>The currently allowed arguments to <code class="func">Solve</code> (<a href="chap2.html#X7A415C2480970A43"><span class="RefLink">2.1-3</span></a>) are:</p>
<ul>
<li><p><code class="func">ConInGroup</code> (<a href="chap2.html#X7EE49BAB82A1BB20"><span class="RefLink">2.1-2</span></a>), which represents a Permutation Group in GAP</p>
</li>
<li><p><code class="func">ConStabilize</code> (<a href="chap2.html#X780A9D5A7F85ADD6"><span class="RefLink">2.1-1</span></a>), which takes an object and an action.</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.0.30Bemerkung:
(vorverarbeitet)
¤
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.
