Debian Codegraph @

doc/chap7_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 (polycyclic) - Chapter 7: Higher level methods for pcp-groups</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="chap7" 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="chap2_mj.html">2</a> <a href="chap3_mj.html">3</a> <a href="chap4_mj.html">4</a> <a href="chap5_mj.html">5</a> <a href="chap6_mj.html">6</a> <a href="chap7_mj.html">7</a> <a href="chap8_mj.html">8</a> <a href="chap9_mj.html">9</a> <a href="chapA_mj.html">A</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="chap6_mj.html">[Previous Chapter]</a>&nbsp; &nbsp;<a href="chap8_mj.html">[Next Chapter]</a>&nbsp; </div>
24
25 <p id="mathjaxlink" class="pcenter"><a href="chap7.html">[MathJax off]</a></p>
26 <p><a id="X85BB6FE078679DAF" name="X85BB6FE078679DAF"></a></p>
27 <div class="ChapSects"><a href="chap7_mj.html#X85BB6FE078679DAF">7 <span class="Heading">Higher level methods for pcp-groups</span></a>
28 <div class="ContSect"><span class="tocline"><span class="nocss">&nbsp;</span><a href="chap7_mj.html#X8266A0A2821D98A1">7.1 <span class="Heading">Subgroup series in pcp-groups</span></a>
29 </span>
30 <div class="ContSSBlock">
31 <span class="ContSS"><br /><span class="nocss">&nbsp;&nbsp;</span><a href="chap7_mj.html#X8037DAD77A19D9B2">7.1-1 PcpSeries</a></span>
32 <span class="ContSS"><br /><span class="nocss">&nbsp;&nbsp;</span><a href="chap7_mj.html#X86C633357ACD342C">7.1-2 EfaSeries</a></span>
33 <span class="ContSS"><br /><span class="nocss">&nbsp;&nbsp;</span><a href="chap7_mj.html#X80ED4F8380DC477E">7.1-3 SemiSimpleEfaSeries</a></span>
34 <span class="ContSS"><br /><span class="nocss">&nbsp;&nbsp;</span><a href="chap7_mj.html#X7A879948834BD889">7.1-4 DerivedSeriesOfGroup</a></span>
35 <span class="ContSS"><br /><span class="nocss">&nbsp;&nbsp;</span><a href="chap7_mj.html#X866D4C5C79F26611">7.1-5 RefinedDerivedSeries</a></span>
36 <span class="ContSS"><br /><span class="nocss">&nbsp;&nbsp;</span><a href="chap7_mj.html#X86F7DE927DE3B5CD">7.1-6 RefinedDerivedSeriesDown</a></span>
37 <span class="ContSS"><br /><span class="nocss">&nbsp;&nbsp;</span><a href="chap7_mj.html#X879D55A67DB42676">7.1-7 LowerCentralSeriesOfGroup</a></span>
38 <span class="ContSS"><br /><span class="nocss">&nbsp;&nbsp;</span><a href="chap7_mj.html#X8428592E8773CD7B">7.1-8 UpperCentralSeriesOfGroup</a></span>
39 <span class="ContSS"><br /><span class="nocss">&nbsp;&nbsp;</span><a href="chap7_mj.html#X83CA5DE785AE3F2C">7.1-9 TorsionByPolyEFSeries</a></span>
40 <span class="ContSS"><br /><span class="nocss">&nbsp;&nbsp;</span><a href="chap7_mj.html#X7E39431286969377">7.1-10 PcpsBySeries</a></span>
41 <span class="ContSS"><br /><span class="nocss">&nbsp;&nbsp;</span><a href="chap7_mj.html#X79789A1C82139854">7.1-11 PcpsOfEfaSeries</a></span>
42 </div></div>
43 <div class="ContSect"><span class="tocline"><span class="nocss">&nbsp;</span><a href="chap7_mj.html#X7CE2DA437FD2B383">7.2 <span class="Heading">Orbit stabilizer methods for pcp-groups</span></a>
44 </span>
45 <div class="ContSSBlock">
46 <span class="ContSS"><br /><span class="nocss">&nbsp;&nbsp;</span><a href="chap7_mj.html#X83E17DB483B33AB5">7.2-1 PcpOrbitStabilizer</a></span>
47 <span class="ContSS"><br /><span class="nocss">&nbsp;&nbsp;</span><a href="chap7_mj.html#X80694BA480F69A0E">7.2-2 StabilizerIntegralAction</a></span>
48 <span class="ContSS"><br /><span class="nocss">&nbsp;&nbsp;</span><a href="chap7_mj.html#X875BE4077B32A411">7.2-3 NormalizerIntegralAction</a></span>
49 </div></div>
50 <div class="ContSect"><span class="tocline"><span class="nocss">&nbsp;</span><a href="chap7_mj.html#X80E3B42E792532B3">7.3 <span class="Heading">Centralizers, Normalizers and Intersections</span></a>
51 </span>
52 <div class="ContSSBlock">
53 <span class="ContSS"><br /><span class="nocss">&nbsp;&nbsp;</span><a href="chap7_mj.html#X808EE8AD7EE3ECE1">7.3-1 Centralizer</a></span>
54 <span class="ContSS"><br /><span class="nocss">&nbsp;&nbsp;</span><a href="chap7_mj.html#X849B5C527BAFAAA4">7.3-2 Centralizer</a></span>
55 <span class="ContSS"><br /><span class="nocss">&nbsp;&nbsp;</span><a href="chap7_mj.html#X851069107CACF98E">7.3-3 Intersection</a></span>
56 </div></div>
57 <div class="ContSect"><span class="tocline"><span class="nocss">&nbsp;</span><a href="chap7_mj.html#X7CF015E87A2B2388">7.4 <span class="Heading">Finite subgroups</span></a>
58 </span>
59 <div class="ContSSBlock">
60 <span class="ContSS"><br /><span class="nocss">&nbsp;&nbsp;</span><a href="chap7_mj.html#X8036FA507A170DC4">7.4-1 TorsionSubgroup</a></span>
61 <span class="ContSS"><br /><span class="nocss">&nbsp;&nbsp;</span><a href="chap7_mj.html#X8082CD337972DC63">7.4-2 NormalTorsionSubgroup</a></span>
62 <span class="ContSS"><br /><span class="nocss">&nbsp;&nbsp;</span><a href="chap7_mj.html#X86D92DA17DCE22DD">7.4-3 IsTorsionFree</a></span>
63 <span class="ContSS"><br /><span class="nocss">&nbsp;&nbsp;</span><a href="chap7_mj.html#X819058217B4F3DC0">7.4-4 FiniteSubgroupClasses</a></span>
64 <span class="ContSS"><br /><span class="nocss">&nbsp;&nbsp;</span><a href="chap7_mj.html#X7E7C32EA81A297B6">7.4-5 FiniteSubgroupClassesBySeries</a></span>
65 </div></div>
66 <div class="ContSect"><span class="tocline"><span class="nocss">&nbsp;</span><a href="chap7_mj.html#X7D9F737F80F6E396">7.5 <span class="Heading">Subgroups of finite index and maximal subgroups</span></a>
67 </span>
68 <div class="ContSSBlock">
69 <span class="ContSS"><br /><span class="nocss">&nbsp;&nbsp;</span><a href="chap7_mj.html#X87D62D497A8715FB">7.5-1 MaximalSubgroupClassesByIndex</a></span>
70 <span class="ContSS"><br /><span class="nocss">&nbsp;&nbsp;</span><a href="chap7_mj.html#X7800133F81BC7674">7.5-2 LowIndexSubgroupClasses</a></span>
71 <span class="ContSS"><br /><span class="nocss">&nbsp;&nbsp;</span><a href="chap7_mj.html#X7F7067C77F2DC32C">7.5-3 LowIndexNormalSubgroups</a></span>
72 <span class="ContSS"><br /><span class="nocss">&nbsp;&nbsp;</span><a href="chap7_mj.html#X85A5BC447D83175F">7.5-4 NilpotentByAbelianNormalSubgroup</a></span>
73 </div></div>
74 <div class="ContSect"><span class="tocline"><span class="nocss">&nbsp;</span><a href="chap7_mj.html#X785E0E877AB1D549">7.6 <span class="Heading">Further attributes for pcp-groups based on the Fitting subgroup</span></a>
75 </span>
76 <div class="ContSSBlock">
77 <span class="ContSS"><br /><span class="nocss">&nbsp;&nbsp;</span><a href="chap7_mj.html#X780552B57C30DD8F">7.6-1 FittingSubgroup</a></span>
78 <span class="ContSS"><br /><span class="nocss">&nbsp;&nbsp;</span><a href="chap7_mj.html#X86BD63DC844731DF">7.6-2 IsNilpotentByFinite</a></span>
79 <span class="ContSS"><br /><span class="nocss">&nbsp;&nbsp;</span><a href="chap7_mj.html#X847ABE6F781C7FE8">7.6-3 Centre</a></span>
80 <span class="ContSS"><br /><span class="nocss">&nbsp;&nbsp;</span><a href="chap7_mj.html#X861C36368435EB09">7.6-4 FCCentre</a></span>
81 <span class="ContSS"><br /><span class="nocss">&nbsp;&nbsp;</span><a href="chap7_mj.html#X7E75E2BC806746AC">7.6-5 PolyZNormalSubgroup</a></span>
82 <span class="ContSS"><br /><span class="nocss">&nbsp;&nbsp;</span><a href="chap7_mj.html#X86800BF783E30D4A">7.6-6 NilpotentByAbelianByFiniteSeries</a></span>
83 </div></div>
84 <div class="ContSect"><span class="tocline"><span class="nocss">&nbsp;</span><a href="chap7_mj.html#X878DBDC77CCA4F7E">7.7 <span class="Heading">Functions for nilpotent groups</span></a>
85 </span>
86 <div class="ContSSBlock">
87 <span class="ContSS"><br /><span class="nocss">&nbsp;&nbsp;</span><a href="chap7_mj.html#X81D15723804771E2">7.7-1 MinimalGeneratingSet</a></span>
88 </div></div>
89 <div class="ContSect"><span class="tocline"><span class="nocss">&nbsp;</span><a href="chap7_mj.html#X8640F9D47A1F7434">7.8 <span class="Heading">Random methods for pcp-groups</span></a>
90 </span>
91 <div class="ContSSBlock">
92 <span class="ContSS"><br /><span class="nocss">&nbsp;&nbsp;</span><a href="chap7_mj.html#X80AEE73E7D639699">7.8-1 RandomCentralizerPcpGroup</a></span>
93 </div></div>
94 <div class="ContSect"><span class="tocline"><span class="nocss">&nbsp;</span><a href="chap7_mj.html#X824142B784453DB9">7.9 <span class="Heading">Non-abelian tensor product and Schur extensions</span></a>
95 </span>
96 <div class="ContSSBlock">
97 <span class="ContSS"><br /><span class="nocss">&nbsp;&nbsp;</span><a href="chap7_mj.html#X79EF28D9845878C9">7.9-1 SchurExtension</a></span>
98 <span class="ContSS"><br /><span class="nocss">&nbsp;&nbsp;</span><a href="chap7_mj.html#X84B60EC978A9A05E">7.9-2 SchurExtensionEpimorphism</a></span>
99 <span class="ContSS"><br /><span class="nocss">&nbsp;&nbsp;</span><a href="chap7_mj.html#X7DD1E37987612042">7.9-3 SchurCover</a></span>
100 <span class="ContSS"><br /><span class="nocss">&nbsp;&nbsp;</span><a href="chap7_mj.html#X792BC39D7CEB1D27">7.9-4 AbelianInvariantsMultiplier</a></span>
101 <span class="ContSS"><br /><span class="nocss">&nbsp;&nbsp;</span><a href="chap7_mj.html#X822ED5978647C93B">7.9-5 NonAbelianExteriorSquareEpimorphism</a></span>
102 <span class="ContSS"><br /><span class="nocss">&nbsp;&nbsp;</span><a href="chap7_mj.html#X8739CD4686301A0E">7.9-6 NonAbelianExteriorSquare</a></span>
103 <span class="ContSS"><br /><span class="nocss">&nbsp;&nbsp;</span><a href="chap7_mj.html#X86553D7B7DABF38F">7.9-7 NonAbelianTensorSquareEpimorphism</a></span>
104 <span class="ContSS"><br /><span class="nocss">&nbsp;&nbsp;</span><a href="chap7_mj.html#X7C0DF7C97F78C666">7.9-8 NonAbelianTensorSquare</a></span>
105 <span class="ContSS"><br /><span class="nocss">&nbsp;&nbsp;</span><a href="chap7_mj.html#X7AE75EC1860FFE7A">7.9-9 NonAbelianExteriorSquarePlusEmbedding</a></span>
106 <span class="ContSS"><br /><span class="nocss">&nbsp;&nbsp;</span><a href="chap7_mj.html#X7D96C84E87925B0F">7.9-10 NonAbelianTensorSquarePlusEpimorphism</a></span>
107 <span class="ContSS"><br /><span class="nocss">&nbsp;&nbsp;</span><a href="chap7_mj.html#X8746533787C4E8BC">7.9-11 NonAbelianTensorSquarePlus</a></span>
108 <span class="ContSS"><br /><span class="nocss">&nbsp;&nbsp;</span><a href="chap7_mj.html#X78F9184078B2761A">7.9-12 WhiteheadQuadraticFunctor</a></span>
109 </div></div>
110 <div class="ContSect"><span class="tocline"><span class="nocss">&nbsp;</span><a href="chap7_mj.html#X7D3023697BA5CE5A">7.10 <span class="Heading">Schur covers</span></a>
111 </span>
112 <div class="ContSSBlock">
113 <span class="ContSS"><br /><span class="nocss">&nbsp;&nbsp;</span><a href="chap7_mj.html#X7D90B44E7B96AFF1">7.10-1 SchurCovers</a></span>
114 </div></div>
115 </div>
116
117 <h3>7 <span class="Heading">Higher level methods for pcp-groups</span></h3>
118
119 <p>This is a description of some higher level functions of the <strong class="pkg">Polycyclic</strong> package of GAP 4. Throughout this chapter we let <var class="Arg">G</var> be a pc-presented group and we consider algorithms for subgroups <var class="Arg">U</var> and <var class="Arg">V</var> of <var class="Arg">G</var>. For background and a description of the underlying algorithms we refer to <a href="chapBib_mj.html#biBEic01b">[Eic01a]</a>.</p>
120
121 <p><a id="X8266A0A2821D98A1" name="X8266A0A2821D98A1"></a></p>
122
123 <h4>7.1 <span class="Heading">Subgroup series in pcp-groups</span></h4>
124
125 <p>Many algorithm for pcp-groups work by induction using some series through the group. In this section we provide a number of useful series for pcp-groups. An <em>efa series</em> is a normal series with elementary or free abelian factors. See <a href="chapBib_mj.html#biBEic00">[Eic00]</a> for outlines on the algorithms of a number of the available series.</p>
126
127 <p><a id="X8037DAD77A19D9B2" name="X8037DAD77A19D9B2"></a></p>
128
129 <h5>7.1-1 PcpSeries</h5>
130
131 <div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">&#8227; PcpSeries</code>( <var class="Arg">U</var> )</td><td class="tdright">(&nbsp;function&nbsp;)</td></tr></table></div>
132 <p>returns the polycyclic series of <var class="Arg">U</var> defined by an igs of <var class="Arg">U</var>.</p>
133
134 <p><a id="X86C633357ACD342C" name="X86C633357ACD342C"></a></p>
135
136 <h5>7.1-2 EfaSeries</h5>
137
138 <div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">&#8227; EfaSeries</code>( <var class="Arg">U</var> )</td><td class="tdright">(&nbsp;attribute&nbsp;)</td></tr></table></div>
139 <p>returns a normal series of <var class="Arg">U</var> with elementary or free abelian factors.</p>
140
141 <p><a id="X80ED4F8380DC477E" name="X80ED4F8380DC477E"></a></p>
142
143 <h5>7.1-3 SemiSimpleEfaSeries</h5>
144
145 <div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">&#8227; SemiSimpleEfaSeries</code>( <var class="Arg">U</var> )</td><td class="tdright">(&nbsp;attribute&nbsp;)</td></tr></table></div>
146 <p>returns an efa series of <var class="Arg">U</var> such that every factor in the series is semisimple as a module for <var class="Arg">U</var> over a finite field or over the rationals.</p>
147
148 <p><a id="X7A879948834BD889" name="X7A879948834BD889"></a></p>
149
150 <h5>7.1-4 DerivedSeriesOfGroup</h5>
151
152 <div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">&#8227; DerivedSeriesOfGroup</code>( <var class="Arg">U</var> )</td><td class="tdright">(&nbsp;method&nbsp;)</td></tr></table></div>
153 <p>the derived series of <var class="Arg">U</var>.</p>
154
155 <p><a id="X866D4C5C79F26611" name="X866D4C5C79F26611"></a></p>
156
157 <h5>7.1-5 RefinedDerivedSeries</h5>
158
159 <div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">&#8227; RefinedDerivedSeries</code>( <var class="Arg">U</var> )</td><td class="tdright">(&nbsp;function&nbsp;)</td></tr></table></div>
160 <p>the derived series of <var class="Arg">U</var> refined to an efa series such that in each abelian factor of the derived series the free abelian factor is at the top.</p>
161
162 <p><a id="X86F7DE927DE3B5CD" name="X86F7DE927DE3B5CD"></a></p>
163
164 <h5>7.1-6 RefinedDerivedSeriesDown</h5>
165
166 <div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">&#8227; RefinedDerivedSeriesDown</code>( <var class="Arg">U</var> )</td><td class="tdright">(&nbsp;function&nbsp;)</td></tr></table></div>
167 <p>the derived series of <var class="Arg">U</var> refined to an efa series such that in each abelian factor of the derived series the free abelian factor is at the bottom.</p>
168
169 <p><a id="X879D55A67DB42676" name="X879D55A67DB42676"></a></p>
170
171 <h5>7.1-7 LowerCentralSeriesOfGroup</h5>
172
173 <div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">&#8227; LowerCentralSeriesOfGroup</code>( <var class="Arg">U</var> )</td><td class="tdright">(&nbsp;method&nbsp;)</td></tr></table></div>
174 <p>the lower central series of <var class="Arg">U</var>. If <var class="Arg">U</var> does not have a largest nilpotent quotient group, then this function may not terminate.</p>
175
176 <p><a id="X8428592E8773CD7B" name="X8428592E8773CD7B"></a></p>
177
178 <h5>7.1-8 UpperCentralSeriesOfGroup</h5>
179
180 <div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">&#8227; UpperCentralSeriesOfGroup</code>( <var class="Arg">U</var> )</td><td class="tdright">(&nbsp;method&nbsp;)</td></tr></table></div>
181 <p>the upper central series of <var class="Arg">U</var>. This function always terminates, but it may terminate at a proper subgroup of <var class="Arg">U</var>.</p>
182
183 <p><a id="X83CA5DE785AE3F2C" name="X83CA5DE785AE3F2C"></a></p>
184
185 <h5>7.1-9 TorsionByPolyEFSeries</h5>
186
187 <div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">&#8227; TorsionByPolyEFSeries</code>( <var class="Arg">U</var> )</td><td class="tdright">(&nbsp;function&nbsp;)</td></tr></table></div>
188 <p>returns an efa series of <var class="Arg">U</var> such that all torsion-free factors are at the top and all finite factors are at the bottom. Such a series might not exist for <var class="Arg">U</var> and in this case the function returns fail.</p>
189
190
191 <div class="example"><pre>
192 <span class="GAPprompt">gap&gt;</span> <span class="GAPinput">G := ExamplesOfSomePcpGroups(5);</span>
193 Pcp-group with orders [ 2, 0, 0, 0 ]
194 <span class="GAPprompt">gap&gt;</span> <span class="GAPinput">Igs(G);</span>
195 [ g1, g2, g3, g4 ]
196
197 <span class="GAPprompt">gap&gt;</span> <span class="GAPinput">PcpSeries(G);</span>
198 [ Pcp-group with orders [ 2, 0, 0, 0 ],
199 Pcp-group with orders [ 0, 0, 0 ],
200 Pcp-group with orders [ 0, 0 ],
201 Pcp-group with orders [ 0 ],
202 Pcp-group with orders [ ] ]
203
204 <span class="GAPprompt">gap&gt;</span> <span class="GAPinput">List( PcpSeries(G), Igs );</span>
205 [ [ g1, g2, g3, g4 ], [ g2, g3, g4 ], [ g3, g4 ], [ g4 ], [ ] ]
206 </pre></div>
207
208 <p>Algorithms for pcp-groups often use an efa series of <span class="SimpleMath">\(G\)</span> and work down over the factors of this series. Usually, pcp's of the factors are more useful than the actual factors. Hence we provide the following.</p>
209
210 <p><a id="X7E39431286969377" name="X7E39431286969377"></a></p>
211
212 <h5>7.1-10 PcpsBySeries</h5>
213
214 <div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">&#8227; PcpsBySeries</code>( <var class="Arg">ser</var>[, <var class="Arg">flag</var>] )</td><td class="tdright">(&nbsp;function&nbsp;)</td></tr></table></div>
215 <p>returns a list of pcp's corresponding to the factors of the series. If the parameter <var class="Arg">flag</var> is present and equals the string <q>snf</q>, then each pcp corresponds to a decomposition of the abelian groups into direct factors.</p>
216
217 <p><a id="X79789A1C82139854" name="X79789A1C82139854"></a></p>
218
219 <h5>7.1-11 PcpsOfEfaSeries</h5>
220
221 <div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">&#8227; PcpsOfEfaSeries</code>( <var class="Arg">U</var> )</td><td class="tdright">(&nbsp;attribute&nbsp;)</td></tr></table></div>
222 <p>returns a list of pcps corresponding to an efa series of <var class="Arg">U</var>.</p>
223
224
225 <div class="example"><pre>
226 <span class="GAPprompt">gap&gt;</span> <span class="GAPinput">G := ExamplesOfSomePcpGroups(5);</span>
227 Pcp-group with orders [ 2, 0, 0, 0 ]
228
229 <span class="GAPprompt">gap&gt;</span> <span class="GAPinput">PcpsBySeries( DerivedSeriesOfGroup(G));</span>
230 [ Pcp [ g1, g2, g3, g4 ] with orders [ 2, 2, 2, 2 ],
231 Pcp [ g2^-2, g3^-2, g4^2 ] with orders [ 0, 0, 4 ],
232 Pcp [ g4^8 ] with orders [ 0 ] ]
233 <span class="GAPprompt">gap&gt;</span> <span class="GAPinput">PcpsBySeries( RefinedDerivedSeries(G));</span>
234 [ Pcp [ g1, g2, g3 ] with orders [ 2, 2, 2 ],
235 Pcp [ g4 ] with orders [ 2 ],
236 Pcp [ g2^2, g3^2 ] with orders [ 0, 0 ],
237 Pcp [ g4^2 ] with orders [ 2 ],
238 Pcp [ g4^4 ] with orders [ 2 ],
239 Pcp [ g4^8 ] with orders [ 0 ] ]
240
241 <span class="GAPprompt">gap&gt;</span> <span class="GAPinput">PcpsBySeries( DerivedSeriesOfGroup(G), "snf" );</span>
242 [ Pcp [ g2, g3, g1 ] with orders [ 2, 2, 4 ],
243 Pcp [ g4^2, g3^-2, g2^2*g4^2 ] with orders [ 4, 0, 0 ],
244 Pcp [ g4^8 ] with orders [ 0 ] ]
245 <span class="GAPprompt">gap&gt;</span> <span class="GAPinput">G.1^4 in DerivedSubgroup( G );</span>
246 true
247 <span class="GAPprompt">gap&gt;</span> <span class="GAPinput">G.1^2 = G.4;</span>
248 true
249
250 <span class="GAPprompt">gap&gt;</span> <span class="GAPinput"> PcpsOfEfaSeries( G );</span>
251 [ Pcp [ g1 ] with orders [ 2 ],
252 Pcp [ g2 ] with orders [ 0 ],
253 Pcp [ g3 ] with orders [ 0 ],
254 Pcp [ g4 ] with orders [ 0 ] ]
255 </pre></div>
256
257 <p><a id="X7CE2DA437FD2B383" name="X7CE2DA437FD2B383"></a></p>
258
259 <h4>7.2 <span class="Heading">Orbit stabilizer methods for pcp-groups</span></h4>
260
261 <p>Let <var class="Arg">U</var> be a pcp-group which acts on a set <span class="SimpleMath">\(\Omega\)</span>. One of the fundamental problems in algorithmic group theory is the determination of orbits and stabilizers of points in <span class="SimpleMath">\(\Omega\)</span> under the action of <var class="Arg">U</var>. We distinguish two cases: the case that all considered orbits are finite and the case that there are infinite orbits. In the latter case, an orbit cannot be listed and a description of the orbit and its corresponding stabilizer is much harder to obtain.</p>
262
263 <p>If the considered orbits are finite, then the following two functions can be applied to compute the considered orbits and their corresponding stabilizers.</p>
264
265 <p><a id="X83E17DB483B33AB5" name="X83E17DB483B33AB5"></a></p>
266
267 <h5>7.2-1 PcpOrbitStabilizer</h5>
268
269 <div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">&#8227; PcpOrbitStabilizer</code>( <var class="Arg">point</var>, <var class="Arg">gens</var>, <var class="Arg">acts</var>, <var class="Arg">oper</var> )</td><td class="tdright">(&nbsp;function&nbsp;)</td></tr></table></div>
270 <div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">&#8227; PcpOrbitsStabilizers</code>( <var class="Arg">points</var>, <var class="Arg">gens</var>, <var class="Arg">acts</var>, <var class="Arg">oper</var> )</td><td class="tdright">(&nbsp;function&nbsp;)</td></tr></table></div>
271 <p>The input <var class="Arg">gens</var> can be an igs or a pcp of a pcp-group <var class="Arg">U</var>. The elements in the list <var class="Arg">gens</var> act as the elements in the list <var class="Arg">acts</var> via the function <var class="Arg">oper</var> on the given points; that is, <var class="Arg">oper( point, acts[i] )</var> applies the <span class="SimpleMath">\(i\)</span>th generator to a given point. Thus the group defined by <var class="Arg">acts</var> must be a homomorphic image of the group defined by <var class="Arg">gens</var>. The first function returns a record containing the orbit as component 'orbit' and and igs for the stabilizer as component 'stab'. The second function returns a list of records, each record contains 'repr' and 'stab'. Both of these functions run forever on infinite orbits.</p>
272
273
274 <div class="example"><pre>
275 <span class="GAPprompt">gap&gt;</span> <span class="GAPinput">G := DihedralPcpGroup( 0 );</span>
276 Pcp-group with orders [ 2, 0 ]
277 <span class="GAPprompt">gap&gt;</span> <span class="GAPinput">mats := [ [[-1,0],[0,1]], [[1,1],[0,1]] ];;</span>
278 <span class="GAPprompt">gap&gt;</span> <span class="GAPinput">pcp := Pcp(G);</span>
279 Pcp [ g1, g2 ] with orders [ 2, 0 ]
280 <span class="GAPprompt">gap&gt;</span> <span class="GAPinput">PcpOrbitStabilizer( [0,1], pcp, mats, OnRight );</span>
281 rec( orbit := [ [ 0, 1 ] ],
282 stab := [ g1, g2 ],
283 word := [ [ [ 1, 1 ] ], [ [ 2, 1 ] ] ] )
284 </pre></div>
285
286 <p>If the considered orbits are infinite, then it may not always be possible to determine a description of the orbits and their stabilizers. However, as shown in <a href="chapBib_mj.html#biBEOs01">[EO02]</a> and <a href="chapBib_mj.html#biBEic02">[Eic02]</a>, it is possible to determine stabilizers and check if two elements are contained in the same orbit if the given action of the polycyclic group is a unimodular linear action on a vector space. The following functions are available for this case.</p>
287
288 <p><a id="X80694BA480F69A0E" name="X80694BA480F69A0E"></a></p>
289
290 <h5>7.2-2 StabilizerIntegralAction</h5>
291
292 <div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">&#8227; StabilizerIntegralAction</code>( <var class="Arg">U</var>, <var class="Arg">mats</var>, <var class="Arg">v</var> )</td><td class="tdright">(&nbsp;function&nbsp;)</td></tr></table></div>
293 <div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">&#8227; OrbitIntegralAction</code>( <var class="Arg">U</var>, <var class="Arg">mats</var>, <var class="Arg">v</var>, <var class="Arg">w</var> )</td><td class="tdright">(&nbsp;function&nbsp;)</td></tr></table></div>
294 <p>The first function computes the stabilizer in <var class="Arg">U</var> of the vector <var class="Arg">v</var> where the pcp group <var class="Arg">U</var> acts via <var class="Arg">mats</var> on an integral space and <var class="Arg">v</var> and <var class="Arg">w</var> are elements in this integral space. The second function checks whether <var class="Arg">v</var> and <var class="Arg">w</var> are in the same orbit and the function returns either <var class="Arg">false</var> or a record containing an element in <var class="Arg">U</var> mapping <var class="Arg">v</var> to <var class="Arg">w</var> and the stabilizer of <var class="Arg">v</var>.</p>
295
296 <p><a id="X875BE4077B32A411" name="X875BE4077B32A411"></a></p>
297
298 <h5>7.2-3 NormalizerIntegralAction</h5>
299
300 <div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">&#8227; NormalizerIntegralAction</code>( <var class="Arg">U</var>, <var class="Arg">mats</var>, <var class="Arg">B</var> )</td><td class="tdright">(&nbsp;function&nbsp;)</td></tr></table></div>
301 <div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">&#8227; ConjugacyIntegralAction</code>( <var class="Arg">U</var>, <var class="Arg">mats</var>, <var class="Arg">B</var>, <var class="Arg">C</var> )</td><td class="tdright">(&nbsp;function&nbsp;)</td></tr></table></div>
302 <p>The first function computes the normalizer in <var class="Arg">U</var> of the lattice with the basis <var class="Arg">B</var>, where the pcp group <var class="Arg">U</var> acts via <var class="Arg">mats</var> on an integral space and <var class="Arg">B</var> is a subspace of this integral space. The second functions checks whether the two lattices with the bases <var class="Arg">B</var> and <var class="Arg">C</var> are contained in the same orbit under <var class="Arg">U</var>. The function returns either <var class="Arg">false</var> or a record with an element in <var class="Arg">U</var> mapping <var class="Arg">B</var> to <var class="Arg">C</var> and the stabilizer of <var class="Arg">B</var>.</p>
303
304
305 <div class="example"><pre>
306 # get a pcp group and a free abelian normal subgroup
307 <span class="GAPprompt">gap&gt;</span> <span class="GAPinput">G := ExamplesOfSomePcpGroups(8);</span>
308 Pcp-group with orders [ 0, 0, 0, 0, 0 ]
309 <span class="GAPprompt">gap&gt;</span> <span class="GAPinput">efa := EfaSeries(G);</span>
310 [ Pcp-group with orders [ 0, 0, 0, 0, 0 ],
311 Pcp-group with orders [ 0, 0, 0, 0 ],
312 Pcp-group with orders [ 0, 0, 0 ],
313 Pcp-group with orders [ ] ]
314 <span class="GAPprompt">gap&gt;</span> <span class="GAPinput">N := efa[3];</span>
315 Pcp-group with orders [ 0, 0, 0 ]
316 <span class="GAPprompt">gap&gt;</span> <span class="GAPinput">IsFreeAbelian(N);</span>
317 true
318
319 # create conjugation action on N
320 <span class="GAPprompt">gap&gt;</span> <span class="GAPinput">mats := LinearActionOnPcp(Igs(G), Pcp(N));</span>
321 [ [ [ 1, 0, 0 ], [ 0, 1, 0 ], [ 0, 0, 1 ] ],
322 [ [ 0, 0, 1 ], [ 1, -1, 1 ], [ 0, 1, 0 ] ],
323 [ [ 1, 0, 0 ], [ 0, 1, 0 ], [ 0, 0, 1 ] ],
324 [ [ 1, 0, 0 ], [ 0, 1, 0 ], [ 0, 0, 1 ] ],
325 [ [ 1, 0, 0 ], [ 0, 1, 0 ], [ 0, 0, 1 ] ] ]
326
327 # take an arbitrary vector and compute its stabilizer
328 <span class="GAPprompt">gap&gt;</span> <span class="GAPinput">StabilizerIntegralAction(G,mats, [2,3,4]);</span>
329 Pcp-group with orders [ 0, 0, 0, 0 ]
330 <span class="GAPprompt">gap&gt;</span> <span class="GAPinput">Igs(last);</span>
331 [ g1, g3, g4, g5 ]
332
333 # check orbits with some other vectors
334 <span class="GAPprompt">gap&gt;</span> <span class="GAPinput">OrbitIntegralAction(G,mats, [2,3,4],[3,1,5]);</span>
335 rec( stab := Pcp-group with orders [ 0, 0, 0, 0 ], prei := g2 )
336
337 <span class="GAPprompt">gap&gt;</span> <span class="GAPinput">OrbitIntegralAction(G,mats, [2,3,4], [4,6,8]);</span>
338 false
339
340 # compute the orbit of a subgroup of Z^3 under the action of G
341 <span class="GAPprompt">gap&gt;</span> <span class="GAPinput">NormalizerIntegralAction(G, mats, [[1,0,0],[0,1,0]]);</span>
342 Pcp-group with orders [ 0, 0, 0, 0, 0 ]
343 <span class="GAPprompt">gap&gt;</span> <span class="GAPinput">Igs(last);</span>
344 [ g1, g2^2, g3, g4, g5 ]
345 </pre></div>
346
347 <p><a id="X80E3B42E792532B3" name="X80E3B42E792532B3"></a></p>
348
349 <h4>7.3 <span class="Heading">Centralizers, Normalizers and Intersections</span></h4>
350
351 <p>In this section we list a number of operations for which there are methods installed to compute the corresponding features in polycyclic groups.</p>
352
353 <p><a id="X808EE8AD7EE3ECE1" name="X808EE8AD7EE3ECE1"></a></p>
354
355 <h5>7.3-1 Centralizer</h5>
356
357 <div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">&#8227; Centralizer</code>( <var class="Arg">U</var>, <var class="Arg">g</var> )</td><td class="tdright">(&nbsp;method&nbsp;)</td></tr></table></div>
358 <div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">&#8227; IsConjugate</code>( <var class="Arg">U</var>, <var class="Arg">g</var>, <var class="Arg">h</var> )</td><td class="tdright">(&nbsp;method&nbsp;)</td></tr></table></div>
359 <p>These functions solve the conjugacy problem for elements in pcp-groups and they can be used to compute centralizers. The first method returns a subgroup of the given group <var class="Arg">U</var>, the second method either returns a conjugating element or false if no such element exists.</p>
360
361 <p>The methods are based on the orbit stabilizer algorithms described in <a href="chapBib_mj.html#biBEOs01">[EO02]</a>. For nilpotent groups, an algorithm to solve the conjugacy problem for elements is described in <a href="chapBib_mj.html#biBSims94">[Sim94]</a>.</p>
362
363 <p><a id="X849B5C527BAFAAA4" name="X849B5C527BAFAAA4"></a></p>
364
365 <h5>7.3-2 Centralizer</h5>
366
367 <div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">&#8227; Centralizer</code>( <var class="Arg">U</var>, <var class="Arg">V</var> )</td><td class="tdright">(&nbsp;method&nbsp;)</td></tr></table></div>
368 <div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">&#8227; Normalizer</code>( <var class="Arg">U</var>, <var class="Arg">V</var> )</td><td class="tdright">(&nbsp;method&nbsp;)</td></tr></table></div>
369 <div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">&#8227; IsConjugate</code>( <var class="Arg">U</var>, <var class="Arg">V</var>, <var class="Arg">W</var> )</td><td class="tdright">(&nbsp;method&nbsp;)</td></tr></table></div>
370 <p>These three functions solve the conjugacy problem for subgroups and compute centralizers and normalizers of subgroups. The first two functions return subgroups of the input group <var class="Arg">U</var>, the third function returns a conjugating element or false if no such element exists.</p>
371
372 <p>The methods are based on the orbit stabilizer algorithms described in <a href="chapBib_mj.html#biBEic02">[Eic02]</a>. For nilpotent groups, an algorithm to solve the conjugacy problems for subgroups is described in <a href="chapBib_mj.html#biBLo98">[Lo98b]</a>.</p>
373
374 <p><a id="X851069107CACF98E" name="X851069107CACF98E"></a></p>
375
376 <h5>7.3-3 Intersection</h5>
377
378 <div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">&#8227; Intersection</code>( <var class="Arg">U</var>, <var class="Arg">N</var> )</td><td class="tdright">(&nbsp;function&nbsp;)</td></tr></table></div>
379 <p>A general method to compute intersections of subgroups of a pcp-group is described in <a href="chapBib_mj.html#biBEic01b">[Eic01a]</a>, but it is not yet implemented here. However, intersections of subgroups <span class="SimpleMath">\(U, N \leq G\)</span> can be computed if <span class="SimpleMath">\(N\)</span> is normalising <span class="SimpleMath">\(U\)</span>. See <a href="chapBib_mj.html#biBSims94">[Sim94]</a> for an outline of the algorithm.</p>
380
381 <p><a id="X7CF015E87A2B2388" name="X7CF015E87A2B2388"></a></p>
382
383 <h4>7.4 <span class="Heading">Finite subgroups</span></h4>
384
385 <p>There are various finite subgroups of interest in polycyclic groups. See <a href="chapBib_mj.html#biBEic00">[Eic00]</a> for a description of the algorithms underlying the functions in this section.</p>
386
387 <p><a id="X8036FA507A170DC4" name="X8036FA507A170DC4"></a></p>
388
389 <h5>7.4-1 TorsionSubgroup</h5>
390
391 <div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">&#8227; TorsionSubgroup</code>( <var class="Arg">U</var> )</td><td class="tdright">(&nbsp;attribute&nbsp;)</td></tr></table></div>
392 <p>If the set of elements of finite order forms a subgroup, then we call it the <em>torsion subgroup</em>. This function determines the torsion subgroup of <var class="Arg">U</var>, if it exists, and returns fail otherwise. Note that a torsion subgroup does always exist if <var class="Arg">U</var> is nilpotent.</p>
393
394 <p><a id="X8082CD337972DC63" name="X8082CD337972DC63"></a></p>
395
396 <h5>7.4-2 NormalTorsionSubgroup</h5>
397
398 <div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">&#8227; NormalTorsionSubgroup</code>( <var class="Arg">U</var> )</td><td class="tdright">(&nbsp;attribute&nbsp;)</td></tr></table></div>
399 <p>Each polycyclic groups has a unique largest finite normal subgroup. This function computes it for <var class="Arg">U</var>.</p>
400
401 <p><a id="X86D92DA17DCE22DD" name="X86D92DA17DCE22DD"></a></p>
402
403 <h5>7.4-3 IsTorsionFree</h5>
404
405 <div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">&#8227; IsTorsionFree</code>( <var class="Arg">U</var> )</td><td class="tdright">(&nbsp;property&nbsp;)</td></tr></table></div>
406 <p>This function checks if <var class="Arg">U</var> is torsion free. It returns true or false.</p>
407
408 <p><a id="X819058217B4F3DC0" name="X819058217B4F3DC0"></a></p>
409
410 <h5>7.4-4 FiniteSubgroupClasses</h5>
411
412 <div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">&#8227; FiniteSubgroupClasses</code>( <var class="Arg">U</var> )</td><td class="tdright">(&nbsp;attribute&nbsp;)</td></tr></table></div>
413 <p>There exist only finitely many conjugacy classes of finite subgroups in a polycyclic group <var class="Arg">U</var> and this function can be used to compute them. The algorithm underlying this function proceeds by working down a normal series of <var class="Arg">U</var> with elementary or free abelian factors. The following function can be used to give the algorithm a specific series.</p>
414
415 <p><a id="X7E7C32EA81A297B6" name="X7E7C32EA81A297B6"></a></p>
416
417 <h5>7.4-5 FiniteSubgroupClassesBySeries</h5>
418
419 <div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">&#8227; FiniteSubgroupClassesBySeries</code>( <var class="Arg">U</var>, <var class="Arg">pcps</var> )</td><td class="tdright">(&nbsp;function&nbsp;)</td></tr></table></div>
420
421 <div class="example"><pre>
422 <span class="GAPprompt">gap&gt;</span> <span class="GAPinput">G := ExamplesOfSomePcpGroups(15);</span>
423 Pcp-group with orders [ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 5, 4, 0 ]
424 <span class="GAPprompt">gap&gt;</span> <span class="GAPinput">TorsionSubgroup(G);</span>
425 Pcp-group with orders [ 5, 2 ]
426 <span class="GAPprompt">gap&gt;</span> <span class="GAPinput">NormalTorsionSubgroup(G);</span>
427 Pcp-group with orders [ 5, 2 ]
428 <span class="GAPprompt">gap&gt;</span> <span class="GAPinput">IsTorsionFree(G);</span>
429 false
430 <span class="GAPprompt">gap&gt;</span> <span class="GAPinput">FiniteSubgroupClasses(G);</span>
431 [ Pcp-group with orders [ 5, 2 ]^G,
432 Pcp-group with orders [ 2 ]^G,
433 Pcp-group with orders [ 5 ]^G,
434 Pcp-group with orders [ ]^G ]
435
436 <span class="GAPprompt">gap&gt;</span> <span class="GAPinput">G := DihedralPcpGroup( 0 );</span>
437 Pcp-group with orders [ 2, 0 ]
438 <span class="GAPprompt">gap&gt;</span> <span class="GAPinput">TorsionSubgroup(G);</span>
439 fail
440 <span class="GAPprompt">gap&gt;</span> <span class="GAPinput">NormalTorsionSubgroup(G);</span>
441 Pcp-group with orders [ ]
442 <span class="GAPprompt">gap&gt;</span> <span class="GAPinput">IsTorsionFree(G);</span>
443 false
444 <span class="GAPprompt">gap&gt;</span> <span class="GAPinput">FiniteSubgroupClasses(G);</span>
445 [ Pcp-group with orders [ 2 ]^G,
446 Pcp-group with orders [ 2 ]^G,
447 Pcp-group with orders [ ]^G ]
448 </pre></div>
449
450 <p><a id="X7D9F737F80F6E396" name="X7D9F737F80F6E396"></a></p>
451
452 <h4>7.5 <span class="Heading">Subgroups of finite index and maximal subgroups</span></h4>
453
454 <p>Here we outline functions to determine various types of subgroups of finite index in polycyclic groups. Again, see <a href="chapBib_mj.html#biBEic00">[Eic00]</a> for a description of the algorithms underlying the functions in this section. Also, we refer to <a href="chapBib_mj.html#biBLo99">[Lo98a]</a> for an alternative approach.</p>
455
456 <p><a id="X87D62D497A8715FB" name="X87D62D497A8715FB"></a></p>
457
458 <h5>7.5-1 MaximalSubgroupClassesByIndex</h5>
459
460 <div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">&#8227; MaximalSubgroupClassesByIndex</code>( <var class="Arg">U</var>, <var class="Arg">p</var> )</td><td class="tdright">(&nbsp;operation&nbsp;)</td></tr></table></div>
461 <p>Each maximal subgroup of a polycyclic group <var class="Arg">U</var> has <var class="Arg">p</var>-power index for some prime <var class="Arg">p</var>. This function can be used to determine the conjugacy classes of all maximal subgroups of <var class="Arg">p</var>-power index for a given prime <var class="Arg">p</var>.</p>
462
463 <p><a id="X7800133F81BC7674" name="X7800133F81BC7674"></a></p>
464
465 <h5>7.5-2 LowIndexSubgroupClasses</h5>
466
467 <div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">&#8227; LowIndexSubgroupClasses</code>( <var class="Arg">U</var>, <var class="Arg">n</var> )</td><td class="tdright">(&nbsp;operation&nbsp;)</td></tr></table></div>
468 <p>There are only finitely many subgroups of a given index in a polycyclic group <var class="Arg">U</var>. This function computes conjugacy classes of all subgroups of index <var class="Arg">n</var> in <var class="Arg">U</var>.</p>
469
470 <p><a id="X7F7067C77F2DC32C" name="X7F7067C77F2DC32C"></a></p>
471
472 <h5>7.5-3 LowIndexNormalSubgroups</h5>
473
474 <div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">&#8227; LowIndexNormalSubgroups</code>( <var class="Arg">U</var>, <var class="Arg">n</var> )</td><td class="tdright">(&nbsp;operation&nbsp;)</td></tr></table></div>
475 <p>This function computes the normal subgroups of index <var class="Arg">n</var> in <var class="Arg">U</var>.</p>
476
477 <p><a id="X85A5BC447D83175F" name="X85A5BC447D83175F"></a></p>
478
479 <h5>7.5-4 NilpotentByAbelianNormalSubgroup</h5>
480
481 <div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">&#8227; NilpotentByAbelianNormalSubgroup</code>( <var class="Arg">U</var> )</td><td class="tdright">(&nbsp;function&nbsp;)</td></tr></table></div>
482 <p>This function returns a normal subgroup <var class="Arg">N</var> of finite index in <var class="Arg">U</var> such that <var class="Arg">N</var> is nilpotent-by-abelian. Such a subgroup exists in every polycyclic group and this function computes such a subgroup using LowIndexNormal. However, we note that this function is not very efficient and the function NilpotentByAbelianByFiniteSeries may well be more efficient on this task.</p>
483
484
485 <div class="example"><pre>
486 <span class="GAPprompt">gap&gt;</span> <span class="GAPinput">G := ExamplesOfSomePcpGroups(2);</span>
487 Pcp-group with orders [ 0, 0, 0, 0, 0, 0 ]
488
489 <span class="GAPprompt">gap&gt;</span> <span class="GAPinput">MaximalSubgroupClassesByIndex( G, 61 );;</span>
490 <span class="GAPprompt">gap&gt;</span> <span class="GAPinput">max := List( last, Representative );;</span>
491 <span class="GAPprompt">gap&gt;</span> <span class="GAPinput">List( max, x -&gt; Index( G, x ) );</span>
492 [ 61, 61, 61, 61, 61, 61, 61, 61, 61, 61, 61, 61, 61, 61, 61, 61, 61, 61, 61,
493 61, 61, 61, 61, 61, 61, 61, 61, 61, 61, 61, 61, 61, 61, 61, 61, 61, 61, 61,
494 61, 61, 61, 61, 61, 61, 61, 61, 61, 61, 61, 61, 61, 61, 61, 61, 61, 61, 61,
495 61, 61, 61, 61, 61, 61, 226981 ]
496
497 <span class="GAPprompt">gap&gt;</span> <span class="GAPinput">LowIndexSubgroupClasses( G, 61 );;</span>
498 <span class="GAPprompt">gap&gt;</span> <span class="GAPinput">low := List( last, Representative );;</span>
499 <span class="GAPprompt">gap&gt;</span> <span class="GAPinput">List( low, x -&gt; Index( G, x ) );</span>
500 [ 61, 61, 61, 61, 61, 61, 61, 61, 61, 61, 61, 61, 61, 61, 61, 61, 61, 61, 61,
501 61, 61, 61, 61, 61, 61, 61, 61, 61, 61, 61, 61, 61, 61, 61, 61, 61, 61, 61,
502 61, 61, 61, 61, 61, 61, 61, 61, 61, 61, 61, 61, 61, 61, 61, 61, 61, 61, 61,
503 61, 61, 61, 61, 61, 61 ]
504 </pre></div>
505
506 <p><a id="X785E0E877AB1D549" name="X785E0E877AB1D549"></a></p>
507
508 <h4>7.6 <span class="Heading">Further attributes for pcp-groups based on the Fitting subgroup</span></h4>
509
510 <p>In this section we provide a variety of other attributes for pcp-groups. Most of the methods below are based or related to the Fitting subgroup of the given group. We refer to <a href="chapBib_mj.html#biBEic01">[Eic01b]</a> for a description of the underlying methods.</p>
511
512 <p><a id="X780552B57C30DD8F" name="X780552B57C30DD8F"></a></p>
513
514 <h5>7.6-1 FittingSubgroup</h5>
515
516 <div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">&#8227; FittingSubgroup</code>( <var class="Arg">U</var> )</td><td class="tdright">(&nbsp;attribute&nbsp;)</td></tr></table></div>
517 <p>returns the Fitting subgroup of <var class="Arg">U</var>; that is, the largest nilpotent normal subgroup of <var class="Arg">U</var>.</p>
518
519 <p><a id="X86BD63DC844731DF" name="X86BD63DC844731DF"></a></p>
520
521 <h5>7.6-2 IsNilpotentByFinite</h5>
522
523 <div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">&#8227; IsNilpotentByFinite</code>( <var class="Arg">U</var> )</td><td class="tdright">(&nbsp;property&nbsp;)</td></tr></table></div>
524 <p>checks whether the Fitting subgroup of <var class="Arg">U</var> has finite index.</p>
525
526 <p><a id="X847ABE6F781C7FE8" name="X847ABE6F781C7FE8"></a></p>
527
528 <h5>7.6-3 Centre</h5>
529
530 <div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">&#8227; Centre</code>( <var class="Arg">U</var> )</td><td class="tdright">(&nbsp;method&nbsp;)</td></tr></table></div>
531 <p>returns the centre of <var class="Arg">U</var>.</p>
532
533 <p><a id="X861C36368435EB09" name="X861C36368435EB09"></a></p>
534
535 <h5>7.6-4 FCCentre</h5>
536
537 <div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">&#8227; FCCentre</code>( <var class="Arg">U</var> )</td><td class="tdright">(&nbsp;method&nbsp;)</td></tr></table></div>
538 <p>returns the FC-centre of <var class="Arg">U</var>; that is, the subgroup containing all elements having a finite conjugacy class in <var class="Arg">U</var>.</p>
539
540 <p><a id="X7E75E2BC806746AC" name="X7E75E2BC806746AC"></a></p>
541
542 <h5>7.6-5 PolyZNormalSubgroup</h5>
543
544 <div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">&#8227; PolyZNormalSubgroup</code>( <var class="Arg">U</var> )</td><td class="tdright">(&nbsp;function&nbsp;)</td></tr></table></div>
545 <p>returns a normal subgroup <var class="Arg">N</var> of finite index in <var class="Arg">U</var>, such that <var class="Arg">N</var> has a polycyclic series with infinite factors only.</p>
546
547 <p><a id="X86800BF783E30D4A" name="X86800BF783E30D4A"></a></p>
548
549 <h5>7.6-6 NilpotentByAbelianByFiniteSeries</h5>
550
551 <div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">&#8227; NilpotentByAbelianByFiniteSeries</code>( <var class="Arg">U</var> )</td><td class="tdright">(&nbsp;function&nbsp;)</td></tr></table></div>
552 <p>returns a normal series <span class="SimpleMath">\(1 \leq F \leq A \leq U\)</span> such that <span class="SimpleMath">\(F\)</span> is nilpotent, <span class="SimpleMath">\(A/F\)</span> is abelian and <span class="SimpleMath">\(U/A\)</span> is finite. This series is computed using the Fitting subgroup and the centre of the Fitting factor.</p>
553
554 <p><a id="X878DBDC77CCA4F7E" name="X878DBDC77CCA4F7E"></a></p>
555
556 <h4>7.7 <span class="Heading">Functions for nilpotent groups</span></h4>
557
558 <p>There are (very few) functions which are available for nilpotent groups only. First, there are the different central series. These are available for all groups, but for nilpotent groups they terminate and provide series through the full group. Secondly, the determination of a minimal generating set is available for nilpotent groups only.</p>
559
560 <p><a id="X81D15723804771E2" name="X81D15723804771E2"></a></p>
561
562 <h5>7.7-1 MinimalGeneratingSet</h5>
563
564 <div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">&#8227; MinimalGeneratingSet</code>( <var class="Arg">U</var> )</td><td class="tdright">(&nbsp;method&nbsp;)</td></tr></table></div>
565
566 <div class="example"><pre>
567 <span class="GAPprompt">gap&gt;</span> <span class="GAPinput">G := ExamplesOfSomePcpGroups(14);</span>
568 Pcp-group with orders [ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 5, 4, 0, 5, 5, 4, 0, 6,
569 5, 5, 4, 0, 10, 6 ]
570 <span class="GAPprompt">gap&gt;</span> <span class="GAPinput">IsNilpotent(G);</span>
571 true
572
573 <span class="GAPprompt">gap&gt;</span> <span class="GAPinput">PcpsBySeries( LowerCentralSeriesOfGroup(G));</span>
574 [ Pcp [ g1, g2 ] with orders [ 0, 0 ],
575 Pcp [ g3 ] with orders [ 0 ],
576 Pcp [ g4 ] with orders [ 0 ],
577 Pcp [ g5 ] with orders [ 0 ],
578 Pcp [ g6, g7 ] with orders [ 0, 0 ],
579 Pcp [ g8 ] with orders [ 0 ],
580 Pcp [ g9, g10 ] with orders [ 0, 0 ],
581 Pcp [ g11, g12, g13 ] with orders [ 5, 4, 0 ],
582 Pcp [ g14, g15, g16, g17, g18 ] with orders [ 5, 5, 4, 0, 6 ],
583 Pcp [ g19, g20, g21, g22, g23, g24 ] with orders [ 5, 5, 4, 0, 10, 6 ] ]
584
585 <span class="GAPprompt">gap&gt;</span> <span class="GAPinput">PcpsBySeries( UpperCentralSeriesOfGroup(G));</span>
586 [ Pcp [ g1, g2 ] with orders [ 0, 0 ],
587 Pcp [ g3 ] with orders [ 0 ],
588 Pcp [ g4 ] with orders [ 0 ],
589 Pcp [ g5 ] with orders [ 0 ],
590 Pcp [ g6, g7 ] with orders [ 0, 0 ],
591 Pcp [ g8 ] with orders [ 0 ],
592 Pcp [ g9, g10 ] with orders [ 0, 0 ],
593 Pcp [ g11, g12, g13 ] with orders [ 5, 4, 0 ],
594 Pcp [ g14, g15, g16, g17, g18 ] with orders [ 5, 5, 4, 0, 6 ],
595 Pcp [ g19, g20, g21, g22, g23, g24 ] with orders [ 5, 5, 4, 0, 10, 6 ] ]
596
597 <span class="GAPprompt">gap&gt;</span> <span class="GAPinput">MinimalGeneratingSet(G);</span>
598 [ g1, g2 ]
599 </pre></div>
600
601 <p><a id="X8640F9D47A1F7434" name="X8640F9D47A1F7434"></a></p>
602
603 <h4>7.8 <span class="Heading">Random methods for pcp-groups</span></h4>
604
605 <p>Below we introduce a function which computes orbit and stabilizer using a random method. This function tries to approximate the orbit and the stabilizer, but the returned orbit or stabilizer may be incomplete. This function is used in the random methods to compute normalizers and centralizers. Note that deterministic methods for these purposes are also available.</p>
606
607 <p><a id="X80AEE73E7D639699" name="X80AEE73E7D639699"></a></p>
608
609 <h5>7.8-1 RandomCentralizerPcpGroup</h5>
610
611 <div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">&#8227; RandomCentralizerPcpGroup</code>( <var class="Arg">U</var>, <var class="Arg">g</var> )</td><td class="tdright">(&nbsp;function&nbsp;)</td></tr></table></div>
612 <div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">&#8227; RandomCentralizerPcpGroup</code>( <var class="Arg">U</var>, <var class="Arg">V</var> )</td><td class="tdright">(&nbsp;function&nbsp;)</td></tr></table></div>
613 <div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">&#8227; RandomNormalizerPcpGroup</code>( <var class="Arg">U</var>, <var class="Arg">V</var> )</td><td class="tdright">(&nbsp;function&nbsp;)</td></tr></table></div>
614
615 <div class="example"><pre>
616 <span class="GAPprompt">gap&gt;</span> <span class="GAPinput">G := DihedralPcpGroup(0);</span>
617 Pcp-group with orders [ 2, 0 ]
618 <span class="GAPprompt">gap&gt;</span> <span class="GAPinput">mats := [[[-1, 0],[0,1]], [[1,1],[0,1]]];</span>
619 [ [ [ -1, 0 ], [ 0, 1 ] ], [ [ 1, 1 ], [ 0, 1 ] ] ]
620 <span class="GAPprompt">gap&gt;</span> <span class="GAPinput">pcp := Pcp(G);</span>
621 Pcp [ g1, g2 ] with orders [ 2, 0 ]
622
623 <span class="GAPprompt">gap&gt;</span> <span class="GAPinput">RandomPcpOrbitStabilizer( [1,0], pcp, mats, OnRight ).stab;</span>
624 #I Orbit longer than limit: exiting.
625 [ ]
626
627 <span class="GAPprompt">gap&gt;</span> <span class="GAPinput">g := Igs(G)[1];</span>
628 g1
629 <span class="GAPprompt">gap&gt;</span> <span class="GAPinput">RandomCentralizerPcpGroup( G, g );</span>
630 #I Stabilizer not increasing: exiting.
631 Pcp-group with orders [ 2 ]
632 <span class="GAPprompt">gap&gt;</span> <span class="GAPinput">Igs(last);</span>
633 [ g1 ]
634 </pre></div>
635
636 <p><a id="X824142B784453DB9" name="X824142B784453DB9"></a></p>
637
638 <h4>7.9 <span class="Heading">Non-abelian tensor product and Schur extensions</span></h4>
639
640 <p><a id="X79EF28D9845878C9" name="X79EF28D9845878C9"></a></p>
641
642 <h5>7.9-1 SchurExtension</h5>
643
644 <div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">&#8227; SchurExtension</code>( <var class="Arg">G</var> )</td><td class="tdright">(&nbsp;attribute&nbsp;)</td></tr></table></div>
645 <p>Let <var class="Arg">G</var> be a polycyclic group with a polycyclic generating sequence consisting of <span class="SimpleMath">\(n\)</span> elements. This function computes the largest central extension <var class="Arg">H</var> of <var class="Arg">G</var> such that <var class="Arg">H</var> is generated by <span class="SimpleMath">\(n\)</span> elements. If <span class="SimpleMath">\(F/R\)</span> is the underlying polycyclic presentation for <var class="Arg">G</var>, then <var class="Arg">H</var> is isomorphic to <span class="SimpleMath">\(F/[R,F]\)</span>.</p>
646
647
648 <div class="example"><pre>
649 <span class="GAPprompt">gap&gt;</span> <span class="GAPinput">G := DihedralPcpGroup( 0 );</span>
650 Pcp-group with orders [ 2, 0 ]
651 <span class="GAPprompt">gap&gt;</span> <span class="GAPinput">Centre( G );</span>
652 Pcp-group with orders [ ]
653 <span class="GAPprompt">gap&gt;</span> <span class="GAPinput">H := SchurExtension( G );</span>
654 Pcp-group with orders [ 2, 0, 0, 0 ]
655 <span class="GAPprompt">gap&gt;</span> <span class="GAPinput">Centre( H );</span>
656 Pcp-group with orders [ 0, 0 ]
657 <span class="GAPprompt">gap&gt;</span> <span class="GAPinput">H/Centre(H);</span>
658 Pcp-group with orders [ 2, 0 ]
659 <span class="GAPprompt">gap&gt;</span> <span class="GAPinput">Subgroup( H, [H.1,H.2] ) = H;</span>
660 true
661 </pre></div>
662
663 <p><a id="X84B60EC978A9A05E" name="X84B60EC978A9A05E"></a></p>
664
665 <h5>7.9-2 SchurExtensionEpimorphism</h5>
666
667 <div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">&#8227; SchurExtensionEpimorphism</code>( <var class="Arg">G</var> )</td><td class="tdright">(&nbsp;attribute&nbsp;)</td></tr></table></div>
668 <p>returns the projection from the Schur extension <span class="SimpleMath">\(G^{*}\)</span> of <var class="Arg">G</var> onto <var class="Arg">G</var>. See the function <code class="code">SchurExtension</code>. The kernel of this epimorphism is the direct product of the Schur multiplicator of <var class="Arg">G</var> and a direct product of <span class="SimpleMath">\(n\)</span> copies of <span class="SimpleMath">\(ℤ\)</span> where <span class="SimpleMath">\(n\)</span> is the number of generators in the polycyclic presentation for <var class="Arg">G</var>. The Schur multiplicator is the intersection of the kernel and the derived group of the source. See also the function <code class="code">SchurCover</code>.</p>
669
670
671 <div class="example"><pre>
672 <span class="GAPprompt">gap&gt;</span> <span class="GAPinput">gl23 := Range( IsomorphismPcpGroup( GL(2,3) ) );</span>
673 Pcp-group with orders [ 2, 3, 2, 2, 2 ]
674 <span class="GAPprompt">gap&gt;</span> <span class="GAPinput">SchurExtensionEpimorphism( gl23 );</span>
675 [ g1, g2, g3, g4, g5, g6, g7, g8, g9, g10 ] -&gt; [ g1, g2, g3, g4, g5,
676 id, id, id, id, id ]
677 <span class="GAPprompt">gap&gt;</span> <span class="GAPinput">Kernel( last );</span>
678 Pcp-group with orders [ 0, 0, 0, 0, 0 ]
679 <span class="GAPprompt">gap&gt;</span> <span class="GAPinput">AbelianInvariantsMultiplier( gl23 );</span>
680 [ ]
681 <span class="GAPprompt">gap&gt;</span> <span class="GAPinput">Intersection( Kernel(epi), DerivedSubgroup( Source(epi) ) );</span>
682 [ ]
683 </pre></div>
684
685 <p>There is a crossed pairing from <var class="Arg">G</var> into <span class="SimpleMath">\((G^{*})'\)</span> which can be defined via this epimorphism:</p>
686
687
688 <div class="example"><pre>
689 <span class="GAPprompt">gap&gt;</span> <span class="GAPinput">G := DihedralPcpGroup(0);</span>
690 Pcp-group with orders [ 2, 0 ]
691 <span class="GAPprompt">gap&gt;</span> <span class="GAPinput">epi := SchurExtensionEpimorphism( G );</span>
692 [ g1, g2, g3, g4 ] -&gt; [ g1, g2, id, id ]
693 <span class="GAPprompt">gap&gt;</span> <span class="GAPinput">PreImagesRepresentative( epi, G.1 );</span>
694 g1
695 <span class="GAPprompt">gap&gt;</span> <span class="GAPinput">PreImagesRepresentative( epi, G.2 );</span>
696 g2
697 <span class="GAPprompt">gap&gt;</span> <span class="GAPinput">Comm( last, last2 );</span>
698 g2^-2*g4
699 </pre></div>
700
701 <p><a id="X7DD1E37987612042" name="X7DD1E37987612042"></a></p>
702
703 <h5>7.9-3 SchurCover</h5>
704
705 <div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">&#8227; SchurCover</code>( <var class="Arg">G</var> )</td><td class="tdright">(&nbsp;function&nbsp;)</td></tr></table></div>
706 <p>computes a Schur covering group of the polycyclic group <var class="Arg">G</var>. A Schur covering is a largest central extension <var class="Arg">H</var> of <var class="Arg">G</var> such that the kernel <var class="Arg">M</var> of the projection of <var class="Arg">H</var> onto <var class="Arg">G</var> is contained in the commutator subgroup of <var class="Arg">H</var>.</p>
707
708 <p>If <var class="Arg">G</var> is given by a presentation <span class="SimpleMath">\(F/R\)</span>, then <var class="Arg">M</var> is isomorphic to the subgroup <span class="SimpleMath">\(R \cap [F,F] / [R,F]\)</span>. Let <span class="SimpleMath">\(C\)</span> be a complement to <span class="SimpleMath">\(R \cap [F,F] / [R,F]\)</span> in <span class="SimpleMath">\(R/[R,F]\)</span>. Then <span class="SimpleMath">\(F/C\)</span> is isomorphic to <var class="Arg">H</var> and <span class="SimpleMath">\(R/C\)</span> is isomorphic to <var class="Arg">M</var>.</p>
709
710
711 <div class="example"><pre>
712 <span class="GAPprompt">gap&gt;</span> <span class="GAPinput">G := AbelianPcpGroup( 3 );</span>
713 Pcp-group with orders [ 0, 0, 0 ]
714 <span class="GAPprompt">gap&gt;</span> <span class="GAPinput">ext := SchurCover( G );</span>
715 Pcp-group with orders [ 0, 0, 0, 0, 0, 0 ]
716 <span class="GAPprompt">gap&gt;</span> <span class="GAPinput">Centre( ext );</span>
717 Pcp-group with orders [ 0, 0, 0 ]
718 <span class="GAPprompt">gap&gt;</span> <span class="GAPinput">IsSubgroup( DerivedSubgroup( ext ), last );</span>
719 true
720 </pre></div>
721
722 <p><a id="X792BC39D7CEB1D27" name="X792BC39D7CEB1D27"></a></p>
723
724 <h5>7.9-4 AbelianInvariantsMultiplier</h5>
725
726 <div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">&#8227; AbelianInvariantsMultiplier</code>( <var class="Arg">G</var> )</td><td class="tdright">(&nbsp;attribute&nbsp;)</td></tr></table></div>
727 <p>returns a list of the abelian invariants of the Schur multiplier of G.</p>
728
729 <p>Note that the Schur multiplicator of a polycyclic group is a finitely generated abelian group.</p>
730
731
732 <div class="example"><pre>
733 <span class="GAPprompt">gap&gt;</span> <span class="GAPinput">G := DihedralPcpGroup( 0 );</span>
734 Pcp-group with orders [ 2, 0 ]
735 <span class="GAPprompt">gap&gt;</span> <span class="GAPinput">DirectProduct( G, AbelianPcpGroup( 2 ) );</span>
736 Pcp-group with orders [ 0, 0, 2, 0 ]
737 <span class="GAPprompt">gap&gt;</span> <span class="GAPinput">AbelianInvariantsMultiplier( last );</span>
738 [ 0, 2, 2, 2, 2 ]
739 </pre></div>
740
741 <p><a id="X822ED5978647C93B" name="X822ED5978647C93B"></a></p>
742
743 <h5>7.9-5 NonAbelianExteriorSquareEpimorphism</h5>
744
745 <div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">&#8227; NonAbelianExteriorSquareEpimorphism</code>( <var class="Arg">G</var> )</td><td class="tdright">(&nbsp;function&nbsp;)</td></tr></table></div>
746 <p>returns the epimorphism of the non-abelian exterior square of a polycyclic group <var class="Arg">G</var> onto the derived group of <var class="Arg">G</var>. The non-abelian exterior square can be defined as the derived subgroup of a Schur cover of <var class="Arg">G</var>. The isomorphism type of the non-abelian exterior square is unique despite the fact that the isomorphism type of a Schur cover of a polycyclic groups need not be unique. The derived group of a Schur cover has a natural projection onto the derived group of <var class="Arg">G</var> which is what the function returns.</p>
747
748 <p>The kernel of the epimorphism is isomorphic to the Schur multiplicator of <var class="Arg">G</var>.</p>
749
750
751 <div class="example"><pre>
752 <span class="GAPprompt">gap&gt;</span> <span class="GAPinput">G := ExamplesOfSomePcpGroups( 3 );</span>
753 Pcp-group with orders [ 0, 0 ]
754 <span class="GAPprompt">gap&gt;</span> <span class="GAPinput">G := DirectProduct( G,G );</span>
755 Pcp-group with orders [ 0, 0, 0, 0 ]
756 <span class="GAPprompt">gap&gt;</span> <span class="GAPinput">AbelianInvariantsMultiplier( G );</span>
757 [ [ 0, 1 ], [ 2, 3 ] ]
758 <span class="GAPprompt">gap&gt;</span> <span class="GAPinput">epi := NonAbelianExteriorSquareEpimorphism( G );</span>
759 [ g2^-2*g5, g4^-2*g10, g6, g7, g8, g9 ] -&gt; [ g2^-2, g4^-2, id, id, id, id ]
760 <span class="GAPprompt">gap&gt;</span> <span class="GAPinput">Kernel( epi );</span>
761 Pcp-group with orders [ 0, 2, 2, 2 ]
762 <span class="GAPprompt">gap&gt;</span> <span class="GAPinput">Collected( AbelianInvariants( last ) );</span>
763 [ [ 0, 1 ], [ 2, 3 ] ]
764 </pre></div>
765
766 <p><a id="X8739CD4686301A0E" name="X8739CD4686301A0E"></a></p>
767
768 <h5>7.9-6 NonAbelianExteriorSquare</h5>
769
770 <div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">&#8227; NonAbelianExteriorSquare</code>( <var class="Arg">G</var> )</td><td class="tdright">(&nbsp;attribute&nbsp;)</td></tr></table></div>
771 <p>computes the non-abelian exterior square of a polycyclic group <var class="Arg">G</var>. See the explanation for <code class="code">NonAbelianExteriorSquareEpimorphism</code>. The natural projection of the non-abelian exterior square onto the derived group of <var class="Arg">G</var> is stored in the component <code class="code">!.epimorphism</code>.</p>
772
773 <p>There is a crossed pairing from <span class="SimpleMath">\(G\times G\)</span> into <span class="SimpleMath">\(G\wedge G\)</span>. See the function <code class="code">SchurExtensionEpimorphism</code> for details. The crossed pairing is stored in the component <code class="code">!.crossedPairing</code>. This is the crossed pairing <span class="SimpleMath">\(\lambda\)</span> in <a href="chapBib_mj.html#biBEickNickel07">[EN08]</a>.</p>
774
775
776 <div class="example"><pre>
777 <span class="GAPprompt">gap&gt;</span> <span class="GAPinput">G := DihedralPcpGroup(0);</span>
778 Pcp-group with orders [ 2, 0 ]
779 <span class="GAPprompt">gap&gt;</span> <span class="GAPinput">GwG := NonAbelianExteriorSquare( G );</span>
780 Pcp-group with orders [ 0 ]
781 <span class="GAPprompt">gap&gt;</span> <span class="GAPinput">lambda := GwG!.crossedPairing;</span>
782 function( g, h ) ... end
783 <span class="GAPprompt">gap&gt;</span> <span class="GAPinput">lambda( G.1, G.2 );</span>
784 g2^2*g4^-1
785 </pre></div>
786
787 <p><a id="X86553D7B7DABF38F" name="X86553D7B7DABF38F"></a></p>
788
789 <h5>7.9-7 NonAbelianTensorSquareEpimorphism</h5>
790
791 <div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">&#8227; NonAbelianTensorSquareEpimorphism</code>( <var class="Arg">G</var> )</td><td class="tdright">(&nbsp;function&nbsp;)</td></tr></table></div>
792 <p>returns for a polycyclic group <var class="Arg">G</var> the projection of the non-abelian tensor square <span class="SimpleMath">\(G\otimes G\)</span> onto the non-abelian exterior square <span class="SimpleMath">\(G\wedge G\)</span>. The range of that epimorphism has the component <code class="code">!.epimorphism</code> set to the projection of the non-abelian exterior square onto the derived group of <var class="Arg">G</var>. See also the function <code class="code">NonAbelianExteriorSquare</code>.</p>
793
794 <p>With the result of this function one can compute the groups in the commutative diagram at the beginning of the paper <a href="chapBib_mj.html#biBEickNickel07">[EN08]</a>. The kernel of the returned epimorphism is the group <span class="SimpleMath">\(\nabla(G)\)</span>. The kernel of the composition of this epimorphism and the above mention projection onto <span class="SimpleMath">\(G'\)</span> is the group <span class="SimpleMath">\(J(G)\)</span>.</p>
795
796
797 <div class="example"><pre>
798 <span class="GAPprompt">gap&gt;</span> <span class="GAPinput">G := DihedralPcpGroup(0);</span>
799 Pcp-group with orders [ 2, 0 ]
800 <span class="GAPprompt">gap&gt;</span> <span class="GAPinput">G := DirectProduct(G,G);</span>
801 Pcp-group with orders [ 2, 0, 2, 0 ]
802 <span class="GAPprompt">gap&gt;</span> <span class="GAPinput">alpha := NonAbelianTensorSquareEpimorphism( G );</span>
803 [ g9*g25^-1, g10*g26^-1, g11*g27, g12*g28, g13*g29, g14*g30, g15, g16,
804 g17,
805 g18, g19, g20, g21, g22, g23, g24 ] -&gt; [ g2^-2*g6, g4^-2*g12, g8,
806 g9, g10,
807 g11, id, id, id, id, id, id, id, id, id, id ]
808 <span class="GAPprompt">gap&gt;</span> <span class="GAPinput">gamma := Range( alpha )!.epimorphism;</span>
809 [ g2^-2*g6, g4^-2*g12, g8, g9, g10, g11 ] -&gt; [ g2^-2, g4^-2, id, id,
810 id, id ]
811 <span class="GAPprompt">gap&gt;</span> <span class="GAPinput">JG := Kernel( alpha * gamma );</span>
812 Pcp-group with orders [ 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2 ]
813 <span class="GAPprompt">gap&gt;</span> <span class="GAPinput">Image( alpha, JG );</span>
814 Pcp-group with orders [ 2, 2, 2, 2 ]
815 <span class="GAPprompt">gap&gt;</span> <span class="GAPinput">AbelianInvariantsMultiplier( G );</span>
816 [ [ 2, 4 ] ]
817 </pre></div>
818
819 <p><a id="X7C0DF7C97F78C666" name="X7C0DF7C97F78C666"></a></p>
820
821 <h5>7.9-8 NonAbelianTensorSquare</h5>
822
823 <div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">&#8227; NonAbelianTensorSquare</code>( <var class="Arg">G</var> )</td><td class="tdright">(&nbsp;attribute&nbsp;)</td></tr></table></div>
824 <p>computes for a polycyclic group <var class="Arg">G</var> the non-abelian tensor square <span class="SimpleMath">\(G\otimes G\)</span>.</p>
825
826
827 <div class="example"><pre>
828 <span class="GAPprompt">gap&gt;</span> <span class="GAPinput">G := AlternatingGroup( IsPcGroup, 4 );</span>
829 &lt;pc group of size 12 with 3 generators&gt;
830 <span class="GAPprompt">gap&gt;</span> <span class="GAPinput">PcGroupToPcpGroup( G );</span>
831 Pcp-group with orders [ 3, 2, 2 ]
832 <span class="GAPprompt">gap&gt;</span> <span class="GAPinput">NonAbelianTensorSquare( last );</span>
833 Pcp-group with orders [ 2, 2, 2, 3 ]
834 <span class="GAPprompt">gap&gt;</span> <span class="GAPinput">PcpGroupToPcGroup( last );</span>
835 &lt;pc group of size 24 with 4 generators&gt;
836 <span class="GAPprompt">gap&gt;</span> <span class="GAPinput">DirectFactorsOfGroup( last );</span>
837 [ Group([ f1, f2, f3 ]), Group([ f4 ]) ]
838 <span class="GAPprompt">gap&gt;</span> <span class="GAPinput">List( last, Size );</span>
839 [ 8, 3 ]
840 <span class="GAPprompt">gap&gt;</span> <span class="GAPinput">IdGroup( last2[1] );</span>
841 [ 8, 4 ] # the quaternion group of Order 8
842
843 <span class="GAPprompt">gap&gt;</span> <span class="GAPinput">G := DihedralPcpGroup( 0 );</span>
844 Pcp-group with orders [ 2, 0 ]
845 <span class="GAPprompt">gap&gt;</span> <span class="GAPinput">ten := NonAbelianTensorSquare( G );</span>
846 Pcp-group with orders [ 0, 2, 2, 2 ]
847 <span class="GAPprompt">gap&gt;</span> <span class="GAPinput">IsAbelian( ten );</span>
848 true
849 </pre></div>
850
851 <p><a id="X7AE75EC1860FFE7A" name="X7AE75EC1860FFE7A"></a></p>
852
853 <h5>7.9-9 NonAbelianExteriorSquarePlusEmbedding</h5>
854
855 <div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">&#8227; NonAbelianExteriorSquarePlusEmbedding</code>( <var class="Arg">G</var> )</td><td class="tdright">(&nbsp;function&nbsp;)</td></tr></table></div>
856 <p>returns an embedding from the non-abelian exterior square <span class="SimpleMath">\(G\wedge G\)</span> into an extensions of <span class="SimpleMath">\(G\wedge G\)</span> by <span class="SimpleMath">\(G\times G\)</span>. For the significance of the group see the paper <a href="chapBib_mj.html#biBEickNickel07">[EN08]</a>. The range of the epimorphism is the group <span class="SimpleMath">\(\tau(G)\)</span> in that paper.</p>
857
858 <p><a id="X7D96C84E87925B0F" name="X7D96C84E87925B0F"></a></p>
859
860 <h5>7.9-10 NonAbelianTensorSquarePlusEpimorphism</h5>
861
862 <div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">&#8227; NonAbelianTensorSquarePlusEpimorphism</code>( <var class="Arg">G</var> )</td><td class="tdright">(&nbsp;function&nbsp;)</td></tr></table></div>
863 <p>returns an epimorphisms of <span class="SimpleMath">\(\nu(G)\)</span> onto <span class="SimpleMath">\(\tau(G)\)</span>. The group <span class="SimpleMath">\(\nu(G)\)</span> is an extension of the non-abelian tensor square <span class="SimpleMath">\(G\otimes G\)</span> of <span class="SimpleMath">\(G\)</span> by <span class="SimpleMath">\(G\times G\)</span>. The group <span class="SimpleMath">\(\tau(G)\)</span> is an extension of the non-abelian exterior square <span class="SimpleMath">\(G\wedge G\)</span> by <span class="SimpleMath">\(G\times G\)</span>. For details see <a href="chapBib_mj.html#biBEickNickel07">[EN08]</a>.</p>
864
865 <p><a id="X8746533787C4E8BC" name="X8746533787C4E8BC"></a></p>
866
867 <h5>7.9-11 NonAbelianTensorSquarePlus</h5>
868
869 <div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">&#8227; NonAbelianTensorSquarePlus</code>( <var class="Arg">G</var> )</td><td class="tdright">(&nbsp;function&nbsp;)</td></tr></table></div>
870 <p>returns the group <span class="SimpleMath">\(\nu(G)\)</span> in <a href="chapBib_mj.html#biBEickNickel07">[EN08]</a>.</p>
871
872 <p><a id="X78F9184078B2761A" name="X78F9184078B2761A"></a></p>
873
874 <h5>7.9-12 WhiteheadQuadraticFunctor</h5>
875
876 <div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">&#8227; WhiteheadQuadraticFunctor</code>( <var class="Arg">G</var> )</td><td class="tdright">(&nbsp;function&nbsp;)</td></tr></table></div>
877 <p>returns Whitehead's universal quadratic functor of <span class="SimpleMath">\(G\)</span>, see <a href="chapBib_mj.html#biBEickNickel07">[EN08]</a> for a description.</p>
878
879 <p><a id="X7D3023697BA5CE5A" name="X7D3023697BA5CE5A"></a></p>
880
881 <h4>7.10 <span class="Heading">Schur covers</span></h4>
882
883 <p>This section contains a function to determine the Schur covers of a finite <span class="SimpleMath">\(p\)</span>-group up to isomorphism.</p>
884
885 <p><a id="X7D90B44E7B96AFF1" name="X7D90B44E7B96AFF1"></a></p>
886
887 <h5>7.10-1 SchurCovers</h5>
888
889 <div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">&#8227; SchurCovers</code>( <var class="Arg">G</var> )</td><td class="tdright">(&nbsp;function&nbsp;)</td></tr></table></div>
890 <p>Let <var class="Arg">G</var> be a finite <span class="SimpleMath">\(p\)</span>-group defined as a pcp group. This function returns a complete and irredundant set of isomorphism types of Schur covers of <var class="Arg">G</var>. The algorithm implements a method of Nickel's Phd Thesis.</p>
891
892
893 <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="chap6_mj.html">[Previous Chapter]</a>&nbsp; &nbsp;<a href="chap8_mj.html">[Next Chapter]</a>&nbsp; </div>
894
895
896 <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="chap2_mj.html">2</a> <a href="chap3_mj.html">3</a> <a href="chap4_mj.html">4</a> <a href="chap5_mj.html">5</a> <a href="chap6_mj.html">6</a> <a href="chap7_mj.html">7</a> <a href="chap8_mj.html">8</a> <a href="chap9_mj.html">9</a> <a href="chapA_mj.html">A</a> <a href="chapBib_mj.html">Bib</a> <a href="chapInd_mj.html">Ind</a> </div>
897
898 <hr />
899 <p class="foot">generated by <a href="https://www.math.rwth-aachen.de/~Frank.Luebeck/GAPDoc">GAPDoc2HTML</a></p>
900 </body>
901 </html>