Debian Codegraph @

doc/chap1_mj.html

raw
1 <?xml version="1.0" encoding="UTF-8"?>
2
3 <!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Strict//EN"
4 "http://www.w3.org/TR/xhtml1/DTD/xhtml1-strict.dtd">
5
6 <html xmlns="http://www.w3.org/1999/xhtml" xml:lang="en">
7 <head>
8 <script type="text/javascript"
9 src="https://cdn.jsdelivr.net/npm/mathjax@2/MathJax.js?config=TeX-AMS-MML_HTMLorMML">
10 </script>
11 <title>GAP (smallgrp) - Chapter 1: The Small Groups Library</title>
12 <meta http-equiv="content-type" content="text/html; charset=UTF-8" />
13 <meta name="generator" content="GAPDoc2HTML" />
14 <link rel="stylesheet" type="text/css" href="manual.css" />
15 <script src="manual.js" type="text/javascript"></script>
16 <script type="text/javascript">overwriteStyle();</script>
17 </head>
18 <body class="chap1" onload="jscontent()">
19
20
21 <div class="chlinktop"><span class="chlink1">Goto Chapter: </span><a href="chap0_mj.html">Top</a> <a href="chap1_mj.html">1</a> <a href="chapBib_mj.html">Bib</a> <a href="chapInd_mj.html">Ind</a> </div>
22
23 <div class="chlinkprevnexttop">&nbsp;<a href="chap0_mj.html">[Top of Book]</a>&nbsp; <a href="chap0_mj.html#contents">[Contents]</a>&nbsp; &nbsp;<a href="chap0_mj.html">[Previous Chapter]</a>&nbsp; &nbsp;<a href="chapBib_mj.html">[Next Chapter]</a>&nbsp; </div>
24
25 <p id="mathjaxlink" class="pcenter"><a href="chap1.html">[MathJax off]</a></p>
26 <p><a id="X7C16EA1580AC7586" name="X7C16EA1580AC7586"></a></p>
27 <div class="ChapSects"><a href="chap1_mj.html#X7C16EA1580AC7586">1 <span class="Heading">The Small Groups Library</span></a>
28 <div class="ContSect"><span class="tocline"><span class="nocss">&nbsp;</span><a href="chap1_mj.html#X8389AD927B74BA4A">1.1 <span class="Heading">Overview</span></a>
29 </span>
30 </div>
31 <div class="ContSect"><span class="tocline"><span class="nocss">&nbsp;</span><a href="chap1_mj.html#X7ECCCA82839EA283">1.2 <span class="Heading">Function Reference</span></a>
32 </span>
33 <div class="ContSSBlock">
34 <span class="ContSS"><br /><span class="nocss">&nbsp;&nbsp;</span><a href="chap1_mj.html#X8398F2577B719D99">1.2-1 SmallGroup</a></span>
35 <span class="ContSS"><br /><span class="nocss">&nbsp;&nbsp;</span><a href="chap1_mj.html#X781EA70A7902B22C">1.2-2 SmallGroupsAvailable</a></span>
36 <span class="ContSS"><br /><span class="nocss">&nbsp;&nbsp;</span><a href="chap1_mj.html#X7BB133CB7AA8F465">1.2-3 AllSmallGroups</a></span>
37 <span class="ContSS"><br /><span class="nocss">&nbsp;&nbsp;</span><a href="chap1_mj.html#X875EB1167FF6BA82">1.2-4 OneSmallGroup</a></span>
38 <span class="ContSS"><br /><span class="nocss">&nbsp;&nbsp;</span><a href="chap1_mj.html#X7C587F2A82BEAD19">1.2-5 NumberSmallGroups</a></span>
39 <span class="ContSS"><br /><span class="nocss">&nbsp;&nbsp;</span><a href="chap1_mj.html#X872991747D5CFD35">1.2-6 NumberSmallGroupsAvailable</a></span>
40 <span class="ContSS"><br /><span class="nocss">&nbsp;&nbsp;</span><a href="chap1_mj.html#X7B5A1FD47C722EB2">1.2-7 SelectSmallGroups</a></span>
41 <span class="ContSS"><br /><span class="nocss">&nbsp;&nbsp;</span><a href="chap1_mj.html#X83044B9D7E3BDF35">1.2-8 IdSmallGroup</a></span>
42 <span class="ContSS"><br /><span class="nocss">&nbsp;&nbsp;</span><a href="chap1_mj.html#X7C0C616180DE5875">1.2-9 IdGroupsAvailable</a></span>
43 <span class="ContSS"><br /><span class="nocss">&nbsp;&nbsp;</span><a href="chap1_mj.html#X85352440869327EC">1.2-10 IdsOfAllSmallGroups</a></span>
44 <span class="ContSS"><br /><span class="nocss">&nbsp;&nbsp;</span><a href="chap1_mj.html#X8162304487D0C3E2">1.2-11 IdGap3SolvableGroup</a></span>
45 <span class="ContSS"><br /><span class="nocss">&nbsp;&nbsp;</span><a href="chap1_mj.html#X833DB8AB80B76D26">1.2-12 SmallGroupsInformation</a></span>
46 <span class="ContSS"><br /><span class="nocss">&nbsp;&nbsp;</span><a href="chap1_mj.html#X850CC04E7855FF68">1.2-13 UnloadSmallGroupsData</a></span>
47 <span class="ContSS"><br /><span class="nocss">&nbsp;&nbsp;</span><a href="chap1_mj.html#X7CE8AEAF8133285D">1.2-14 SMALL_GROUPS_OLD_ORDER</a></span>
48 </div></div>
49 </div>
50
51 <h3>1 <span class="Heading">The Small Groups Library</span></h3>
52
53 <p><a id="X8389AD927B74BA4A" name="X8389AD927B74BA4A"></a></p>
54
55 <h4>1.1 <span class="Heading">Overview</span></h4>
56
57 <p>The Small Groups library gives access to all groups of certain <q>small</q> orders. The groups are sorted by their orders and they are listed up to isomorphism; that is, for each of the available orders a complete and irredundant list of isomorphism type representatives of groups is given. Currently, the library contains the following groups:</p>
58
59
60 <ul>
61 <li><p>those of order at most 2000 except 1024   (<span class="SimpleMath">\(423\;164\;062\)</span> groups);</p>
62
63 </li>
64 <li><p>those of cubefree order at most 50 000   (<span class="SimpleMath">\(395 \; 703\)</span> groups);</p>
65
66 </li>
67 <li><p>those of order <span class="SimpleMath">\(p^7\)</span> for the primes <span class="SimpleMath">\(p = 3,5,7,11\)</span>   (<span class="SimpleMath">\(907 \; 489\)</span> groups);</p>
68
69 </li>
70 <li><p>those of order <span class="SimpleMath">\(p^n\)</span> for <span class="SimpleMath">\(n \leq 6\)</span> and all primes <span class="SimpleMath">\(p\)</span></p>
71
72 </li>
73 <li><p>those of order <span class="SimpleMath">\(q^n \cdot p\)</span> for <span class="SimpleMath">\(q^n\)</span> dividing <span class="SimpleMath">\(2^8\)</span>, <span class="SimpleMath">\(3^6\)</span>, <span class="SimpleMath">\(5^5\)</span> or <span class="SimpleMath">\(7^4\)</span> and all primes <span class="SimpleMath">\(p\)</span> with <span class="SimpleMath">\(p \neq q\)</span>;</p>
74
75 </li>
76 <li><p>those of squarefree order;</p>
77
78 </li>
79 <li><p>those whose order factorises into at most 3 primes.</p>
80
81 </li>
82 </ul>
83 <p>The first three items in this list cover an explicit range of orders; the last four provide access to infinite families of groups having orders of certain types.</p>
84
85 <p>The library also has an identification function: it returns the library number of a given group. This function determines library numbers using invariants of groups. The function is available for all orders in the library except for the orders 512 and 1536 and except for the orders <span class="SimpleMath">\(p^5\)</span>, <span class="SimpleMath">\(p^6\)</span> and <span class="SimpleMath">\(p^7\)</span> above 2000.</p>
86
87 <p>The library is organised in 11 layers. Each layer contains the groups of certain orders and their corresponding group identification routines. It is possible to install the first <span class="SimpleMath">\(n\)</span> layers of the group library and the first <span class="SimpleMath">\(m\)</span> layers of the group identification for each <span class="SimpleMath">\(1 \leq m \leq n \leq 11\)</span>. This might be useful to save disk space. There is an extensive <code class="file">README</code> file for the Small Groups library available in the <code class="code">small</code> directory of the <strong class="pkg">GAP</strong> distribution containing detailed information on the layers. A brief description of the layers is given here:</p>
88
89
90 <dl>
91 <dt><strong class="Mark">(1)</strong></dt>
92 <dd><p>the groups whose order factorises into at most 3 primes.</p>
93
94 </dd>
95 <dt><strong class="Mark">(2)</strong></dt>
96 <dd><p>the remaining groups of order at most 1000 except 512 and 768.</p>
97
98 </dd>
99 <dt><strong class="Mark">(3)</strong></dt>
100 <dd><p>the remaining groups of order <span class="SimpleMath">\(2^n \cdot p\)</span> with <span class="SimpleMath">\(n \leq 8\)</span> and <span class="SimpleMath">\(p\)</span> an odd prime.</p>
101
102 </dd>
103 <dt><strong class="Mark">(4)</strong></dt>
104 <dd><p>the remaining groups of order <span class="SimpleMath">\(5^5\)</span>, <span class="SimpleMath">\(7^4\)</span> and of order <span class="SimpleMath">\(q^n \cdot p\)</span> for <span class="SimpleMath">\(q^n\)</span> dividing <span class="SimpleMath">\(3^6\)</span>, <span class="SimpleMath">\(5^5\)</span> or <span class="SimpleMath">\(7^4\)</span> and <span class="SimpleMath">\(p \neq q\)</span> a prime.</p>
105
106 </dd>
107 <dt><strong class="Mark">(5)</strong></dt>
108 <dd><p>the remaining groups of order at most 2000 except 1024, 1152, 1536 and 1920.</p>
109
110 </dd>
111 <dt><strong class="Mark">(6)</strong></dt>
112 <dd><p>the groups of orders 1152 and 1920.</p>
113
114 </dd>
115 <dt><strong class="Mark">(7)</strong></dt>
116 <dd><p>the groups of order 512.</p>
117
118 </dd>
119 <dt><strong class="Mark">(8)</strong></dt>
120 <dd><p>the groups of order 1536.</p>
121
122 </dd>
123 <dt><strong class="Mark">(9)</strong></dt>
124 <dd><p>the remaining groups of order <span class="SimpleMath">\(p^n\)</span> for <span class="SimpleMath">\(4 \leq n \leq 6\)</span>.</p>
125
126 </dd>
127 <dt><strong class="Mark">(10)</strong></dt>
128 <dd><p>the remaining groups of cubefree order at most 50 000 and of squarefree order.</p>
129
130 </dd>
131 <dt><strong class="Mark">(11)</strong></dt>
132 <dd><p>the remaining groups of order <span class="SimpleMath">\(p^7\)</span> for <span class="SimpleMath">\(p = 3,5,7,11\)</span>.</p>
133
134 </dd>
135 </dl>
136 <p>The data in this library has been carefully checked and cross-checked. It is believed to be reliable. However, no absolute guarantees are given and users should, as always, make their own checks in critical cases.</p>
137
138 <p>The data occupies about 30 MB (storing over 400 million groups in about 200 megabits). The group identification occupies about 47 MB of which 18 MB is used for the groups in layer (6). More information on the Small Groups library can be found on <span class="URL"><a href="http://www.icm.tu-bs.de/ag_algebra/software/small/">http://www.icm.tu-bs.de/ag_algebra/software/small/</a></span></p>
139
140 <p>This library has been constructed by Hans Ulrich Besche, Bettina Eick and E. A. O'Brien. A survey on this topic and an account of the history of group constructions can be found in <a href="chapBib_mj.html#biBBEO01">[BEO02]</a>. Further detailed information on the construction of this library is available in <a href="chapBib_mj.html#biBNew77">[New77]</a>, <a href="chapBib_mj.html#biBOBr90">[O'B90]</a>, <a href="chapBib_mj.html#biBOBr91">[O'B91]</a>, <a href="chapBib_mj.html#biBBescheEick98">[BE99a]</a>, <a href="chapBib_mj.html#biBBescheEick1000">[BE99b]</a>, <a href="chapBib_mj.html#biBBescheEick768">[BE01]</a>, <a href="chapBib_mj.html#biBBEO00">[BEO01]</a>, <a href="chapBib_mj.html#biBEOB99">[EO99a]</a>, <a href="chapBib_mj.html#biBEOB98">[EO99b]</a>, <a href="chapBib_mj.html#biBNOV04">[NOV04]</a>, <a href="chapBib_mj.html#biBGir03">[Gir03]</a>, <a href="chapBib_mj.html#biBDEi05">[DE05]</a>, <a href="chapBib_mj.html#biBOV05">[OV05]</a>. The Small Groups library incorporates the <strong class="pkg">GAP</strong> 3 libraries <code class="code">TwoGroup</code> and <code class="code">ThreeGroup</code>. The data from these libraries was directly included into the Small Groups library, and the ordering there was preserved. The Small Groups library replaces the Gap 3 library of solvable groups of order at most 100. However, both the organisation and data descriptions of these groups has changed in the Small Groups library.</p>
141
142 <p>As of version 1.4 of this library, the arrangement of groups is the same as in Magma, Version 2.23. In earlier releases of this library, the arrangement in orders <span class="SimpleMath">\(p^7\)</span>, <span class="SimpleMath">\(p=3,5,7,11\)</span> disagreed. An attempt to fix this was instated on version 1.1 of this library, but a wrong permutation was used. If you would like to refer to index numbers for these orders in older versions of the library, see <code class="func">SMALL_GROUPS_OLD_ORDER</code> (<a href="chap1_mj.html#X7CE8AEAF8133285D"><span class="RefLink">1.2-14</span></a>)). The arrangement of all other orders has always agreed and has remained stable.</p>
143
144 <p>In version 1.5, the number of groups of order 1024 was corrected. For more information, refer to <a href="chapBib_mj.html#biBBurrell2021">[Bur21]</a>.</p>
145
146 <p><a id="X7ECCCA82839EA283" name="X7ECCCA82839EA283"></a></p>
147
148 <h4>1.2 <span class="Heading">Function Reference</span></h4>
149
150 <p><a id="X8398F2577B719D99" name="X8398F2577B719D99"></a></p>
151
152 <h5>1.2-1 SmallGroup</h5>
153
154 <div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">&#8227; SmallGroup</code>( <var class="Arg">order</var>, <var class="Arg">i</var> )</td><td class="tdright">(&nbsp;function&nbsp;)</td></tr></table></div>
155 <div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">&#8227; SmallGroup</code>( <var class="Arg">pair</var> )</td><td class="tdright">(&nbsp;function&nbsp;)</td></tr></table></div>
156 <p>returns the <var class="Arg">i</var>-th group of order <var class="Arg">order</var> in the catalogue. If the group is solvable, it will be given as a PcGroup; otherwise it will be given as a permutation group. If the groups of order <var class="Arg">order</var> are not installed, the function reports an error and enters a break loop.</p>
157
158
159 <div class="example"><pre>
160 <span class="GAPprompt">gap&gt;</span> <span class="GAPinput">G := SmallGroup( 60, 4 );</span>
161 &lt;pc group of size 60 with 4 generators&gt;
162 <span class="GAPprompt">gap&gt;</span> <span class="GAPinput">StructureDescription( G );</span>
163 "C60"
164 <span class="GAPprompt">gap&gt;</span> <span class="GAPinput">G := SmallGroup( 60, 5 );</span>
165 Group([ (1,2,3,4,5), (1,2,3) ])
166 <span class="GAPprompt">gap&gt;</span> <span class="GAPinput">StructureDescription( G );</span>
167 "A5"
168 <span class="GAPprompt">gap&gt;</span> <span class="GAPinput">G := SmallGroup( 768, 1000000 );</span>
169 &lt;pc group of size 768 with 9 generators&gt;
170 <span class="GAPprompt">gap&gt;</span> <span class="GAPinput">G := SmallGroup( [768, 1000000] );</span>
171 &lt;pc group of size 768 with 9 generators&gt;
172 </pre></div>
173
174 <p><a id="X781EA70A7902B22C" name="X781EA70A7902B22C"></a></p>
175
176 <h5>1.2-2 SmallGroupsAvailable</h5>
177
178 <div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">&#8227; SmallGroupsAvailable</code>( <var class="Arg">order</var> )</td><td class="tdright">(&nbsp;function&nbsp;)</td></tr></table></div>
179 <p>returns <code class="code">true</code> if the library of groups of order <var class="Arg">order</var> is installed, and <code class="code">false</code> otherwise.</p>
180
181 <p><a id="X7BB133CB7AA8F465" name="X7BB133CB7AA8F465"></a></p>
182
183 <h5>1.2-3 AllSmallGroups</h5>
184
185 <div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">&#8227; AllSmallGroups</code>( <var class="Arg">arg</var> )</td><td class="tdright">(&nbsp;function&nbsp;)</td></tr></table></div>
186 <p>returns all groups with certain properties as specified by <var class="Arg">arg</var>. If <var class="Arg">arg</var> is a number <span class="SimpleMath">\(n\)</span>, then this function returns all groups of order <span class="SimpleMath">\(n\)</span>. However, the function can also take several arguments which then must be organized in pairs <code class="code">function</code> and <code class="code">value</code>. In this case the first function must be <code class="func">Size</code> (<a href="../../../doc/ref/chap30_mj.html#X858ADA3B7A684421"><span class="RefLink">Reference: Size</span></a>) and the first value an order or a range of orders. If value is a list then it is considered a list of possible function values to include. The function returns those groups of the specified orders having those properties specified by the remaining functions and their values.</p>
187
188 <p>Precomputed information is stored for the properties <code class="func">IsAbelian</code> (<a href="../../../doc/ref/chap35_mj.html#X830A4A4C795FBC2D"><span class="RefLink">Reference: IsAbelian</span></a>), <code class="func">IsNilpotentGroup</code> (<a href="../../../doc/ref/chap39_mj.html#X87D062608719F2CD"><span class="RefLink">Reference: IsNilpotentGroup</span></a>), <code class="func">IsSupersolvableGroup</code> (<a href="../../../doc/ref/chap39_mj.html#X7AADF2E88501B9FF"><span class="RefLink">Reference: IsSupersolvableGroup</span></a>), <code class="func">IsSolvableGroup</code> (<a href="../../../doc/ref/chap39_mj.html#X809C78D5877D31DF"><span class="RefLink">Reference: IsSolvableGroup</span></a>), <code class="func">RankPGroup</code> (<a href="../../../doc/ref/chap39_mj.html#X840A4F937ABF15E1"><span class="RefLink">Reference: RankPGroup</span></a>), <code class="func">PClassPGroup</code> (<a href="../../../doc/ref/chap39_mj.html#X863434AD7DDE514B"><span class="RefLink">Reference: PClassPGroup</span></a>), <code class="func">LGLength</code> (<a href="../../../doc/ref/chap45_mj.html#X7C3912F77B12C8B6"><span class="RefLink">Reference: LGLength</span></a>), <code class="code">FrattinifactorSize</code> and <code class="code">FrattinifactorId</code> for the groups of order at most <span class="SimpleMath">\(2000\)</span> which have more than three prime factors, except those of order <span class="SimpleMath">\(512\)</span>, <span class="SimpleMath">\(768\)</span>, <span class="SimpleMath">\(1024\)</span>, <span class="SimpleMath">\(1152\)</span>, <span class="SimpleMath">\(1536\)</span>, <span class="SimpleMath">\(1920\)</span> and those of order <span class="SimpleMath">\(p^n \cdot q &gt; 1000\)</span> with <span class="SimpleMath">\(n &gt; 2\)</span>.</p>
189
190
191 <div class="example"><pre>
192 <span class="GAPprompt">gap&gt;</span> <span class="GAPinput">AllSmallGroups( 6 );</span>
193 [ &lt;pc group of size 6 with 2 generators&gt;,
194 &lt;pc group of size 6 with 2 generators&gt; ]
195 <span class="GAPprompt">gap&gt;</span> <span class="GAPinput">AllSmallGroups( 60, IsNilpotentGroup );</span>
196 [ &lt;pc group of size 60 with 4 generators&gt;,
197 &lt;pc group of size 60 with 4 generators&gt; ]
198 </pre></div>
199
200 <p><a id="X875EB1167FF6BA82" name="X875EB1167FF6BA82"></a></p>
201
202 <h5>1.2-4 OneSmallGroup</h5>
203
204 <div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">&#8227; OneSmallGroup</code>( <var class="Arg">arg</var> )</td><td class="tdright">(&nbsp;function&nbsp;)</td></tr></table></div>
205 <p>returns one group with certain properties as specified by <var class="Arg">arg</var>. The permitted arguments are those supported by <code class="func">AllSmallGroups</code> (<a href="chap1_mj.html#X7BB133CB7AA8F465"><span class="RefLink">1.2-3</span></a>).</p>
206
207
208 <div class="example"><pre>
209 <span class="GAPprompt">gap&gt;</span> <span class="GAPinput">G := OneSmallGroup( 6, IsAbelian );</span>
210 &lt;pc group of size 6 with 2 generators&gt;
211 <span class="GAPprompt">gap&gt;</span> <span class="GAPinput">StructureDescription( G );</span>
212 "C6"
213 <span class="GAPprompt">gap&gt;</span> <span class="GAPinput">G := OneSmallGroup( 6, IsAbelian, false );</span>
214 &lt;pc group of size 6 with 2 generators&gt;
215 <span class="GAPprompt">gap&gt;</span> <span class="GAPinput">StructureDescription( G );</span>
216 "S3"
217 <span class="GAPprompt">gap&gt;</span> <span class="GAPinput">G := OneSmallGroup( Size, [1..1000], IsSolvableGroup, false );</span>
218 Group([ (1,2,3,4,5), (1,2,3) ])
219 </pre></div>
220
221 <p><a id="X7C587F2A82BEAD19" name="X7C587F2A82BEAD19"></a></p>
222
223 <h5>1.2-5 NumberSmallGroups</h5>
224
225 <div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">&#8227; NumberSmallGroups</code>( <var class="Arg">order</var> )</td><td class="tdright">(&nbsp;function&nbsp;)</td></tr></table></div>
226 <div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">&#8227; NrSmallGroups</code>( <var class="Arg">order</var> )</td><td class="tdright">(&nbsp;function&nbsp;)</td></tr></table></div>
227 <p>returns the number of groups of order <var class="Arg">order</var>.</p>
228
229
230 <div class="example"><pre>
231 <span class="GAPprompt">gap&gt;</span> <span class="GAPinput">NumberSmallGroups( 512 );</span>
232 10494213
233 <span class="GAPprompt">gap&gt;</span> <span class="GAPinput">NumberSmallGroups( 2^8 * 23 );</span>
234 1083472
235 <span class="GAPprompt">gap&gt;</span> <span class="GAPinput">NumberSmallGroups( 4096 );</span>
236 Error, the library of groups of size 4096 is not available
237 </pre></div>
238
239 <p><a id="X872991747D5CFD35" name="X872991747D5CFD35"></a></p>
240
241 <h5>1.2-6 NumberSmallGroupsAvailable</h5>
242
243 <div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">&#8227; NumberSmallGroupsAvailable</code>( <var class="Arg">order</var> )</td><td class="tdright">(&nbsp;function&nbsp;)</td></tr></table></div>
244 <p>returns <code class="code">true</code> if the number of groups of order <var class="Arg">order</var> is known, and <code class="code">false</code> otherwise.</p>
245
246
247 <div class="example"><pre>
248 <span class="GAPprompt">gap&gt;</span> <span class="GAPinput">NumberSmallGroupsAvailable( 100 );</span>
249 true
250 <span class="GAPprompt">gap&gt;</span> <span class="GAPinput">NumberSmallGroups( 100 );</span>
251 16
252 <span class="GAPprompt">gap&gt;</span> <span class="GAPinput">NumberSmallGroupsAvailable( 4096 );</span>
253 false
254 <span class="GAPprompt">gap&gt;</span> <span class="GAPinput">NumberSmallGroups( 4096 );</span>
255 Error, the library of groups of size 4096 is not available
256 </pre></div>
257
258 <p><a id="X7B5A1FD47C722EB2" name="X7B5A1FD47C722EB2"></a></p>
259
260 <h5>1.2-7 SelectSmallGroups</h5>
261
262 <div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">&#8227; SelectSmallGroups</code>( <var class="Arg">argl</var>, <var class="Arg">all</var>, <var class="Arg">id</var> )</td><td class="tdright">(&nbsp;function&nbsp;)</td></tr></table></div>
263 <p>universal function for 'AllSmallGroups', 'OneSmallGroup' and 'IdsOfAllSmallGroups'.</p>
264
265 <p><a id="X83044B9D7E3BDF35" name="X83044B9D7E3BDF35"></a></p>
266
267 <h5>1.2-8 IdSmallGroup</h5>
268
269 <div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">&#8227; IdSmallGroup</code>( <var class="Arg">G</var> )</td><td class="tdright">(&nbsp;attribute&nbsp;)</td></tr></table></div>
270 <div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">&#8227; IdGroup</code>( <var class="Arg">G</var> )</td><td class="tdright">(&nbsp;attribute&nbsp;)</td></tr></table></div>
271 <p>returns the library number of <var class="Arg">G</var>; that is, the function returns a pair <code class="code">[<var class="Arg">order</var>, <var class="Arg">i</var>]</code> where <var class="Arg">G</var> is isomorphic to <code class="code">SmallGroup( <var class="Arg">order</var>, <var class="Arg">i</var> )</code>.</p>
272
273
274 <div class="example"><pre>
275 <span class="GAPprompt">gap&gt;</span> <span class="GAPinput">IdSmallGroup( GL( 2,3 ) );</span>
276 [ 48, 29 ]
277 <span class="GAPprompt">gap&gt;</span> <span class="GAPinput">IdSmallGroup( Group( (1,2,3,4),(4,5) ) );</span>
278 [ 120, 34 ]
279 </pre></div>
280
281 <p><a id="X7C0C616180DE5875" name="X7C0C616180DE5875"></a></p>
282
283 <h5>1.2-9 IdGroupsAvailable</h5>
284
285 <div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">&#8227; IdGroupsAvailable</code>( <var class="Arg">order</var> )</td><td class="tdright">(&nbsp;function&nbsp;)</td></tr></table></div>
286 <p>returns <code class="code">true</code>, if the identification routines for groups of order <var class="Arg">order</var> are installed, otherwise returns <code class="code">false</code>.</p>
287
288 <p><a id="X85352440869327EC" name="X85352440869327EC"></a></p>
289
290 <h5>1.2-10 IdsOfAllSmallGroups</h5>
291
292 <div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">&#8227; IdsOfAllSmallGroups</code>( <var class="Arg">arg</var> )</td><td class="tdright">(&nbsp;function&nbsp;)</td></tr></table></div>
293 <p>similar to <code class="code">AllSmallGroups</code> but returns ids instead of groups. This may prevent workspace overflows, if a large number of groups are expected in the output.</p>
294
295
296 <div class="example"><pre>
297 <span class="GAPprompt">gap&gt;</span> <span class="GAPinput">IdsOfAllSmallGroups( 60, IsNilpotentGroup );</span>
298 [ [ 60, 4 ], [ 60, 13 ] ]
299 <span class="GAPprompt">gap&gt;</span> <span class="GAPinput">IdsOfAllSmallGroups( 60, IsNilpotentGroup, false );</span>
300 [ [ 60, 1 ], [ 60, 2 ], [ 60, 3 ], [ 60, 5 ], [ 60, 6 ], [ 60, 7 ],
301 [ 60, 8 ], [ 60, 9 ], [ 60, 10 ], [ 60, 11 ], [ 60, 12 ] ]
302 <span class="GAPprompt">gap&gt;</span> <span class="GAPinput">IdsOfAllSmallGroups( Size, 60, IsSupersolvableGroup, true );</span>
303 [ [ 60, 1 ], [ 60, 2 ], [ 60, 3 ], [ 60, 4 ], [ 60, 6 ], [ 60, 7 ],
304 [ 60, 8 ], [ 60, 10 ], [ 60, 11 ], [ 60, 12 ], [ 60, 13 ] ]
305 </pre></div>
306
307 <p><a id="X8162304487D0C3E2" name="X8162304487D0C3E2"></a></p>
308
309 <h5>1.2-11 IdGap3SolvableGroup</h5>
310
311 <div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">&#8227; IdGap3SolvableGroup</code>( <var class="Arg">G</var> )</td><td class="tdright">(&nbsp;attribute&nbsp;)</td></tr></table></div>
312 <div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">&#8227; Gap3CatalogueIdGroup</code>( <var class="Arg">G</var> )</td><td class="tdright">(&nbsp;attribute&nbsp;)</td></tr></table></div>
313 <p>returns the catalogue number of <var class="Arg">G</var> in the <strong class="pkg">GAP</strong> 3 catalogue of solvable groups; that is, the function returns a pair <code class="code">[<var class="Arg">order</var>, <var class="Arg">i</var>]</code> meaning that <var class="Arg">G</var> is isomorphic to the group <code class="code">SolvableGroup( <var class="Arg">order</var>, <var class="Arg">i</var> )</code> in <strong class="pkg">GAP</strong> 3.</p>
314
315 <p><a id="X833DB8AB80B76D26" name="X833DB8AB80B76D26"></a></p>
316
317 <h5>1.2-12 SmallGroupsInformation</h5>
318
319 <div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">&#8227; SmallGroupsInformation</code>( <var class="Arg">order</var> )</td><td class="tdright">(&nbsp;function&nbsp;)</td></tr></table></div>
320 <p>prints information on the groups of the specified order.</p>
321
322
323 <div class="example"><pre>
324 <span class="GAPprompt">gap&gt;</span> <span class="GAPinput">SmallGroupsInformation( 32 );</span>
325
326 There are 51 groups of order 32.
327 They are sorted by their ranks.
328 1 is cyclic.
329 2 - 20 have rank 2.
330 21 - 44 have rank 3.
331 45 - 50 have rank 4.
332 51 is elementary abelian.
333
334 For the selection functions the values of the following attributes
335 are precomputed and stored:
336 IsAbelian, PClassPGroup, RankPGroup, FrattinifactorSize and
337 FrattinifactorId.
338
339 This size belongs to layer 2 of the SmallGroups library.
340 IdSmallGroup is available for this size.
341
342 </pre></div>
343
344 <p><a id="X850CC04E7855FF68" name="X850CC04E7855FF68"></a></p>
345
346 <h5>1.2-13 UnloadSmallGroupsData</h5>
347
348 <div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">&#8227; UnloadSmallGroupsData</code>( )</td><td class="tdright">(&nbsp;function&nbsp;)</td></tr></table></div>
349 <p><strong class="pkg">GAP</strong> loads all necessary data from the library automatically, but it does not delete the data from the workspace again. Usually, this will be not necessary, since the data is stored in a compressed format. However, if a large number of groups from the library have been loaded, then the user might wish to remove the data from the workspace and this can be done by the above function call.</p>
350
351
352 <div class="example"><pre>
353 <span class="GAPprompt">gap&gt;</span> <span class="GAPinput">UnloadSmallGroupsData();</span>
354 </pre></div>
355
356 <p><a id="X7CE8AEAF8133285D" name="X7CE8AEAF8133285D"></a></p>
357
358 <h5>1.2-14 SMALL_GROUPS_OLD_ORDER</h5>
359
360 <div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">&#8227; SMALL_GROUPS_OLD_ORDER</code></td><td class="tdright">(&nbsp;global variable&nbsp;)</td></tr></table></div>
361 <p>If set to <code class="code">true</code>, then groups of order <span class="SimpleMath">\(3^7\)</span>, <span class="SimpleMath">\(5^7\)</span>, <span class="SimpleMath">\(7^7\)</span>, and <span class="SimpleMath">\(11^7\)</span> are ordered in the way they were ordered up to version 1.0 of the package. If this variable is set to <code class="code">false</code>, which is the default as of version 1.4, then a different ordering, that agrees with the one in Magma version 2.23, is used. The functions <code class="code">SMALLGP_PERM</code><span class="SimpleMath">\(x\)</span>, with <span class="SimpleMath">\(x=3,5,7,11\)</span>, give the old index position corresponding to a new index position. In releases 1.1-1.3 a misunderstood ordering, based on the old ordering and the permutations <span class="SimpleMath">\((2,30083)(3,30084)(4,30085)(5,30086)\)</span>, <span class="SimpleMath">\((2,104599)(3,104600)(4,104601)(5,104602)\)</span>, and <span class="SimpleMath">\((2,721053)(3,721054)(4,721055)(5,721059)\)</span> respectively were used.</p>
362
363 <p> </p>
364
365
366 <div class="chlinkprevnextbot">&nbsp;<a href="chap0_mj.html">[Top of Book]</a>&nbsp; <a href="chap0_mj.html#contents">[Contents]</a>&nbsp; &nbsp;<a href="chap0_mj.html">[Previous Chapter]</a>&nbsp; &nbsp;<a href="chapBib_mj.html">[Next Chapter]</a>&nbsp; </div>
367
368
369 <div class="chlinkbot"><span class="chlink1">Goto Chapter: </span><a href="chap0_mj.html">Top</a> <a href="chap1_mj.html">1</a> <a href="chapBib_mj.html">Bib</a> <a href="chapInd_mj.html">Ind</a> </div>
370
371 <hr />
372 <p class="foot">generated by <a href="https://www.math.rwth-aachen.de/~Frank.Luebeck/GAPDoc">GAPDoc2HTML</a></p>
373 </body>
374 </html>