Debian Codegraph @

doc/chap3_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 3: Collectors</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="chap3" 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="chap2_mj.html">[Previous Chapter]</a>&nbsp; &nbsp;<a href="chap4_mj.html">[Next Chapter]</a>&nbsp; </div>
24
25 <p id="mathjaxlink" class="pcenter"><a href="chap3.html">[MathJax off]</a></p>
26 <p><a id="X792305CC81E8606A" name="X792305CC81E8606A"></a></p>
27 <div class="ChapSects"><a href="chap3_mj.html#X792305CC81E8606A">3 <span class="Heading">Collectors</span></a>
28 <div class="ContSect"><span class="tocline"><span class="nocss">&nbsp;</span><a href="chap3_mj.html#X800FD91386C08CD8">3.1 <span class="Heading">Constructing a Collector</span></a>
29 </span>
30 <div class="ContSSBlock">
31 <span class="ContSS"><br /><span class="nocss">&nbsp;&nbsp;</span><a href="chap3_mj.html#X8382A4E78706DE65">3.1-1 FromTheLeftCollector</a></span>
32 <span class="ContSS"><br /><span class="nocss">&nbsp;&nbsp;</span><a href="chap3_mj.html#X79A308B28183493B">3.1-2 SetRelativeOrder</a></span>
33 <span class="ContSS"><br /><span class="nocss">&nbsp;&nbsp;</span><a href="chap3_mj.html#X7BC319BA8698420C">3.1-3 SetPower</a></span>
34 <span class="ContSS"><br /><span class="nocss">&nbsp;&nbsp;</span><a href="chap3_mj.html#X86A08D887E049347">3.1-4 SetConjugate</a></span>
35 <span class="ContSS"><br /><span class="nocss">&nbsp;&nbsp;</span><a href="chap3_mj.html#X7B25997C7DF92B6D">3.1-5 SetCommutator</a></span>
36 <span class="ContSS"><br /><span class="nocss">&nbsp;&nbsp;</span><a href="chap3_mj.html#X7E9903F57BC5CC24">3.1-6 UpdatePolycyclicCollector</a></span>
37 <span class="ContSS"><br /><span class="nocss">&nbsp;&nbsp;</span><a href="chap3_mj.html#X8006790B86328CE8">3.1-7 IsConfluent</a></span>
38 </div></div>
39 <div class="ContSect"><span class="tocline"><span class="nocss">&nbsp;</span><a href="chap3_mj.html#X818484817C3BAAE6">3.2 <span class="Heading">Accessing Parts of a Collector</span></a>
40 </span>
41 <div class="ContSSBlock">
42 <span class="ContSS"><br /><span class="nocss">&nbsp;&nbsp;</span><a href="chap3_mj.html#X7DD0DF677AC1CF10">3.2-1 RelativeOrders</a></span>
43 <span class="ContSS"><br /><span class="nocss">&nbsp;&nbsp;</span><a href="chap3_mj.html#X844C0A478735EF4B">3.2-2 GetPower</a></span>
44 <span class="ContSS"><br /><span class="nocss">&nbsp;&nbsp;</span><a href="chap3_mj.html#X865160E07FA93E00">3.2-3 GetConjugate</a></span>
45 <span class="ContSS"><br /><span class="nocss">&nbsp;&nbsp;</span><a href="chap3_mj.html#X7D6A26A4871FF51A">3.2-4 NumberOfGenerators</a></span>
46 <span class="ContSS"><br /><span class="nocss">&nbsp;&nbsp;</span><a href="chap3_mj.html#X873ECF388503E5DE">3.2-5 ObjByExponents</a></span>
47 <span class="ContSS"><br /><span class="nocss">&nbsp;&nbsp;</span><a href="chap3_mj.html#X85BCB97B8021EAD6">3.2-6 ExponentsByObj</a></span>
48 </div></div>
49 <div class="ContSect"><span class="tocline"><span class="nocss">&nbsp;</span><a href="chap3_mj.html#X79AEB3477800DC16">3.3 <span class="Heading">Special Features</span></a>
50 </span>
51 <div class="ContSSBlock">
52 <span class="ContSS"><br /><span class="nocss">&nbsp;&nbsp;</span><a href="chap3_mj.html#X82EE2ACD7B8C178B">3.3-1 IsWeightedCollector</a></span>
53 <span class="ContSS"><br /><span class="nocss">&nbsp;&nbsp;</span><a href="chap3_mj.html#X7A1D7ED68334282C">3.3-2 AddHallPolynomials</a></span>
54 <span class="ContSS"><br /><span class="nocss">&nbsp;&nbsp;</span><a href="chap3_mj.html#X81FB5BE27903EC32">3.3-3 String</a></span>
55 <span class="ContSS"><br /><span class="nocss">&nbsp;&nbsp;</span><a href="chap3_mj.html#X7ED466B6807D16FE">3.3-4 FTLCollectorPrintTo</a></span>
56 <span class="ContSS"><br /><span class="nocss">&nbsp;&nbsp;</span><a href="chap3_mj.html#X789D9EB37ECFA9D7">3.3-5 FTLCollectorAppendTo</a></span>
57 <span class="ContSS"><br /><span class="nocss">&nbsp;&nbsp;</span><a href="chap3_mj.html#X808A26FB873A354F">3.3-6 UseLibraryCollector</a></span>
58 <span class="ContSS"><br /><span class="nocss">&nbsp;&nbsp;</span><a href="chap3_mj.html#X844E195C7D55F8BD">3.3-7 USE_LIBRARY_COLLECTOR</a></span>
59 <span class="ContSS"><br /><span class="nocss">&nbsp;&nbsp;</span><a href="chap3_mj.html#X7945C6B97BECCDA8">3.3-8 DEBUG_COMBINATORIAL_COLLECTOR</a></span>
60 <span class="ContSS"><br /><span class="nocss">&nbsp;&nbsp;</span><a href="chap3_mj.html#X7BDFB55D7CB33543">3.3-9 USE_COMBINATORIAL_COLLECTOR</a></span>
61 </div></div>
62 </div>
63
64 <h3>3 <span class="Heading">Collectors</span></h3>
65
66 <p>Let <span class="SimpleMath">\(G\)</span> be a group defined by a pc-presentation as described in the Chapter <a href="chap2_mj.html#X792561B378D95B23"><span class="RefLink"><span class="Heading">Introduction to polycyclic presentations</span></span></a>.</p>
67
68 <p>The process for computing the collected form for an arbitrary word in the generators of <span class="SimpleMath">\(G\)</span> is called <em>collection</em>. The basic idea in collection is the following. Given a word in the defining generators, one scans the word for occurrences of adjacent generators (or their inverses) in the wrong order or occurrences of subwords <span class="SimpleMath">\(g_i^{e_i}\)</span> with <span class="SimpleMath">\(i\in I\)</span> and <span class="SimpleMath">\(e_i\)</span> not in the range <span class="SimpleMath">\(0\ldots r_{i}-1\)</span>. In the first case, the appropriate conjugacy relation is used to move the generator with the smaller index to the left. In the second case, one uses the appropriate power relation to move the exponent of <span class="SimpleMath">\(g_i\)</span> into the required range. These steps are repeated until a collected word is obtained.</p>
69
70 <p>There exist a number of different strategies for collecting a given word to collected form. The strategies implemented in this package are <em>collection from the left</em> as described by <a href="chapBib_mj.html#biBLGS90">[LS90]</a> and <a href="chapBib_mj.html#biBSims94">[Sim94]</a> and <em>combinatorial collection from the left</em> by <a href="chapBib_mj.html#biBMVL90">[Vau90]</a>. In addition, the package provides access to Hall polynomials computed by Deep Thought for the multiplication in a nilpotent group, see <a href="chapBib_mj.html#biBWWM97">[Mer97]</a> and <a href="chapBib_mj.html#biBLGS98">[LS98]</a>.</p>
71
72 <p>The first step in defining a pc-presented group is setting up a data structure that knows the pc-presentation and has routines that perform the collection algorithm with words in the generators of the presentation. Such a data structure is called <em>a collector</em>.</p>
73
74 <p>To describe the right hand sides of the relations in a pc-presentation we use <em>generator exponent lists</em>; the word <span class="SimpleMath">\(g_{i_1}^{e_1}g_{i_2}^{e_2}\ldots g_{i_k}^{e_k}\)</span> is represented by the generator exponent list <span class="SimpleMath">\([i_1,e_1,i_2,e_2,\ldots,i_k,e_k]\)</span>.</p>
75
76 <p><a id="X800FD91386C08CD8" name="X800FD91386C08CD8"></a></p>
77
78 <h4>3.1 <span class="Heading">Constructing a Collector</span></h4>
79
80 <p>A collector for a group given by a pc-presentation starts by setting up an empty data structure for the collector. Then the relative orders, the power relations and the conjugate relations are added into the data structure. The construction is finalised by calling a routine that completes the data structure for the collector. The following functions provide the necessary tools for setting up a collector.</p>
81
82 <p><a id="X8382A4E78706DE65" name="X8382A4E78706DE65"></a></p>
83
84 <h5>3.1-1 FromTheLeftCollector</h5>
85
86 <div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">&#8227; FromTheLeftCollector</code>( <var class="Arg">n</var> )</td><td class="tdright">(&nbsp;operation&nbsp;)</td></tr></table></div>
87 <p>returns an empty data structure for a collector with <var class="Arg">n</var> generators. No generator has a relative order, no right hand sides of power and conjugate relations are defined. Two generators for which no right hand side of a conjugate relation is defined commute. Therefore, the collector returned by this function can be used to define a free abelian group of rank <var class="Arg">n</var>.</p>
88
89
90 <div class="example"><pre>
91 <span class="GAPprompt">gap&gt;</span> <span class="GAPinput">ftl := FromTheLeftCollector( 4 );</span>
92 &lt;&lt;from the left collector with 4 generators&gt;&gt;
93 <span class="GAPprompt">gap&gt;</span> <span class="GAPinput">PcpGroupByCollector( ftl );</span>
94 Pcp-group with orders [ 0, 0, 0, 0 ]
95 <span class="GAPprompt">gap&gt;</span> <span class="GAPinput">IsAbelian(last);</span>
96 true
97 </pre></div>
98
99 <p>If the relative order of a generators has been defined (see <code class="func">SetRelativeOrder</code> (<a href="chap3_mj.html#X79A308B28183493B"><span class="RefLink">3.1-2</span></a>)), but the right hand side of the corresponding power relation has not, then the order and the relative order of the generator are the same.</p>
100
101 <p><a id="X79A308B28183493B" name="X79A308B28183493B"></a></p>
102
103 <h5>3.1-2 SetRelativeOrder</h5>
104
105 <div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">&#8227; SetRelativeOrder</code>( <var class="Arg">coll</var>, <var class="Arg">i</var>, <var class="Arg">ro</var> )</td><td class="tdright">(&nbsp;operation&nbsp;)</td></tr></table></div>
106 <div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">&#8227; SetRelativeOrderNC</code>( <var class="Arg">coll</var>, <var class="Arg">i</var>, <var class="Arg">ro</var> )</td><td class="tdright">(&nbsp;operation&nbsp;)</td></tr></table></div>
107 <p>set the relative order in collector <var class="Arg">coll</var> for generator <var class="Arg">i</var> to <var class="Arg">ro</var>. The parameter <var class="Arg">coll</var> is a collector as returned by the function <code class="func">FromTheLeftCollector</code> (<a href="chap3_mj.html#X8382A4E78706DE65"><span class="RefLink">3.1-1</span></a>), <var class="Arg">i</var> is a generator number and <var class="Arg">ro</var> is a non-negative integer. The generator number <var class="Arg">i</var> is an integer in the range <span class="SimpleMath">\(1,\ldots,n\)</span> where <span class="SimpleMath">\(n\)</span> is the number of generators of the collector.</p>
108
109 <p>If <var class="Arg">ro</var> is <span class="SimpleMath">\(0,\)</span> then the generator with number <var class="Arg">i</var> has infinite order and no power relation can be specified. As a side effect in this case, a previously defined power relation is deleted.</p>
110
111 <p>If <var class="Arg">ro</var> is the relative order of a generator with number <var class="Arg">i</var> and no power relation is set for that generator, then <var class="Arg">ro</var> is the order of that generator.</p>
112
113 <p>The NC version of the function bypasses checks on the range of <var class="Arg">i</var>.</p>
114
115
116 <div class="example"><pre>
117 <span class="GAPprompt">gap&gt;</span> <span class="GAPinput">ftl := FromTheLeftCollector( 4 );</span>
118 &lt;&lt;from the left collector with 4 generators&gt;&gt;
119 <span class="GAPprompt">gap&gt;</span> <span class="GAPinput">for i in [1..4] do SetRelativeOrder( ftl, i, 3 ); od;</span>
120 <span class="GAPprompt">gap&gt;</span> <span class="GAPinput">G := PcpGroupByCollector( ftl );</span>
121 Pcp-group with orders [ 3, 3, 3, 3 ]
122 <span class="GAPprompt">gap&gt;</span> <span class="GAPinput">IsElementaryAbelian( G );</span>
123 true
124 </pre></div>
125
126 <p><a id="X7BC319BA8698420C" name="X7BC319BA8698420C"></a></p>
127
128 <h5>3.1-3 SetPower</h5>
129
130 <div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">&#8227; SetPower</code>( <var class="Arg">coll</var>, <var class="Arg">i</var>, <var class="Arg">rhs</var> )</td><td class="tdright">(&nbsp;operation&nbsp;)</td></tr></table></div>
131 <div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">&#8227; SetPowerNC</code>( <var class="Arg">coll</var>, <var class="Arg">i</var>, <var class="Arg">rhs</var> )</td><td class="tdright">(&nbsp;operation&nbsp;)</td></tr></table></div>
132 <p>set the right hand side of the power relation for generator <var class="Arg">i</var> in collector <var class="Arg">coll</var> to (a copy of) <var class="Arg">rhs</var>. An attempt to set the right hand side for a generator without a relative order results in an error.</p>
133
134 <p>Right hand sides are by default assumed to be trivial.</p>
135
136 <p>The parameter <var class="Arg">coll</var> is a collector, <var class="Arg">i</var> is a generator number and <var class="Arg">rhs</var> is a generators exponent list or an element from a free group.</p>
137
138 <p>The no-check (NC) version of the function bypasses checks on the range of <var class="Arg">i</var> and stores <var class="Arg">rhs</var> (instead of a copy) in the collector.</p>
139
140 <p><a id="X86A08D887E049347" name="X86A08D887E049347"></a></p>
141
142 <h5>3.1-4 SetConjugate</h5>
143
144 <div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">&#8227; SetConjugate</code>( <var class="Arg">coll</var>, <var class="Arg">j</var>, <var class="Arg">i</var>, <var class="Arg">rhs</var> )</td><td class="tdright">(&nbsp;operation&nbsp;)</td></tr></table></div>
145 <div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">&#8227; SetConjugateNC</code>( <var class="Arg">coll</var>, <var class="Arg">j</var>, <var class="Arg">i</var>, <var class="Arg">rhs</var> )</td><td class="tdright">(&nbsp;operation&nbsp;)</td></tr></table></div>
146 <p>set the right hand side of the conjugate relation for the generators <var class="Arg">j</var> and <var class="Arg">i</var> with <var class="Arg">j</var> larger than <var class="Arg">i</var>. The parameter <var class="Arg">coll</var> is a collector, <var class="Arg">j</var> and <var class="Arg">i</var> are generator numbers and <var class="Arg">rhs</var> is a generator exponent list or an element from a free group. Conjugate relations are by default assumed to be trivial.</p>
147
148 <p>The generator number <var class="Arg">i</var> can be negative in order to define conjugation by the inverse of a generator.</p>
149
150 <p>The no-check (NC) version of the function bypasses checks on the range of <var class="Arg">i</var> and <var class="Arg">j</var> and stores <var class="Arg">rhs</var> (instead of a copy) in the collector.</p>
151
152 <p><a id="X7B25997C7DF92B6D" name="X7B25997C7DF92B6D"></a></p>
153
154 <h5>3.1-5 SetCommutator</h5>
155
156 <div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">&#8227; SetCommutator</code>( <var class="Arg">coll</var>, <var class="Arg">j</var>, <var class="Arg">i</var>, <var class="Arg">rhs</var> )</td><td class="tdright">(&nbsp;operation&nbsp;)</td></tr></table></div>
157 <p>set the right hand side of the conjugate relation for the generators <var class="Arg">j</var> and <var class="Arg">i</var> with <var class="Arg">j</var> larger than <var class="Arg">i</var> by specifying the commutator of <var class="Arg">j</var> and <var class="Arg">i</var>. The parameter <var class="Arg">coll</var> is a collector, <var class="Arg">j</var> and <var class="Arg">i</var> are generator numbers and <var class="Arg">rhs</var> is a generator exponent list or an element from a free group.</p>
158
159 <p>The generator number <var class="Arg">i</var> can be negative in order to define the right hand side of a commutator relation with the second generator being the inverse of a generator.</p>
160
161 <p><a id="X7E9903F57BC5CC24" name="X7E9903F57BC5CC24"></a></p>
162
163 <h5>3.1-6 UpdatePolycyclicCollector</h5>
164
165 <div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">&#8227; UpdatePolycyclicCollector</code>( <var class="Arg">coll</var> )</td><td class="tdright">(&nbsp;operation&nbsp;)</td></tr></table></div>
166 <p>completes the data structures of a collector. This is usually the last step in setting up a collector. Among the steps performed is the completion of the conjugate relations. For each non-trivial conjugate relation of a generator, the corresponding conjugate relation of the inverse generator is calculated.</p>
167
168 <p>Note that <code class="code">UpdatePolycyclicCollector</code> is automatically called by the function <code class="code">PcpGroupByCollector</code> (see <code class="func">PcpGroupByCollector</code> (<a href="chap4_mj.html#X7C8FBCAB7F63FACB"><span class="RefLink">4.3-1</span></a>)).</p>
169
170 <p><a id="X8006790B86328CE8" name="X8006790B86328CE8"></a></p>
171
172 <h5>3.1-7 IsConfluent</h5>
173
174 <div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">&#8227; IsConfluent</code>( <var class="Arg">coll</var> )</td><td class="tdright">(&nbsp;property&nbsp;)</td></tr></table></div>
175 <p>tests if the collector <var class="Arg">coll</var> is confluent. The function returns true or false accordingly.</p>
176
177 <p>Compare Chapter <a href="chap2_mj.html#X792561B378D95B23"><span class="RefLink">2</span></a> for a definition of confluence.</p>
178
179 <p>Note that confluence is automatically checked by the function <code class="code">PcpGroupByCollector</code> (see <code class="func">PcpGroupByCollector</code> (<a href="chap4_mj.html#X7C8FBCAB7F63FACB"><span class="RefLink">4.3-1</span></a>)).</p>
180
181 <p>The following example defines a collector for a semidirect product of the cyclic group of order <span class="SimpleMath">\(3\)</span> with the free abelian group of rank <span class="SimpleMath">\(2\)</span>. The action of the cyclic group on the free abelian group is given by the matrix</p>
182
183 <p class="center">\[\pmatrix{ 0 &amp; 1 \cr -1 &amp; -1}.\]</p>
184
185 <p>This leads to the following polycyclic presentation:</p>
186
187 <p class="center">\[\langle g_1,g_2,g_3 | g_1^3,
188 g_2^{g_1}=g_3,
189 g_3^{g_1}=g_2^{-1}g_3^{-1},
190 g_3^{g_2}=g_3\rangle.\]</p>
191
192
193 <div class="example"><pre>
194 <span class="GAPprompt">gap&gt;</span> <span class="GAPinput">ftl := FromTheLeftCollector( 3 );</span>
195 &lt;&lt;from the left collector with 3 generators&gt;&gt;
196 <span class="GAPprompt">gap&gt;</span> <span class="GAPinput">SetRelativeOrder( ftl, 1, 3 );</span>
197 <span class="GAPprompt">gap&gt;</span> <span class="GAPinput">SetConjugate( ftl, 2, 1, [3,1] );</span>
198 <span class="GAPprompt">gap&gt;</span> <span class="GAPinput">SetConjugate( ftl, 3, 1, [2,-1,3,-1] );</span>
199 <span class="GAPprompt">gap&gt;</span> <span class="GAPinput">UpdatePolycyclicCollector( ftl );</span>
200 <span class="GAPprompt">gap&gt;</span> <span class="GAPinput">IsConfluent( ftl );</span>
201 true
202 </pre></div>
203
204 <p>The action of the inverse of <span class="SimpleMath">\(g_1\)</span> on <span class="SimpleMath">\(\langle g_2,g_2\rangle\)</span> is given by the matrix</p>
205
206 <p class="center">\[\pmatrix{ -1 &amp; -1 \cr 1 &amp; 0}.\]</p>
207
208 <p>The corresponding conjugate relations are automatically computed by <code class="code">UpdatePolycyclicCollector</code>. It is also possible to specify the conjugation by inverse generators. Note that you need to run <code class="code">UpdatePolycyclicCollector</code> after one of the set functions has been used.</p>
209
210
211 <div class="example"><pre>
212 <span class="GAPprompt">gap&gt;</span> <span class="GAPinput">SetConjugate( ftl, 2, -1, [2,-1,3,-1] );</span>
213 <span class="GAPprompt">gap&gt;</span> <span class="GAPinput">SetConjugate( ftl, 3, -1, [2,1] );</span>
214 <span class="GAPprompt">gap&gt;</span> <span class="GAPinput">IsConfluent( ftl );</span>
215 Error, Collector is out of date called from
216 CollectWordOrFail( coll, ev1, [ j, 1, i, 1 ] ); called from
217 &lt;function&gt;( &lt;arguments&gt; ) called from read-eval-loop
218 Entering break read-eval-print loop ...
219 you can 'quit;' to quit to outer loop, or
220 you can 'return;' to continue
221 <span class="GAPbrkprompt">brk&gt;</span>
222 <span class="GAPprompt">gap&gt;</span> <span class="GAPinput">UpdatePolycyclicCollector( ftl );</span>
223 <span class="GAPprompt">gap&gt;</span> <span class="GAPinput">IsConfluent( ftl );</span>
224 true
225 </pre></div>
226
227 <p><a id="X818484817C3BAAE6" name="X818484817C3BAAE6"></a></p>
228
229 <h4>3.2 <span class="Heading">Accessing Parts of a Collector</span></h4>
230
231 <p><a id="X7DD0DF677AC1CF10" name="X7DD0DF677AC1CF10"></a></p>
232
233 <h5>3.2-1 RelativeOrders</h5>
234
235 <div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">&#8227; RelativeOrders</code>( <var class="Arg">coll</var> )</td><td class="tdright">(&nbsp;attribute&nbsp;)</td></tr></table></div>
236 <p>returns (a copy of) the list of relative order stored in the collector <var class="Arg">coll</var>.</p>
237
238 <p><a id="X844C0A478735EF4B" name="X844C0A478735EF4B"></a></p>
239
240 <h5>3.2-2 GetPower</h5>
241
242 <div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">&#8227; GetPower</code>( <var class="Arg">coll</var>, <var class="Arg">i</var> )</td><td class="tdright">(&nbsp;operation&nbsp;)</td></tr></table></div>
243 <div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">&#8227; GetPowerNC</code>( <var class="Arg">coll</var>, <var class="Arg">i</var> )</td><td class="tdright">(&nbsp;operation&nbsp;)</td></tr></table></div>
244 <p>returns a copy of the generator exponent list stored for the right hand side of the power relation of the generator <var class="Arg">i</var> in the collector <var class="Arg">coll</var>.</p>
245
246 <p>The no-check (NC) version of the function bypasses checks on the range of <var class="Arg">i</var> and does not create a copy before returning the right hand side of the power relation.</p>
247
248 <p><a id="X865160E07FA93E00" name="X865160E07FA93E00"></a></p>
249
250 <h5>3.2-3 GetConjugate</h5>
251
252 <div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">&#8227; GetConjugate</code>( <var class="Arg">coll</var>, <var class="Arg">j</var>, <var class="Arg">i</var> )</td><td class="tdright">(&nbsp;operation&nbsp;)</td></tr></table></div>
253 <div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">&#8227; GetConjugateNC</code>( <var class="Arg">coll</var>, <var class="Arg">j</var>, <var class="Arg">i</var> )</td><td class="tdright">(&nbsp;operation&nbsp;)</td></tr></table></div>
254 <p>returns a copy of the right hand side of the conjugate relation stored for the generators <var class="Arg">j</var> and <var class="Arg">i</var> in the collector <var class="Arg">coll</var> as generator exponent list. The generator <var class="Arg">j</var> must be larger than <var class="Arg">i</var>.</p>
255
256 <p>The no-check (NC) version of the function bypasses checks on the range of <var class="Arg">i</var> and <var class="Arg">j</var> and does not create a copy before returning the right hand side of the power relation.</p>
257
258 <p><a id="X7D6A26A4871FF51A" name="X7D6A26A4871FF51A"></a></p>
259
260 <h5>3.2-4 NumberOfGenerators</h5>
261
262 <div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">&#8227; NumberOfGenerators</code>( <var class="Arg">coll</var> )</td><td class="tdright">(&nbsp;operation&nbsp;)</td></tr></table></div>
263 <p>returns the number of generators of the collector <var class="Arg">coll</var>.</p>
264
265 <p><a id="X873ECF388503E5DE" name="X873ECF388503E5DE"></a></p>
266
267 <h5>3.2-5 ObjByExponents</h5>
268
269 <div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">&#8227; ObjByExponents</code>( <var class="Arg">coll</var>, <var class="Arg">expvec</var> )</td><td class="tdright">(&nbsp;operation&nbsp;)</td></tr></table></div>
270 <p>returns a generator exponent list for the exponent vector <var class="Arg">expvec</var>. This is the inverse operation to <code class="code">ExponentsByObj</code>. See <code class="func">ExponentsByObj</code> (<a href="chap3_mj.html#X85BCB97B8021EAD6"><span class="RefLink">3.2-6</span></a>) for an example.</p>
271
272 <p><a id="X85BCB97B8021EAD6" name="X85BCB97B8021EAD6"></a></p>
273
274 <h5>3.2-6 ExponentsByObj</h5>
275
276 <div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">&#8227; ExponentsByObj</code>( <var class="Arg">coll</var>, <var class="Arg">genexp</var> )</td><td class="tdright">(&nbsp;operation&nbsp;)</td></tr></table></div>
277 <p>returns an exponent vector for the generator exponent list <var class="Arg">genexp</var>. This is the inverse operation to <code class="code">ObjByExponents</code>. The function assumes that the generators in <var class="Arg">genexp</var> are given in the right order and that the exponents are in the right range.</p>
278
279
280 <div class="example"><pre>
281 <span class="GAPprompt">gap&gt;</span> <span class="GAPinput">G := UnitriangularPcpGroup( 4, 0 );</span>
282 Pcp-group with orders [ 0, 0, 0, 0, 0, 0 ]
283 <span class="GAPprompt">gap&gt;</span> <span class="GAPinput">coll := Collector ( G );</span>
284 &lt;&lt;from the left collector with 6 generators&gt;&gt;
285 <span class="GAPprompt">gap&gt;</span> <span class="GAPinput">ObjByExponents( coll, [6,-5,4,3,-2,1] );</span>
286 [ 1, 6, 2, -5, 3, 4, 4, 3, 5, -2, 6, 1 ]
287 <span class="GAPprompt">gap&gt;</span> <span class="GAPinput">ExponentsByObj( coll, last );</span>
288 [ 6, -5, 4, 3, -2, 1 ]
289 </pre></div>
290
291 <p><a id="X79AEB3477800DC16" name="X79AEB3477800DC16"></a></p>
292
293 <h4>3.3 <span class="Heading">Special Features</span></h4>
294
295 <p>In this section we descibe collectors for nilpotent groups which make use of the special structure of the given pc-presentation.</p>
296
297 <p><a id="X82EE2ACD7B8C178B" name="X82EE2ACD7B8C178B"></a></p>
298
299 <h5>3.3-1 IsWeightedCollector</h5>
300
301 <div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">&#8227; IsWeightedCollector</code>( <var class="Arg">coll</var> )</td><td class="tdright">(&nbsp;property&nbsp;)</td></tr></table></div>
302 <p>checks if there is a function <span class="SimpleMath">\(w\)</span> from the generators of the collector <var class="Arg">coll</var> into the positive integers such that <span class="SimpleMath">\(w(g) \geq w(x)+w(y)\)</span> for all generators <span class="SimpleMath">\(x\)</span>, <span class="SimpleMath">\(y\)</span> and all generators <span class="SimpleMath">\(g\)</span> in (the normal of) <span class="SimpleMath">\([x,y]\)</span>. If such a function does not exist, false is returned. If such a function exists, it is computed and stored in the collector. In addition, the default collection strategy for this collector is set to combinatorial collection.</p>
303
304 <p><a id="X7A1D7ED68334282C" name="X7A1D7ED68334282C"></a></p>
305
306 <h5>3.3-2 AddHallPolynomials</h5>
307
308 <div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">&#8227; AddHallPolynomials</code>( <var class="Arg">coll</var> )</td><td class="tdright">(&nbsp;function&nbsp;)</td></tr></table></div>
309 <p>is applicable to a collector which passes <code class="code">IsWeightedCollector</code> and computes the Hall multiplication polynomials for the presentation stored in <var class="Arg">coll</var>. The default strategy for this collector is set to evaluating those polynomial when multiplying two elements.</p>
310
311 <p><a id="X81FB5BE27903EC32" name="X81FB5BE27903EC32"></a></p>
312
313 <h5>3.3-3 String</h5>
314
315 <div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">&#8227; String</code>( <var class="Arg">coll</var> )</td><td class="tdright">(&nbsp;attribute&nbsp;)</td></tr></table></div>
316 <p>converts a collector <var class="Arg">coll</var> into a string.</p>
317
318 <p><a id="X7ED466B6807D16FE" name="X7ED466B6807D16FE"></a></p>
319
320 <h5>3.3-4 FTLCollectorPrintTo</h5>
321
322 <div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">&#8227; FTLCollectorPrintTo</code>( <var class="Arg">file</var>, <var class="Arg">name</var>, <var class="Arg">coll</var> )</td><td class="tdright">(&nbsp;function&nbsp;)</td></tr></table></div>
323 <p>stores a collector <var class="Arg">coll</var> in the file <var class="Arg">file</var> such that the file can be read back using the function 'Read' into <strong class="pkg">GAP</strong> and would then be stored in the variable <var class="Arg">name</var>.</p>
324
325 <p><a id="X789D9EB37ECFA9D7" name="X789D9EB37ECFA9D7"></a></p>
326
327 <h5>3.3-5 FTLCollectorAppendTo</h5>
328
329 <div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">&#8227; FTLCollectorAppendTo</code>( <var class="Arg">file</var>, <var class="Arg">name</var>, <var class="Arg">coll</var> )</td><td class="tdright">(&nbsp;function&nbsp;)</td></tr></table></div>
330 <p>appends a collector <var class="Arg">coll</var> in the file <var class="Arg">file</var> such that the file can be read back into <strong class="pkg">GAP</strong> and would then be stored in the variable <var class="Arg">name</var>.</p>
331
332 <p><a id="X808A26FB873A354F" name="X808A26FB873A354F"></a></p>
333
334 <h5>3.3-6 UseLibraryCollector</h5>
335
336 <div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">&#8227; UseLibraryCollector</code></td><td class="tdright">(&nbsp;global variable&nbsp;)</td></tr></table></div>
337 <p>this property can be set to <code class="keyw">true</code> for a collector to force a simple from-the-left collection strategy implemented in the <strong class="pkg">GAP</strong> language to be used. Its main purpose is to help debug the collection routines.</p>
338
339 <p><a id="X844E195C7D55F8BD" name="X844E195C7D55F8BD"></a></p>
340
341 <h5>3.3-7 USE_LIBRARY_COLLECTOR</h5>
342
343 <div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">&#8227; USE_LIBRARY_COLLECTOR</code></td><td class="tdright">(&nbsp;global variable&nbsp;)</td></tr></table></div>
344 <p>this global variable can be set to <code class="keyw">true</code> to force all collectors to use a simple from-the-left collection strategy implemented in the <strong class="pkg">GAP</strong> language to be used. Its main purpose is to help debug the collection routines.</p>
345
346 <p><a id="X7945C6B97BECCDA8" name="X7945C6B97BECCDA8"></a></p>
347
348 <h5>3.3-8 DEBUG_COMBINATORIAL_COLLECTOR</h5>
349
350 <div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">&#8227; DEBUG_COMBINATORIAL_COLLECTOR</code></td><td class="tdright">(&nbsp;global variable&nbsp;)</td></tr></table></div>
351 <p>this global variable can be set to <code class="keyw">true</code> to force the comparison of results from the combinatorial collector with the result of an identical collection performed by a simple from-the-left collector. Its main purpose is to help debug the collection routines.</p>
352
353 <p><a id="X7BDFB55D7CB33543" name="X7BDFB55D7CB33543"></a></p>
354
355 <h5>3.3-9 USE_COMBINATORIAL_COLLECTOR</h5>
356
357 <div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">&#8227; USE_COMBINATORIAL_COLLECTOR</code></td><td class="tdright">(&nbsp;global variable&nbsp;)</td></tr></table></div>
358 <p>this global variable can be set to <code class="keyw">false</code> in order to prevent the combinatorial collector to be used.</p>
359
360
361 <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="chap2_mj.html">[Previous Chapter]</a>&nbsp; &nbsp;<a href="chap4_mj.html">[Next Chapter]</a>&nbsp; </div>
362
363
364 <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>
365
366 <hr />
367 <p class="foot">generated by <a href="https://www.math.rwth-aachen.de/~Frank.Luebeck/GAPDoc">GAPDoc2HTML</a></p>
368 </body>
369 </html>