<div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">‣ PresentationKnotQuandle</code>( <var class="Arg">gaussCode</var> )</td><td class="tdright">( function )</td></tr></table></div>
<p>Inputs a Gauss Code of a knot (with the orientations; see <span class="SimpleMath">GaussCodeOfPureCubicalKnot</span> in HAP package) and outputs the generators and relators of the knot quandle associated (in the form of a record).</p>
<div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">‣ PD2GC</code>( <var class="Arg">PD</var> )</td><td class="tdright">( function )</td></tr></table></div>
<p>Inputs a Planar Diagram of a knot; outputs the Gauss Code associated (with the orientations).</p>
<div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">‣ PresentationKnotQuandleKnot</code>( <var class="Arg">n</var>, <var class="Arg">k</var> )</td><td class="tdright">( function )</td></tr></table></div>
<p>Returns generators and relators (in the form of a record) for the <span class="SimpleMath">k</span>-th knot with <span class="SimpleMath">n</span> crossings (<span class="SimpleMath">n ≤ 12</span>) if it exists; fail otherwise.</p>
<div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">‣ NumberOfHomomorphisms</code>( <var class="Arg">genRelQ</var>, <var class="Arg">finiteQ</var> )</td><td class="tdright">( function )</td></tr></table></div>
<p>Inputs generators and relators <span class="SimpleMath">genRelQ</span> of a knot quandle (in the form of a record, see above) and a finite quandle <span class="SimpleMath">finiteQ</span>; outputs the number of homomorphisms from the former to the latter.</p>
<div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">‣ PartitionedNumberOfHomomorphisms</code>( <var class="Arg">genRelQ</var>, <var class="Arg">finiteQ</var> )</td><td class="tdright">( function )</td></tr></table></div>
<p>Inputs generators and relators <span class="SimpleMath">genRelQ</span> of a knot quandle (in the form of a record, see above) and a finite connected quandle <span class="SimpleMath">finiteQ</span>; outputs a partition of the number of homomorphisms from the former to the latter.</p>
<div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">‣ IsQuandle</code>( <var class="Arg">M</var> )</td><td class="tdright">( function )</td></tr></table></div>
<p>Inputs a finite magma <span class="SimpleMath">M</span>; returns true if <span class="SimpleMath">M</span> is a quandle, false otherwise.</p>
<div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">‣ Quandles</code>( <var class="Arg">n</var> )</td><td class="tdright">( function )</td></tr></table></div>
<p>Returns a list of all quandles of size <span class="SimpleMath">n</span>, <span class="SimpleMath">n ≤ 6</span>. If <span class="SimpleMath">n ≥ 7</span>, it returns fail.</p>
<div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">‣ IdQuandle</code>( <var class="Arg">Q</var> )</td><td class="tdright">( function )</td></tr></table></div>
<p>Inputs a quandle <span class="SimpleMath">Q</span>; and outputs a list of integers [<span class="SimpleMath">n</span>,<span class="SimpleMath">k</span>] such that <span class="SimpleMath">Q</span> is isomorphic to <span class="SimpleMath">Quandle(n,k)</span>. If <span class="SimpleMath">n ≥ 7</span>, then it returns [<span class="SimpleMath">n</span>,fail] (where <span class="SimpleMath">n</span> is the size of <span class="SimpleMath">Q</span>).</p>
<div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">‣ ConnectedQuandles</code>( <var class="Arg">n</var> )</td><td class="tdright">( function )</td></tr></table></div>
<p>Returns a list of all connected quandles of size <span class="SimpleMath">n</span>.</p>
<div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">‣ IdConnectedQuandle</code>( <var class="Arg">Q</var> )</td><td class="tdright">( function )</td></tr></table></div>
<p>Inputs a connected quandle <span class="SimpleMath">Q</span>; and outputs a list of integers [<span class="SimpleMath">n</span>,<span class="SimpleMath">k</span>] such that <span class="SimpleMath">Q</span> is isomorphic to <span class="SimpleMath">ConnectedQuandle(n,k)</span>.</p>
<div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">‣ IsQuandleEnvelope</code>( <var class="Arg">Q</var>, <var class="Arg">G</var>, <var class="Arg">e</var>, <var class="Arg">stigma</var> )</td><td class="tdright">( function )</td></tr></table></div>
<p>Inputs a set <span class="SimpleMath">Q</span>, a permutation group <span class="SimpleMath">G</span>, an element <span class="SimpleMath">e ∈ Q</span> and an element <span class="SimpleMath">stigma ∈ G</span>; returns true if this structure describes a quandle envelope, false otherwise.</p>
<div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">‣ QuandleQuandleEnvelope</code>( <var class="Arg">Q</var>, <var class="Arg">G</var>, <var class="Arg">e</var>, <var class="Arg">stigma</var> )</td><td class="tdright">( function )</td></tr></table></div>
<p>Inputs a set <span class="SimpleMath">Q</span>, a permutation group <span class="SimpleMath">G</span>, an element <span class="SimpleMath">e ∈ Q</span> and an element <span class="SimpleMath">stigma ∈ G</span>. If this structure describes a quandle envelope, the function returns the quandle from this quandle envelope; and fail otherwise. Nb: this quandle is a connected quandle.</p>
<div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">‣ KnotInvariantCedric</code>( <var class="Arg">genRelQ</var>, <var class="Arg">n</var>, <var class="Arg">m</var> )</td><td class="tdright">( function )</td></tr></table></div>
<p>Inputs generators and relators of a knot quandle (in the form of a record, see above) and two integers <span class="SimpleMath">n</span> and <span class="SimpleMath">m</span>; outputs a list [<span class="SimpleMath">n</span>1,<span class="SimpleMath">n</span>2,...,<span class="SimpleMath">n</span>k] where <span class="SimpleMath">n</span>j is a partition of the number of homomorphisms from the considered knot quandle to the <span class="SimpleMath">j</span>-th connected quandle of size <span class="SimpleMath">n ≤ i ≤ m</span>.</p>
<div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">‣ RightMultiplicationGroupAsPerm</code></td><td class="tdright">( global variable )</td></tr></table></div>
<p>Inputs a connected quandle <span class="SimpleMath">Q</span>; output its right multiplication group whose elements are permutations.</p>
<div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">‣ RightMultiplicationGroup</code></td><td class="tdright">( global variable )</td></tr></table></div>
<p>Inputs a connected quandle <span class="SimpleMath">Q</span>; output its right multiplication group whose elements are mappings from <span class="SimpleMath">Q</span> to <span class="SimpleMath">Q</span>.</p>
<div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">‣ AutomorphismGroupQuandleAsPerm</code>( <var class="Arg">Q</var> )</td><td class="tdright">( function )</td></tr></table></div>
<p>Inputs a connected quandle <span class="SimpleMath">Q</span>; outputs its automorphism group whose elements are permutations.</p>
<div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">‣ AutomorphismGroupQuandle</code>( <var class="Arg">Q</var> )</td><td class="tdright">( function )</td></tr></table></div>
<p>Inputs a connected quandle <span class="SimpleMath">Q</span>; outputs its automorphism group whose elements are mappings from <span class="SimpleMath">Q</span> to <span class="SimpleMath">Q</span>.</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.