<div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">‣ SL2Z</code>( <var class="Arg">p</var> )</td><td class="tdright">( function )</td></tr></table></div>
<div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">‣ SL2Z</code>( <var class="Arg">1/m</var> )</td><td class="tdright">( function )</td></tr></table></div>
<p>Inputs a prime <span class="SimpleMath">p</span> or the reciprocal <span class="SimpleMath">1/m</span> of a square free integer <span class="SimpleMath">m</span>. In the first case the function returns the conjugate <span class="SimpleMath">SL(2,Z)^P</span> of the special linear group <spanclass="SimpleMath">SL(2,Z)</span> by the matrix <span class="SimpleMath">P=[[1,0],[0,p]]</span>. In the second case it returns the group <span class="SimpleMath">SL(2,Z[1/m])</span>.</p>
<div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">‣ BigStepLCS</code>( <var class="Arg">G</var>, <var class="Arg">n</var> )</td><td class="tdright">( function )</td></tr></table></div>
<p>Inputs a group <span class="SimpleMath">G</span> and a positive integer <span class="SimpleMath">n</span>. It returns a subseries <span class="SimpleMath">G=L_1</span>><span class="SimpleMath">L_2</span>><span class="SimpleMath">... L_k=1</span> of the lower central series of <span class="SimpleMath">G</span> such that <span class="SimpleMath">L_i/L_i+1</span> has order greater than <span class="SimpleMath">n</span>.</p>
<div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">‣ Classify</code>( <var class="Arg">L</var>, <var class="Arg">Inv</var> )</td><td class="tdright">( function )</td></tr></table></div>
<p>Inputs a list of objects <span class="SimpleMath">L</span> and a function <span class="SimpleMath">Inv</span> which computes an invariant of each object. It returns a list of lists which classifies the objects of <span class="SimpleMath">L</span> according to the invariant..</p>
<div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">‣ RefineClassification</code>( <var class="Arg">C</var>, <var class="Arg">Inv</var> )</td><td class="tdright">( function )</td></tr></table></div>
<p>Inputs a list <span class="SimpleMath">C:=Classify(L,OldInv)</span> and returns a refined classification according to the invariant <span class="SimpleMath">Inv</span>.</p>
<div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">‣ HAPcopyright</code>( )</td><td class="tdright">( function )</td></tr></table></div>
<p>This function provides details of HAP'S GNU public copyright licence.
<div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">‣ IsLieAlgebraHomomorphism</code>( <var class="Arg">f</var> )</td><td class="tdright">( function )</td></tr></table></div>
<p>Inputs an object <span class="SimpleMath">f</span> and returns true if <span class="SimpleMath">f</span> is a homomorphism <span class="SimpleMath">f:A ⟶ B</span> of Lie algebras (preserving the Lie bracket).</p>
<div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">‣ IsSuperperfect</code>( <var class="Arg">G</var> )</td><td class="tdright">( function )</td></tr></table></div>
<p>Inputs a group <span class="SimpleMath">G</span> and returns "true" if both the first and second integral homology of <span class="SimpleMath">G</span> is trivial. Otherwise, it returns "false".</p>
<div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">‣ MakeHAPManual</code>( )</td><td class="tdright">( function )</td></tr></table></div>
<p>This function creates the manual for HAP from an XML file.</p>
<div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">‣ PermToMatrixGroup</code>( <var class="Arg">G</var>, <var class="Arg">n</var> )</td><td class="tdright">( function )</td></tr></table></div>
<p>Inputs a permutation group <span class="SimpleMath">G</span> and its degree <span class="SimpleMath">n</span>. Returns a bijective homomorphism <span class="SimpleMath">f:G ⟶ M</span> where <span class="SimpleMath">M</span> is a group of permutation matrices.</p>
<div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">‣ SolutionsMatDestructive</code>( <var class="Arg">M</var>, <var class="Arg">B</var> )</td><td class="tdright">( function )</td></tr></table></div>
<p>Inputs an <span class="SimpleMath">m×n</span> matrix <span class="SimpleMath">M</span> and a <spanclass="SimpleMath">k×n</span> matrix <span class="SimpleMath">B</span> over a field. It returns a k×m matrix <span class="SimpleMath">S</span> satisfying <span class="SimpleMath">SM=B</span>.</p>
<p>The function will leave matrix <span class="SimpleMath">M</span> unchanged but will probably change matrix <span class="SimpleMath">B</span>.</p>
<p>(This is a trivial rewrite of the standard GAP function <span class="SimpleMath">SolutionMatDestructive(</span><<span class="SimpleMath">mat</span>>,<<span class="SimpleMath">vec</span>>) .)</p>
<div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">‣ LinearHomomorphismsPersistenceMat</code>( <var class="Arg">L</var> )</td><td class="tdright">( function )</td></tr></table></div>
<p>Inputs a composable sequence <span class="SimpleMath">L</span> of vector space homomorphisms. It returns an integer matrix containing the dimensions of the images of the various composites. The sequence <span class="SimpleMath">L</span> is determined up to isomorphism by this matrix.</p>
<div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">‣ NormalSeriesToQuotientHomomorphisms</code>( <var class="Arg">L</var> )</td><td class="tdright">( function )</td></tr></table></div>
<p>Inputs an (increasing or decreasing) chain <span class="SimpleMath">L</span> of normal subgroups in some group <span class="SimpleMath">G</span>. This <span class="SimpleMath">G</span> is the largest group in the chain. It returns the sequence of composable group homomorphisms <span class="SimpleMath">G/L[i] → G/L[i+/-1]</span>.</p>
<div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">‣ TestHap</code>( )</td><td class="tdright">( function )</td></tr></table></div>
<p>This runs a representative sample of HAP functions and checks to see that they produce the correct output.</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.