Debian Codegraph @

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