| products/Sources/formale Sprachen/GAP/pkg/rcwa/doc/chap6.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 (RCWA) - Chapter 6:
Databases of Residue-Class-Wise Affine Groups and -Mappings
</ 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= "chap6" 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="chap8.html">8</a> <a href="chap9.html">9</a> <a href="chapBib.html">Bib</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="chap5.html">[Previous Chapter]</a> <a href="chap7.html">[Next Chapter]</a> </div>
<p id="mathjaxlink" class="pcenter"><a href="chap6_mj.html">[MathJax on]</a></p>
<p><a id="X81BA344979567342" name="X81BA344979567342"></a></p>
<div class="ChapSects"><a href="chap6.html#X81BA344979567342">6 <span class="Heading">
Databases of Residue-Class-Wise Affine Groups and -Mappings
</span></a>
<div class="ContSect"><span class="tocline"><span class="nocss"> </span><a href="chap6.html#X86CCBF017A746F50">6.1 <span class="Heading">The collection of examples</span></a>
</span>
<div class="ContSSBlock">
<span class="ContSS"><br /><span class="nocss"> </span><a href="chap6.html#X8714254784AFD64B">6.1-1 LoadRCWAExamples</a></span>
</div></div>
<div class="ContSect"><span class="tocline"><span class="nocss"> </span><a href="chap6.html#X85DD85DF87DE47C9">6.2 <span class="Heading">Databases of rcwa groups</span></a>
</span>
<div class="ContSSBlock">
<span class="ContSS"><br /><span class="nocss"> </span><a href="chap6.html#X793E2C5C7FC935B8">6.2-1 LoadDatabaseOfGroupsGeneratedBy3ClassTranspositions</a></span>
<span class="ContSS"><br /><span class="nocss"> </span><a href="chap6.html#X7A77F7D57B08E4A5">6.2-2 LoadDatabaseOfGroupsGeneratedBy3ClassTranspositions</a></span>
<span class="ContSS"><br /><span class="nocss"> </span><a href="chap6.html#X792C90B48692D0D7">6.2-3 LoadDatabaseOfGroupsGeneratedBy4ClassTranspositions</a></span>
</div></div>
<div class="ContSect"><span class="tocline"><span class="nocss"> </span><a href="chap6.html#X78A1A8E587C7FFD5">6.3 <span class="Heading">Databases of rcwa mappings</span></a>
</span>
<div class="ContSSBlock">
<span class="ContSS"><br /><span class="nocss"> </span><a href="chap6.html#X843E94467A1BB86C">6.3-1 LoadDatabaseOfProductsOf2ClassTranspositions</a></span>
<span class="ContSS"><br /><span class="nocss"> </span><a href="chap6.html#X85B492697ACC4A54">6.3-2 LoadDatabaseOfNonbalancedProductsOfClassTranspositions</a></span>
</div></div>
</div>
<h3>6 <span class="Heading">
Databases of Residue-Class-Wise Affine Groups and -Mappings
</span></h3>
<p>The <strong class="pkg">RCWA</strong> package contains a number of databases of rcwa groups and rcwa mappings. They can be loaded into a <strong class="pkg">GAP</strong> session by the functions described in this chapter.</p>
<p><a id="X86CCBF017A746F50" name="X86CCBF017A746F50"></a></p>
<h4>6.1 <span class="Heading">The collection of examples</span></h4>
<p><a id="X8714254784AFD64B" name="X8714254784AFD64B"></a></p>
<h5>6.1-1 LoadRCWAExamples</h5>
<div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">an style='color: green'>8227; LoadRCWAExamples</code>( )</td><td class="tdright">( function )</td></tr></table></div>
<p>Returns: the name of the variable to which the record containing the collection of examples of rcwa groups and -mappings loaded from the file <code class="file">pkg/rcwa/examples/examples.g</code> got bound.</p>
<p>The components of the examples record are records which contain the individual groups and mappings. A detailed description of some of the examples can be found in Chapter <a href="chap7.html#X7A489A5D79DA9E5C"><span class="RefLink">7</span></a>.</p>
<div class="example"><pre>
<span class="GAPprompt">gap></span> <span class="GAPinput">LoadRCWAExamples();</span>
"RCWAExamples"
<span class="GAPprompt">gap></span> <span class="GAPinput">Set(RecNames(RCWAExamples));</span>
[ "AbelianGroupOverPolynomialRing", "Basics", "CT3Z", "CTPZ",
"CheckingForSolvability", "ClassSwitches",
"ClassTranspositionProducts", "ClassTranspositionsAsCommutators",
"CollatzFactorizationOld", "CollatzMapping", "CollatzlikePerms",
"CoprimeMultDiv", "F2_PSL2Z", "Farkas", "FiniteQuotients",
"FiniteVsDenseCycles", "GF2xFiniteCycles", "GrigorchukQuotients",
"Hexagon", "HicksMullenYucasZavislak", "HigmanThompson",
"LongCyclesOfPrimeLength", "MatthewsLeigh",
"MaybeInfinitelyPresentedGroup", "ModuliOfPowers",
"OddNumberOfGens_FiniteOrder", "Semilocals",
"SlowlyContractingMappings", "Syl3_S9", "SymmetrizingCollatzTree",
"TameGroupByCommsOfWildPerms", "Venturini", "ZxZ" ]
<span class="GAPprompt">gap></span> <span class="GAPinput">AssignGlobals(RCWAExamples.CollatzMapping);</span>
The following global variables have been assigned:
[ "T", "T5", "T5m", "T5p", "Tm", "Tp" ]
</pre></div>
<p><a id="X85DD85DF87DE47C9" name="X85DD85DF87DE47C9"></a></p>
<h4>6.2 <span class="Heading">Databases of rcwa groups</span></h4>
<p><a id="X793E2C5C7FC935B8" name="X793E2C5C7FC935B8"></a></p>
<h5>6.2-1 LoadDatabaseOfGroupsGeneratedBy3ClassTranspositions</h5>
<div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">an style='color: green'>8227; LoadDatabaseOfGroupsGeneratedBy3ClassTranspositions</code>( )</td><td class="tdright">( function )</td></tr></table></div>
<p>Returns: the name of the variable to which the record containing the database of all groups generated by 3 class transpositions which interchange residue classes with moduli <span class="SimpleMath">≤ 6</span> got bound.</p>
<p>The database record has at least the following components (the index <code class="code">i</code> is always an integer in the range <code class="code">[1..52394]</code>, and the term <q>indices</q> always refers to list indices in that range):</p>
<dl>
<dt><strong class="Mark"><code class="code">cts</code></strong></dt>
<dd><p>The list of all 69 class transpositions which interchange residue classes with moduli <span class="SimpleMath">≤ 6</span>.</p>
</dd>
<dt><strong class="Mark"><code class="code">grps</code></strong></dt>
<dd><p>The list of the 52394 groups -- 21948 finite and 30446 infinite ones.</p>
</dd>
<dt><strong class="Mark"><code class="code">sizes</code></strong></dt>
<dd><p>The list of group orders -- it is <code class="code">Size(grps[i]) = sizes[i]</code>.</p>
</dd>
<dt><strong class="Mark"><code class="code">mods</code></strong></dt>
<dd><p>The list of moduli of the groups -- it is <code class="code">Mod(grps[i]) = mods[i]</code>.</p>
</dd>
<dt><strong class="Mark"><code class="code">equalityclasses</code></strong></dt>
<dd><p>A list of lists of indices <code class="code">i</code> of groups which are known to be equal, i.e. if <code class="code">i</code> and <code class="code">j</code> lie in the same list, then <code class="code">grps[i] = grps[j]</code>.</p>
</dd>
<dt><strong class="Mark"><code class="code">samegroups</code></strong></dt>
<dd><p>A list of lists, where <code class="code">samegroups[i]</code> is a list of indices of groups which are known to be equal to <code class="code">grps[i]</code>.</p>
</dd>
<dt><strong class="Mark"><code class="code">conjugacyclasses</code></strong></dt>
<dd><p>A list of lists of indices of groups which are known to be conjugate in RCWA(ℤ).</p>
</dd>
<dt><strong class="Mark"><code class="code">subgroups</code></strong></dt>
<dd><p>A list of lists, where <code class="code">subgroups[i]</code> is a list of indices of groups which are known to be proper subgroups of <code class="code">grps[i]</code>.</p>
</dd>
<dt><strong class="Mark"><code class="code">supergroups</code></strong></dt>
<dd><p>A list of lists, where <code class="code">supergroups[i]</code> is a list of indices of groups which are known to be proper supergroups of <code class="code">grps[i]</code>.</p>
</dd>
<dt><strong class="Mark"><code class="code">chains</code></strong></dt>
<dd><p>A list of lists, where each list contains the indices of the groups in a descending chain of subgroups.</p>
</dd>
<dt><strong class="Mark"><code class="code">respectedpartitions</code></strong></dt>
<dd><p>The list of shortest respected partitions. If <code class="code">grps[i]</code> is finite, then <code class="code">respectedpartitions[i]</code> is a list of pairs (residue, modulus) for the residue classes in the shortest respected partition <code class="code">grps[i]</code>. If <code class="code">grps[i]</code> is infinite, then <code class="code">respectedpartitions[i] = fail</code>.</p>
</dd>
<dt><strong class="Mark"><code class="code">partitionlengths</code></strong></dt>
<dd><p>The list of lengths of shortest respected partitions. If the group <code class="code">grps[i]</code> is finite, then <code class="code">partitionlengths[i]</code> is the length of the shortest respected partition of <code class="code">grps[i]</code>. If <code class="code">grps[i]</code> is infinite, then <code class="code">partitionlengths[i] = 0</code>.</p>
</dd>
<dt><strong class="Mark"><code class="code">degrees</code></strong></dt>
<dd><p>The list of permutation degrees, i.e. numbers of moved points, in the action of the finite groups on their shortest respected partitions. If there is no respected partition, i.e. if <code class="code">grps[i]</code> is infinite, then <code class="code">degrees[i] = 0</code>.</p>
</dd>
<dt><strong class="Mark"><code class="code">orbitlengths</code></strong></dt>
<dd><p>The list of lists of orbit lengths in the action of the finite groups on their shortest respected partitions. If <code class="code">grps[i]</code> is infinite, then <code class="code">orbitlengths[i] = fail</code>.</p>
</dd>
<dt><strong class="Mark"><code class="code">permgroupgens</code></strong></dt>
<dd><p>The list of lists of generators of the isomorphic permutation groups induced by the finite groups on their shortest respected partitions. If <code class="code">grps[i]</code> is infinite, then <code class="code">permgroupgens[i] = fail</code>.</p>
</dd>
<dt><strong class="Mark"><code class="code">stabilize_digitsum_base2_mod2</code></strong></dt>
<dd><p>The list of indices of groups which stabilize the digit sum in base 2 modulo 2.</p>
</dd>
<dt><strong class="Mark"><code class="code">stabilize_digitsum_base2_mod3</code></strong></dt>
<dd><p>The list of indices of groups which stabilize the digit sum in base 2 modulo 3.</p>
</dd>
<dt><strong class="Mark"><code class="code">stabilize_digitsum_base3_mod2</code></strong></dt>
<dd><p>The list of indices of groups which stabilize the digit sum in base 3 modulo 2.</p>
</dd>
<dt><strong class="Mark"><code class="code">freeproductcandidates</code></strong></dt>
<dd><p>A list of indices of groups which may be isomorphic to the free product of 3 copies of the cyclic group of order 2.</p>
</dd>
<dt><strong class="Mark"><code class="code">freeproductlikes</code></strong></dt>
<dd><p>A list of indices of groups which are not isomorphic to the free product of 3 copies of the cyclic group of order 2, but where the shortest relation indicating this is relatively long.</p>
</dd>
<dt><strong class="Mark"><code class="code">abc_torsion</code></strong></dt>
<dd><p>A list of pairs (index, order of product of generators) for all infinite groups for which the product of the generators has finite order.</p>
</dd>
<dt><strong class="Mark"><code class="code">cyclist</code></strong></dt>
<dd><p>A list described in the comments in <code class="file">rcwa/data/3ctsgroups6/spheresizecycles.g</code>.</p>
</dd>
<dt><strong class="Mark"><code class="code">finiteorbits</code></strong></dt>
<dd><p>A record described in the comments in <code class="file">rcwa/data/3ctsgroups6/finite-orbits.g</code>.</p>
</dd>
<dt><strong class="Mark"><code class="code">intransitivemodulo</code></strong></dt>
<dd><p>For every modulus <code class="code">m</code> from 1 to 60, <code class="code">intransitivemodulo[m]</code> is the list of indices of groups none of whose orbits on ℤ has nontrivial intersection with all residue classes modulo <code class="code">m</code>.</p>
</dd>
<dt><strong class="Mark"><code class="code">trsstatus</code></strong></dt>
<dd><p>A list of strings which describe what is known about whether the groups <code class="code">grps[i]</code> act transitively on the nonnegative integers in their support, or how the computation has failed.</p>
</dd>
<dt><strong class="Mark"><code class="code">orbitgrowthtype</code></strong></dt>
<dd><p>A list of integers and lists of integers which encode what has been observed heuristically on the growth of the orbits of the groups <code class="code">grps[i]</code> on ℤ.</p>
</dd>
</dl>
<p>Note that the database contains an entry for every unordered 3-tuple of distinct class transpositions in <code class="code">cts</code>, which means that it contains multiple copies of equal groups -- cf. the components <code class="code">equalityclasses</code> and <code class="code">samegroups</code> described above.</p>
<p>To mention an example, the group <code class="code">grps[44132]</code> might be called the <q>Collatz group</q> -- its action on the set of positive integers which are not multiples of 6 is transitive if and only if the Collatz conjecture holds.</p>
<div class="example"><pre>
<span class="GAPprompt">gap></span> <span class="GAPinput">LoadDatabaseOfGroupsGeneratedBy3ClassTranspositions();</span>
"3CTsGroups6"
<span class="GAPprompt">gap></span> <span class="GAPinput">AssignGlobals(3CTsGroups6); # for convenience</span>
The following global variables have been assigned:
[ "3CTsGroupsWithGivenOrbit", "Id3CTsGroup",
"ProbablyFixesDigitSumsModulo", "ProbablyStabilizesDigitSumsModulo",
"TriangleTypes", "abc_torsion", "chains", "conjugacyclasses", "cts",
"cyclist", "degrees", "epifromfpgroupto_ct23z",
"epifromfpgrouptocollatzgroup_c", "epifromfpgrouptocollatzgroup_t",
"equalityclasses", "finiteorbits", "freeproductcandidates",
"freeproductlikes", "groups", "grps", "intransitivemodulo",
"minwordlengthcoprimemultdiv", "minwordlengthnonbalanced", "mods",
"orbitgrowthtype", "orbitlengths", "partitionlengths", "permgroupgens",
"redundant_generator", "refinementseqlngs", "respectedpartitions",
"samegroups", "shortresidueclassorbitlengths", "sizes", "sizespos",
"sizesset", "spheresizebound_12", "spheresizebound_24",
"spheresizebound_4", "spheresizebound_6",
"stabilize_digitsum_base2_mod2", "stabilize_digitsum_base2_mod3",
"stabilize_digitsum_base3_mod2", "subgroups", "supergroups",
"trsstatus", "trsstatuspos", "trsstatusset" ]
<span class="GAPprompt">gap></span> <span class="GAPinput">grps[44132]; # the "3n+1 group"</span>
<(2(3),4(6)),(1(3),2(6)),(1(2),4(6))>
<span class="GAPprompt">gap></span> <span class="GAPinput">trsstatus[44132]; # deciding this would solve the 3n+1 problem</span>
"exceeded memory bound"
<span class="GAPprompt">gap></span> <span class="GAPinput">Length(Set(sizes));</span>
1066
<span class="GAPprompt">gap></span> <span class="GAPinput">Maximum(Filtered(sizes,IsInt)); # order of largest finite group stored</span>
7165033589793852697531456980706732548435609645091822296777976465116824959\
2135499174617837911754921014138184155204934961004073853323458315539461543\
4480515260818409913846161473536000000000000000000000000000000000000000000\
000000
<span class="GAPprompt">gap></span> <span class="GAPinput">PrintFactorsInt(last); </span>
2^200*3^103*5^48*7^28*11^16*13^13*17^8*19^6*23^6*29
<span class="GAPprompt">gap></span> <span class="GAPinput">Positions(sizes,last); </span>
[ 33814, 36548 ]
<span class="GAPprompt">gap></span> <span class="GAPinput">grps{last};</span>
[ <(1(5),4(5)),(0(3),1(6)),(3(4),0(6))>,
<(0(5),3(5)),(2(3),4(6)),(0(4),5(6))> ]
<span class="GAPprompt">gap></span> <span class="GAPinput">samegroups[1]; </span>
[ 1, 2, 68 ]
<span class="GAPprompt">gap></span> <span class="GAPinput">grps[1] = grps[68];</span>
true
<span class="GAPprompt">gap></span> <span class="GAPinput">Maximum(mods);</span>
77760
<span class="GAPprompt">gap></span> <span class="GAPinput">Positions(mods,last);</span>
[ 26311, 26313, 26452, 26453, 26455, 26456, 26457, 26459, 26461, 26462,
27781, 27784, 27785, 27786, 27788, 27789, 27790, 27791, 27829, 27832,
30523, 30524, 30525, 30526, 30529, 30530, 30532, 30534, 32924, 32927,
32931, 32933 ]
<span class="GAPprompt">gap></span> <span class="GAPinput">Set(sizes{last}); </span>
[ 45509262704640000 ]
<span class="GAPprompt">gap></span> <span class="GAPinput">Collected(mods);</span>
[ [ 0, 30446 ], [ 3, 1 ], [ 4, 37 ], [ 5, 120 ], [ 6, 1450 ], [ 8, 18 ],
[ 10, 45 ], [ 12, 3143 ], [ 15, 165 ], [ 18, 484 ], [ 20, 528 ],
[ 24, 1339 ], [ 30, 2751 ], [ 36, 2064 ], [ 40, 26 ], [ 48, 515 ],
[ 60, 2322 ], [ 72, 2054 ], [ 80, 44 ], [ 90, 108 ], [ 96, 108 ],
[ 108, 114 ], [ 120, 782 ], [ 144, 310 ], [ 160, 26 ], [ 180, 206 ],
[ 192, 6 ], [ 216, 72 ], [ 240, 304 ], [ 270, 228 ], [ 288, 14 ],
[ 360, 84 ], [ 432, 36 ], [ 480, 218 ], [ 540, 18 ], [ 720, 120 ],
[ 810, 112 ], [ 864, 8 ], [ 960, 94 ], [ 1080, 488 ], [ 1620, 44 ],
[ 1920, 38 ], [ 2160, 506 ], [ 3240, 34 ], [ 3840, 12 ],
[ 4320, 218 ], [ 4860, 16 ], [ 6480, 282 ], [ 7680, 10 ],
[ 8640, 16 ], [ 12960, 120 ], [ 14580, 2 ], [ 25920, 34 ],
[ 30720, 2 ], [ 38880, 12 ], [ 51840, 8 ], [ 77760, 32 ] ]
<span class="GAPprompt">gap></span> <span class="GAPinput">Collected(trsstatus);</span>
[ [ "> 1 orbit (mod m)", 593 ],
[ "Mod(U DecreasingOn) exceeded <maxmod>", 23 ],
[ "U DecreasingOn stable and exceeded memory bound", 11 ],
[ "U DecreasingOn stable for <maxeq> steps", 5753 ],
[ "exceeded memory bound", 497 ], [ "finite", 21948 ],
[ "intransitive, but finitely many orbits", 8 ],
[ "seemingly only finite orbits (long)", 1227 ],
[ "seemingly only finite orbits (medium)", 2501 ],
[ "seemingly only finite orbits (short)", 4816 ],
[ "seemingly only finite orbits (very long)", 230 ],
[ "seemingly only finite orbits (very long, very unclear)", 76 ],
[ "seemingly only finite orbits (very short)", 208 ],
[ "there are infinite orbits which have exponential sphere size growth"
, 2934 ],
[ "there are infinite orbits which have linear sphere size growth",
10881 ],
[ "there are infinite orbits which have unclear sphere size growth",
86 ], [ "transitive", 562 ],
[ "transitive up to one finite orbit", 40 ] ]
</pre></div>
<p><a id="X7A77F7D57B08E4A5" name="X7A77F7D57B08E4A5"></a></p>
<h5>6.2-2 LoadDatabaseOfGroupsGeneratedBy3ClassTranspositions</h5>
<div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">an style='color: green'>8227; LoadDatabaseOfGroupsGeneratedBy3ClassTranspositions</code>( <var class="Arg">max_m</var> )</td><td class="tdright">( function )</td></tr></table></div>
<p>Returns: the name of the variable to which the record containing the database of all groups generated by 3 class transpositions which interchange residue classes with moduli less than or equal to <var class="Arg">max_m</var> got bound, where <var class="Arg">max_m</var> is either 6 or 9.</p>
<p>If <var class="Arg">max_m</var> is 6, this is equivalent to the call of the function without argument described above. If <var class="Arg">max_m</var> is 9, the function returns a record with at least the following components (in the sequel, the indices <code class="code">i > j > k</code> are always integers in the range <code class="code">[1..264]</code>):</p>
<dl>
<dt><strong class="Mark"><code class="code">cts</code></strong></dt>
<dd><p>The list of all 264 class transpositions which interchange residue classes with moduli <span class="SimpleMath">≤ 9</span>.</p>
</dd>
<dt><strong class="Mark"><code class="code">mods</code></strong></dt>
<dd><p>The list of moduli of the groups, i.e. <code class="code">Mod(Group(cts{[i,j,k]})) = mods[i][j][k]</code>.</p>
</dd>
<dt><strong class="Mark"><code class="code">partlengths</code></strong></dt>
<dd><p>The list of lengths of shortest respected partitions of the groups in the database, i.e. <code class="code">Length(RespectedPartition(Group(cts{[i,j,k]})))</code> <code class="code">=</code> <code class="code">partlengths[i][j][k]</code>.</p>
</dd>
<dt><strong class="Mark"><code class="code">sizes</code></strong></dt>
<dd><p>The list of orders of the groups, i.e. <code class="code">Size(Group(cts{[i,j,k]}))</code> <code class="code">=</code> <code class="code">sizes[i][j][k]</code>.</p>
</dd>
<dt><strong class="Mark"><code class="code">All3CTs9Indices</code></strong></dt>
<dd><p>A selector function which takes as argument a function <var class="Arg">func</var> of three arguments <var class="Arg">i</var>, <var class="Arg">j</var> and <var class="Arg">k</var>. It returns a list of all triples of indices <code class="code">[<var class="Arg">i</var>,<var class="Arg">j</var>,<var class="Arg">k</var>]</code> where <span class="SimpleMath">264 ≥ i > j > k ≥ 1</span> for which <var class="Arg">func</var> returns <code class="code">true</code>.</p>
</dd>
<dt><strong class="Mark"><code class="code">All3CTs9Groups</code></strong></dt>
<dd><p>A selector function which takes as argument a function <var class="Arg">func</var> of three arguments <var class="Arg">i</var>, <var class="Arg">j</var> and <var class="Arg">k</var>. It returns a list of all groups <code class="code">Group(cts{[<var class="Arg">i</var>,<var class="Arg">j</var>,<var class="Arg">k</var>]})</code> from the database for which <code class="code"><var class="Arg">func</var>(<var class="Arg">i</var>,<var class="Arg">j</var>,<var class="Arg">k</var>)</code> returns <code class="code">true</code>.</p>
</dd>
</dl>
<div class="example"><pre>
<span class="GAPprompt">gap></span> <span class="GAPinput">LoadDatabaseOfGroupsGeneratedBy3ClassTranspositions(9);</span>
"3CTsGroups9"
<span class="GAPprompt">gap></span> <span class="GAPinput">AssignGlobals(3CTsGroups9);</span>
The following global variables have been assigned:
[ "All3CTs9Groups", "All3CTs9Indices", "cts", "mods", "partlengths",
"sizes" ]
<span class="GAPprompt">gap></span> <span class="GAPinput">PrintFactorsInt(Maximum(Filtered(Flat(sizes),n->n<>infinity)));</span>
2^1283*3^673*5^305*7^193*11^98*13^84*17^50*19^41*23^25*29^13*31^4
</pre></div>
<p><a id="X792C90B48692D0D7" name="X792C90B48692D0D7"></a></p>
<h5>6.2-3 LoadDatabaseOfGroupsGeneratedBy4ClassTranspositions</h5>
<div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">an style='color: green'>8227; LoadDatabaseOfGroupsGeneratedBy4ClassTranspositions</code>( )</td><td class="tdright">( function )</td></tr></table></div>
<p>Returns: the name of the variable to which the record containing the database of all groups generated by 4 class transpositions which interchange residue classes with moduli <span class="SimpleMath">≤ 6</span> for which all subgroups generated by 3 out of the 4 generators are finite got bound.</p>
<p>The record has at least the following components (the index <code class="code">i</code> is always an integer in the range <code class="code">[1..140947]</code>, and the term <q>indices</q> always refers to list indices in that range):</p>
<dl>
<dt><strong class="Mark"><code class="code">cts</code></strong></dt>
<dd><p>The list of all 69 class transpositions which interchange residue classes with moduli <span class="SimpleMath">≤ 6</span>.</p>
</dd>
<dt><strong class="Mark"><code class="code">grps4_3finite</code></strong></dt>
<dd><p>The list of all 140947 groups in the database.</p>
</dd>
<dt><strong class="Mark"><code class="code">grps4_3finitepos</code></strong></dt>
<dd><p>The list obtained from <code class="code">grps4_3finite</code> by replacing every group by the list of positions of its generators in the list <code class="code">cts</code>.</p>
</dd>
<dt><strong class="Mark"><code class="code">sizes4</code></strong></dt>
<dd><p>The list of group orders -- it is <code class="code">Size(grps4_3finite[i]) = sizes4[i]</code>.</p>
</dd>
<dt><strong class="Mark"><code class="code">mods4</code></strong></dt>
<dd><p>The list of moduli of the groups -- it is <code class="code">Mod(grps4_3finite[i]) = mods4[i]</code>.</p>
</dd>
<dt><strong class="Mark"><code class="code">conjugacyclasses4cts</code></strong></dt>
<dd><p>A list of lists of indices of groups which are known to be conjugate in RCWA(ℤ).</p>
</dd>
<dt><strong class="Mark"><code class="code">grps4_3finite_reps</code></strong></dt>
<dd><p>Tentative conjugacy class representatives from the list <code class="code">grps4_3finite</code> -- <em>tentative</em> in the sense that likely some of the groups in the list are still conjugate.</p>
</dd>
</dl>
<p>Note that the database contains an entry for every suitable unordered 4-tuple of distinct class transpositions in <code class="code">cts</code>, which means that it contains multiple copies of equal groups.</p>
<div class="example"><pre>
<span class="GAPprompt">gap></span> <span class="GAPinput">LoadDatabaseOfGroupsGeneratedBy4ClassTranspositions(); </span>
"4CTsGroups6"
<span class="GAPprompt">gap></span> <span class="GAPinput">AssignGlobals(4CTsGroups6);</span>
The following global variables have been assigned:
[ "conjugacyclasses4cts", "cts", "grps4_3finite", "grps4_3finite_reps",
"grps4_3finitepos", "mods4", "sizes4", "sizes4pos", "sizes4set" ]
<span class="GAPprompt">gap></span> <span class="GAPinput">Length(grps4_3finite);</span>
140947
<span class="GAPprompt">gap></span> <span class="GAPinput">Length(sizes4);</span>
140947
<span class="GAPprompt">gap></span> <span class="GAPinput">Size(grps4_3finite[1]);</span>
518400
<span class="GAPprompt">gap></span> <span class="GAPinput">sizes4[1];</span>
518400
<span class="GAPprompt">gap></span> <span class="GAPinput">Maximum(Filtered(sizes4,IsInt));</span>
<integer 420...000 (3852 digits)>
<span class="GAPprompt">gap></span> <span class="GAPinput">Modulus(grps4_3finite[1]);</span>
12
<span class="GAPprompt">gap></span> <span class="GAPinput">mods4[1];</span>
12
<span class="GAPprompt">gap></span> <span class="GAPinput">Length(Set(sizes4));</span>
7339
<span class="GAPprompt">gap></span> <span class="GAPinput">Length(Set(mods4));</span>
91
<span class="GAPprompt">gap></span> <span class="GAPinput">conjugacyclasses4cts{[1..4]};</span>
[ [ 1, 23, 563, 867 ], [ 2, 859 ], [ 3, 622 ], [ 4, 16, 868, 873 ] ]
<span class="GAPprompt">gap></span> <span class="GAPinput">grps4_3finite[1] = grps4_3finite[23];</span>
true
<span class="GAPprompt">gap></span> <span class="GAPinput">grps4_3finite[4] = grps4_3finite[16];</span>
false
</pre></div>
<p><a id="X78A1A8E587C7FFD5" name="X78A1A8E587C7FFD5"></a></p>
<h4>6.3 <span class="Heading">Databases of rcwa mappings</span></h4>
<p><a id="X843E94467A1BB86C" name="X843E94467A1BB86C"></a></p>
<h5>6.3-1 LoadDatabaseOfProductsOf2ClassTranspositions</h5>
<div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">an style='color: green'>8227; LoadDatabaseOfProductsOf2ClassTranspositions</code>( )</td><td class="tdright">( function )</td></tr></table></div>
<p>Returns: the name of the variable to which the record containing the database of products of 2 class transpositions got bound.</p>
<p>There are 69 class transpositions which interchange residue classes with moduli <span class="SimpleMath">≤ 6</span>, thus there is a total of <span class="SimpleMath">(69 ⋅ 68)/2 = 2346</span> unordered pairs of distinct such class transpositions. Looking at intersection- and subset relations between the 4 involved residue classes, we can distinguish 17 different <q>intersection types</q> (or 18, together with the trivial case of equal class transpositions). The intersection type does not fully determine the cycle structure of the product. -- In total, we can distinguish 88 different cycle types of products of 2 class transpositions which interchange residue classes with moduli <span class="SimpleMath">≤ 6</span>.</p>
<p>The components of the database record are a list <code class="code">CTPairs</code> of all 2346 pairs of distinct class transpositions which interchange residue classes with moduli <span class="SimpleMath">≤ 6</span>, functions <code class="code">CTPairsIntersectionTypes</code>, <code class="code">CTPairIntersectionType</code> and <code class="code">CTPairProductType</code>, as well as data lists <code class="code">OrdersMatrix</code>, <code class="code">CTPairsProductClassification</code>, <code class="code">CTPairsProductType</code>, <code class="code">CTProds12</code> and <code class="code">CTProds32</code>. -- For the description of these components, see the file <code class="file">pkg/rcwa/data/ctproducts/ctprodclass.g</code>.</p>
<div class="example"><pre>
<span class="GAPprompt">gap></span> <span class="GAPinput">LoadDatabaseOfProductsOf2ClassTranspositions();</span>
"CTProducts"
<span class="GAPprompt">gap></span> <span class="GAPinput">Set(RecNames(CTProducts));</span>
[ "CTPairIntersectionType", "CTPairProductType", "CTPairs",
"CTPairsIntersectionTypes", "CTPairsProductClassification",
"CTPairsProductType", "CTProds12", "CTProds32", "OrdersMatrix" ]
<span class="GAPprompt">gap></span> <span class="GAPinput">Length(CTProducts.CTPairs);</span>
2346
<span class="GAPprompt">gap></span> <span class="GAPinput">Collected(List(CTProducts.CTPairsProductType,l->l[2])); # order stats</span>
[ [ 2, 165 ], [ 3, 255 ], [ 4, 173 ], [ 6, 693 ], [ 10, 2 ],
[ 12, 345 ], [ 15, 4 ], [ 20, 10 ], [ 30, 120 ], [ 60, 44 ],
[ infinity, 535 ] ]
</pre></div>
<p><a id="X85B492697ACC4A54" name="X85B492697ACC4A54"></a></p>
<h5>6.3-2 LoadDatabaseOfNonbalancedProductsOfClassTranspositions</h5>
<div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">an style='color: green'>8227; LoadDatabaseOfNonbalancedProductsOfClassTranspositions</code>( )</td><td class="tdright">( function )</td></tr></table></div>
<p>Returns: the name of the variable to which the record containing the database of non-balanced products of class transpositions got bound.</p>
<p>This database contains a list of the 24 pairs of class transpositions which interchange residue classes with moduli <span class="SimpleMath">≤ 6</span> and whose product is not balanced, as well as a list of all 36 essentially distinct triples of such class transpositions whose product has coprime multiplier and divisor.</p>
<div class="example"><pre>
<span class="GAPprompt">gap></span> <span class="GAPinput">LoadDatabaseOfNonbalancedProductsOfClassTranspositions();</span>
"CTProductsNB"
<span class="GAPprompt">gap></span> <span class="GAPinput">Set(RecNames(CTProductsNB));</span>
[ "PairsOfCTsWhoseProductIsNotBalanced",
"TriplesOfCTsWhoseProductHasCoprimeMultiplierAndDivisor" ]
<span class="GAPprompt">gap></span> <span class="GAPinput">CTProductsNB.PairsOfCTsWhoseProductIsNotBalanced;</span>
[ [ ( 1(2), 2(4) ), ( 2(4), 3(6) ) ], [ ( 1(2), 2(4) ), ( 2(4), 5(6) ) ],
[ ( 1(2), 2(4) ), ( 2(4), 1(6) ) ], [ ( 1(2), 0(4) ), ( 0(4), 1(6) ) ],
[ ( 1(2), 0(4) ), ( 0(4), 3(6) ) ], [ ( 1(2), 0(4) ), ( 0(4), 5(6) ) ],
[ ( 0(2), 1(4) ), ( 1(4), 2(6) ) ], [ ( 0(2), 1(4) ), ( 1(4), 4(6) ) ],
[ ( 0(2), 1(4) ), ( 1(4), 0(6) ) ], [ ( 0(2), 3(4) ), ( 3(4), 4(6) ) ],
[ ( 0(2), 3(4) ), ( 3(4), 2(6) ) ], [ ( 0(2), 3(4) ), ( 3(4), 0(6) ) ],
[ ( 1(2), 2(6) ), ( 3(4), 2(6) ) ], [ ( 1(2), 2(6) ), ( 1(4), 2(6) ) ],
[ ( 1(2), 4(6) ), ( 3(4), 4(6) ) ], [ ( 1(2), 4(6) ), ( 1(4), 4(6) ) ],
[ ( 1(2), 0(6) ), ( 1(4), 0(6) ) ], [ ( 1(2), 0(6) ), ( 3(4), 0(6) ) ],
[ ( 0(2), 1(6) ), ( 2(4), 1(6) ) ], [ ( 0(2), 1(6) ), ( 0(4), 1(6) ) ],
[ ( 0(2), 3(6) ), ( 2(4), 3(6) ) ], [ ( 0(2), 3(6) ), ( 0(4), 3(6) ) ],
[ ( 0(2), 5(6) ), ( 2(4), 5(6) ) ], [ ( 0(2), 5(6) ), ( 0(4), 5(6) ) ]
]
</pre></div>
<div class="chlinkprevnextbot"> <a href="chap0.html">[Top of Book]</a> <a href="chap0.html#contents">[Contents]</a> <a href="chap5.html">[Previous Chapter]</a> <a href="chap7.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="chap8.html">8</a> <a href="chap9.html">9</a> <a href="chapBib.html">Bib</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>
¤ Dauer der Verarbeitung: 0.25 Sekunden
¤
*© Formatika GbR, Deutschland
|
|