Quellcodebibliothek Statistik Leitseite products/Sources/formale Sprachen/GAP/pkg/majoranaalgebras/doc/   (Algebra von RWTH Aachen Version 4.15.1©)  Datei vom 7.6.2024 mit Größe 12 kB image not shown  

Quelle  chap7.html   Sprache: HTML

 
 products/Sources/formale Sprachen/GAP/pkg/majoranaalgebras/doc/chap7.html


<?xml version="1.0" encoding="UTF-8"?>

<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Strict//EN"
         "http://www.w3.org/TR/xhtml1/DTD/xhtml1-strict.dtd">

<html xmlns="http://www.w3.org/1999/xhtml" xml:lang="en">
<head>
<title>GAP (MajoranaAlgebras) - Chapter 7: Signed Permutations</title>
<meta http-equiv="content-type" content="text/html; charset=UTF-8" />
<meta name="generator" content="GAPDoc2HTML" />
<link rel="stylesheet" type="text/css" href="manual.css" />
<script src="manual.js" type="text/javascript"></script>
<script type="text/javascript">overwriteStyle();</script>
</head>
<body class="chap7"  onload="jscontent()">


<div class="chlinktop"><span class="chlink1">Goto Chapter: </span><a href="chap0.html">Top</a>  <a href="chap1.html">1</a>  <a href="chap2.html">2</a>  <a href="chap3.html">3</a>  <a href="chap4.html">4</a>  <a href="chap5.html">5</a>  <a href="chap6.html">6</a>  <a href="chap7.html">7</a>  <a href="chapInd.html">Ind</a>  </div>

<div class="chlinkprevnexttop"> <a href="chap0.html">[Top of Book]</a>   <a href="chap0.html#contents">[Contents]</a>    <a href="chap6.html">[Previous Chapter]</a>    <a href="chapInd.html">[Next Chapter]</a>   </div>

<p id="mathjaxlink" class="pcenter"><a href="chap7_mj.html">[MathJax on]</a></p>
<p><a id="X847F187C7DA356AA" name="X847F187C7DA356AA"></a></p>
<div class="ChapSects"><a href="chap7.html#X847F187C7DA356AA">7 <span class="Heading">Signed Permutations</span></a>
<div class="ContSect"><span class="tocline"><span class="nocss"> </span><a href="chap7.html#X828866AB7AE9C0CC">7.1 <span class="Heading">Different Representations</span></a>
</span>
</div>
<div class="ContSect"><span class="tocline"><span class="nocss"> </span><a href="chap7.html#X8598044F844BF533">7.2 <span class="Heading">Low-Level Descriptions</span></a>
</span>
<div class="ContSSBlock">
<span class="ContSS"><br /><span class="nocss">  </span><a href="chap7.html#X7BFE3679813E5D08">7.2-1 IsSignedPerm</a></span>
<span class="ContSS"><br /><span class="nocss">  </span><a href="chap7.html#X83BC19B8812D211C">7.2-2 ListSignedPerm</a></span>
<span class="ContSS"><br /><span class="nocss">  </span><a href="chap7.html#X7CAA502279CC9A8C">7.2-3 ListSignedPerm</a></span>
<span class="ContSS"><br /><span class="nocss">  </span><a href="chap7.html#X7C6AB5A27B2DA2F1">7.2-4 SignedPerm</a></span>
<span class="ContSS"><br /><span class="nocss">  </span><a href="chap7.html#X856041438008B08B">7.2-5 NewSignedPerm</a></span>
<span class="ContSS"><br /><span class="nocss">  </span><a href="chap7.html#X82C6D31583C213E1">7.2-6 NewSignedPerm</a></span>
<span class="ContSS"><br /><span class="nocss">  </span><a href="chap7.html#X87BCE2B280486669">7.2-7 IsSignedPermRep</a></span>
<span class="ContSS"><br /><span class="nocss">  </span><a href="chap7.html#X8531225C7C224C62">7.2-8 IsSignedPermListRep</a></span>
<span class="ContSS"><br /><span class="nocss">  </span><a href="chap7.html#X8033A20F7A7A60CB">7.2-9 OnPosPoints</a></span>
<span class="ContSS"><br /><span class="nocss">  </span><a href="chap7.html#X84709BF07811FECB">7.2-10 LargestMovedPoint</a></span>
<span class="ContSS"><br /><span class="nocss">  </span><a href="chap7.html#X824068057D141DE0">7.2-11 RandomSignedPermList</a></span>
<span class="ContSS"><br /><span class="nocss">  </span><a href="chap7.html#X85E05F9283E5B099">7.2-12 RandomSignedPerm</a></span>
</div></div>
</div>

<h3>7 <span class="Heading">Signed Permutations</span></h3>

<p>We provide <em>signed permutations</em>, that is permutations that can additionally change the sign of their result.</p>

<p>Assume <span class="SimpleMath">n ∈ N</span>, then a signed permutation on <span class="SimpleMath">n</span> points is a permutation <span class="SimpleMath">π</span> on <span class="SimpleMath">{ 1 ... n }</span> together with signs <span class="SimpleMath">sgn : { 1 .. n } → {-1,1}</span>. A signed permutation on <span class="SimpleMath">n</span> points acts on the set <span class="SimpleMath">{ -n ... 1, 1 ... n }</span> by <span class="SimpleMath">ω ^ (π, sgn) = sgn(ω)⋅ sgn(|ω|^π) ⋅ (|ω|^π)</span>.</p>

<p>We provide two representations of signed permutations, one as a list of images <code class="func">IsSignedPermListRep</code> (<a href="chap7.html#X8531225C7C224C62"><span class="RefLink">7.2-8</span></a>) and one formed as pair of a permutation and a sign map <code class="func">IsSignedPermRep</code> (<a href="chap7.html#X87BCE2B280486669"><span class="RefLink">7.2-7</span></a>). Our benchmarks indicate that a list of images is the better representation, and hence this is the default.</p>

<p>To get started with signed permutations consider the following example</p>


<div class="example"><pre>
<span class="GAPprompt">gap></span> <span class="GAPinput">s := SignedPerm([2,-1]);</span>
<signed permutation in list rep>
<span class="GAPprompt">gap></span> <span class="GAPinput">1 ^ s;</span>
2
<span class="GAPprompt">gap></span> <span class="GAPinput">2 ^ s;</span>
-1
<span class="GAPprompt">gap></span> <span class="GAPinput">OnPoints(2, s);</span>
-1
</pre></div>

<p>One can form groups out of signed permutations</p>


<div class="example"><pre>
<span class="GAPprompt">gap></span> <span class="GAPinput">r := SignedPerm([-1,3,-2,4]);; t := SignedPerm([3,1,4,2]);;</span>
<span class="GAPprompt">gap></span> <span class="GAPinput">G := Group(r,t);</span>
<group with 2 generators>
<span class="GAPprompt">gap></span> <span class="GAPinput">Size(G);</span>
32
<span class="GAPprompt">gap></span> <span class="GAPinput">Orbit(G, 1, OnPoints);</span>
[ 1, -1, 3, -3, -2, 4, 2, -4 ]
<span class="GAPprompt">gap></span> <span class="GAPinput">Stabilizer(G, 1, OnPoints);</span>
<group of size 4 with 9 generators>
</pre></div>

<p>Note that currently the package does not make an effort to exploit the special structure of signed permutation groups as permutation groups.</p>

<p><a id="X828866AB7AE9C0CC" name="X828866AB7AE9C0CC"></a></p>

<h4>7.1 <span class="Heading">Different Representations</span></h4>

<p>To create signed permutations in the different representations, we provide a constructor.</p>


<div class="example"><pre>
<span class="GAPprompt">gap></span> <span class="GAPinput">r := NewSignedPerm(IsSignedPermRep, [-1,3,-2,4]);;</span>
<span class="GAPprompt">gap></span> <span class="GAPinput">t := SignedPerm(IsSignedPermRep, [3,1,4,2]);;</span>
<span class="GAPprompt">gap></span> <span class="GAPinput">G := Group(r,t);</span>
<group with 2 generators>
<span class="GAPprompt">gap></span> <span class="GAPinput">Size(G);</span>
32
<span class="GAPprompt">gap></span> <span class="GAPinput">r := NewSignedPerm(IsSignedPermListRep, [-1,3,-2,4]);;</span>
<span class="GAPprompt">gap></span> <span class="GAPinput">t := SignedPerm(IsSignedPermListRep, [3,1,4,2]);;</span>
<span class="GAPprompt">gap></span> <span class="GAPinput">G := Group(r,t);</span>
<group with 2 generators>
<span class="GAPprompt">gap></span> <span class="GAPinput">Size(G);</span>
32
</pre></div>

<p><a id="X8598044F844BF533" name="X8598044F844BF533"></a></p>

<h4>7.2 <span class="Heading">Low-Level Descriptions</span></h4>

<p><a id="X7BFE3679813E5D08" name="X7BFE3679813E5D08"></a></p>

<h5>7.2-1 IsSignedPerm</h5>

<div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">‣ IsSignedPerm</code>( <var class="Arg">arg</var> )</td><td class="tdright">( filter )</td></tr></table></div>
<p>Returns: <code class="keyw">true</code> or <code class="keyw">false</code></p>

<p>Category of signed permutations</p>

<p><a id="X83BC19B8812D211C" name="X83BC19B8812D211C"></a></p>

<h5>7.2-2 ListSignedPerm</h5>

<div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">‣ ListSignedPerm</code>( <var class="Arg">perm</var> )</td><td class="tdright">( operation )</td></tr></table></div>
<p>Convert a signed permutation into a list of images, equivalent to List([1..LargestMovedPoint(s)], x -> x^s);</p>

<p><a id="X7CAA502279CC9A8C" name="X7CAA502279CC9A8C"></a></p>

<h5>7.2-3 ListSignedPerm</h5>

<div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">‣ ListSignedPerm</code>( <var class="Arg">arg1</var>, <var class="Arg">arg2</var> )</td><td class="tdright">( operation )</td></tr></table></div>
<p>Convert a signed permutation to a list of images of length <var class="Arg">len</var>. Arguments perm, len</p>

<p><a id="X7C6AB5A27B2DA2F1" name="X7C6AB5A27B2DA2F1"></a></p>

<h5>7.2-4 SignedPerm</h5>

<div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">‣ SignedPerm</code>( <var class="Arg">arg</var> )</td><td class="tdright">( function )</td></tr></table></div>
<p>Given a list of signed images create a signed permutation object in <code class="func">IsSignedPermListRep</code> (<a href="chap7.html#X8531225C7C224C62"><span class="RefLink">7.2-8</span></a>).</p>

<p><a id="X856041438008B08B" name="X856041438008B08B"></a></p>

<h5>7.2-5 NewSignedPerm</h5>

<div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">‣ NewSignedPerm</code>( <var class="Arg">arg1</var>, <var class="Arg">arg2</var> )</td><td class="tdright">( constructor )</td></tr></table></div>
<p><a id="X82C6D31583C213E1" name="X82C6D31583C213E1"></a></p>

<h5>7.2-6 NewSignedPerm</h5>

<div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">‣ NewSignedPerm</code>( <var class="Arg">arg1</var>, <var class="Arg">arg2</var>, <var class="Arg">arg3</var> )</td><td class="tdright">( constructor )</td></tr></table></div>
<p><a id="X87BCE2B280486669" name="X87BCE2B280486669"></a></p>

<h5>7.2-7 IsSignedPermRep</h5>

<div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">‣ IsSignedPermRep</code>( <var class="Arg">arg</var> )</td><td class="tdright">( filter )</td></tr></table></div>
<p>Returns: <code class="keyw">true</code> or <code class="keyw">false</code></p>

<p>Representation of signed permutations as a permutation and a vector of signs.</p>

<p><a id="X8531225C7C224C62" name="X8531225C7C224C62"></a></p>

<h5>7.2-8 IsSignedPermListRep</h5>

<div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">‣ IsSignedPermListRep</code>( <var class="Arg">arg</var> )</td><td class="tdright">( filter )</td></tr></table></div>
<p>Returns: <code class="keyw">true</code> or <code class="keyw">false</code></p>

<p>Representation of signed permutations as a list of signed images</p>

<p><a id="X8033A20F7A7A60CB" name="X8033A20F7A7A60CB"></a></p>

<h5>7.2-9 OnPosPoints</h5>

<div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">‣ OnPosPoints</code>( <var class="Arg">arg</var> )</td><td class="tdright">( function )</td></tr></table></div>
<p>Only act as a permutation on <span class="SimpleMath">{ 1... n}</span></p>

<p><a id="X84709BF07811FECB" name="X84709BF07811FECB"></a></p>

<h5>7.2-10 LargestMovedPoint</h5>

<div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">‣ LargestMovedPoint</code>( <var class="Arg">arg</var> )</td><td class="tdright">( attribute )</td></tr></table></div>
<p>The largest point that is moved by the signed permutation, where moving includes changing the sign.</p>

<p><a id="X824068057D141DE0" name="X824068057D141DE0"></a></p>

<h5>7.2-11 RandomSignedPermList</h5>

<div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">‣ RandomSignedPermList</code>( <var class="Arg">arg</var> )</td><td class="tdright">( function )</td></tr></table></div>
<p>Create a random list of images that can be used to create a signed permutation.</p>

<p><a id="X85E05F9283E5B099" name="X85E05F9283E5B099"></a></p>

<h5>7.2-12 RandomSignedPerm</h5>

<div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">‣ RandomSignedPerm</code>( <var class="Arg">arg</var> )</td><td class="tdright">( function )</td></tr></table></div>
<p>Create a random signed permutation</p>


<div class="chlinkprevnextbot"> <a href="chap0.html">[Top of Book]</a>   <a href="chap0.html#contents">[Contents]</a>    <a href="chap6.html">[Previous Chapter]</a>    <a href="chapInd.html">[Next Chapter]</a>   </div>


<div class="chlinkbot"><span class="chlink1">Goto Chapter: </span><a href="chap0.html">Top</a>  <a href="chap1.html">1</a>  <a href="chap2.html">2</a>  <a href="chap3.html">3</a>  <a href="chap4.html">4</a>  <a href="chap5.html">5</a>  <a href="chap6.html">6</a>  <a href="chap7.html">7</a>  <a href="chapInd.html">Ind</a>  </div>

<hr />
<p class="foot">generated by <a href="https://www.math.rwth-aachen.de/~Frank.Luebeck/GAPDoc">GAPDoc2HTML</a></p>
</body>
</html>

100%


¤ Dauer der Verarbeitung: 0.15 Sekunden  (vorverarbeitet)  ¤

*© Formatika GbR, Deutschland






Wurzel

Suchen

Beweissystem der NASA

Beweissystem Isabelle

NIST Cobol Testsuite

Cephes Mathematical Library

Wiener Entwicklungsmethode

Haftungshinweis

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.