Debian Codegraph @

doc/chap3.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 3: Collectors</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="chap3" 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="chap2.html">[Previous Chapter]</a>&nbsp; &nbsp;<a href="chap4.html">[Next Chapter]</a>&nbsp; </div>
21
22 <p id="mathjaxlink" class="pcenter"><a href="chap3_mj.html">[MathJax on]</a></p>
23 <p><a id="X792305CC81E8606A" name="X792305CC81E8606A"></a></p>
24 <div class="ChapSects"><a href="chap3.html#X792305CC81E8606A">3 <span class="Heading">Collectors</span></a>
25 <div class="ContSect"><span class="tocline"><span class="nocss">&nbsp;</span><a href="chap3.html#X800FD91386C08CD8">3.1 <span class="Heading">Constructing a Collector</span></a>
26 </span>
27 <div class="ContSSBlock">
28 <span class="ContSS"><br /><span class="nocss">&nbsp;&nbsp;</span><a href="chap3.html#X8382A4E78706DE65">3.1-1 FromTheLeftCollector</a></span>
29 <span class="ContSS"><br /><span class="nocss">&nbsp;&nbsp;</span><a href="chap3.html#X79A308B28183493B">3.1-2 SetRelativeOrder</a></span>
30 <span class="ContSS"><br /><span class="nocss">&nbsp;&nbsp;</span><a href="chap3.html#X7BC319BA8698420C">3.1-3 SetPower</a></span>
31 <span class="ContSS"><br /><span class="nocss">&nbsp;&nbsp;</span><a href="chap3.html#X86A08D887E049347">3.1-4 SetConjugate</a></span>
32 <span class="ContSS"><br /><span class="nocss">&nbsp;&nbsp;</span><a href="chap3.html#X7B25997C7DF92B6D">3.1-5 SetCommutator</a></span>
33 <span class="ContSS"><br /><span class="nocss">&nbsp;&nbsp;</span><a href="chap3.html#X7E9903F57BC5CC24">3.1-6 UpdatePolycyclicCollector</a></span>
34 <span class="ContSS"><br /><span class="nocss">&nbsp;&nbsp;</span><a href="chap3.html#X8006790B86328CE8">3.1-7 IsConfluent</a></span>
35 </div></div>
36 <div class="ContSect"><span class="tocline"><span class="nocss">&nbsp;</span><a href="chap3.html#X818484817C3BAAE6">3.2 <span class="Heading">Accessing Parts of a Collector</span></a>
37 </span>
38 <div class="ContSSBlock">
39 <span class="ContSS"><br /><span class="nocss">&nbsp;&nbsp;</span><a href="chap3.html#X7DD0DF677AC1CF10">3.2-1 RelativeOrders</a></span>
40 <span class="ContSS"><br /><span class="nocss">&nbsp;&nbsp;</span><a href="chap3.html#X844C0A478735EF4B">3.2-2 GetPower</a></span>
41 <span class="ContSS"><br /><span class="nocss">&nbsp;&nbsp;</span><a href="chap3.html#X865160E07FA93E00">3.2-3 GetConjugate</a></span>
42 <span class="ContSS"><br /><span class="nocss">&nbsp;&nbsp;</span><a href="chap3.html#X7D6A26A4871FF51A">3.2-4 NumberOfGenerators</a></span>
43 <span class="ContSS"><br /><span class="nocss">&nbsp;&nbsp;</span><a href="chap3.html#X873ECF388503E5DE">3.2-5 ObjByExponents</a></span>
44 <span class="ContSS"><br /><span class="nocss">&nbsp;&nbsp;</span><a href="chap3.html#X85BCB97B8021EAD6">3.2-6 ExponentsByObj</a></span>
45 </div></div>
46 <div class="ContSect"><span class="tocline"><span class="nocss">&nbsp;</span><a href="chap3.html#X79AEB3477800DC16">3.3 <span class="Heading">Special Features</span></a>
47 </span>
48 <div class="ContSSBlock">
49 <span class="ContSS"><br /><span class="nocss">&nbsp;&nbsp;</span><a href="chap3.html#X82EE2ACD7B8C178B">3.3-1 IsWeightedCollector</a></span>
50 <span class="ContSS"><br /><span class="nocss">&nbsp;&nbsp;</span><a href="chap3.html#X7A1D7ED68334282C">3.3-2 AddHallPolynomials</a></span>
51 <span class="ContSS"><br /><span class="nocss">&nbsp;&nbsp;</span><a href="chap3.html#X81FB5BE27903EC32">3.3-3 String</a></span>
52 <span class="ContSS"><br /><span class="nocss">&nbsp;&nbsp;</span><a href="chap3.html#X7ED466B6807D16FE">3.3-4 FTLCollectorPrintTo</a></span>
53 <span class="ContSS"><br /><span class="nocss">&nbsp;&nbsp;</span><a href="chap3.html#X789D9EB37ECFA9D7">3.3-5 FTLCollectorAppendTo</a></span>
54 <span class="ContSS"><br /><span class="nocss">&nbsp;&nbsp;</span><a href="chap3.html#X808A26FB873A354F">3.3-6 UseLibraryCollector</a></span>
55 <span class="ContSS"><br /><span class="nocss">&nbsp;&nbsp;</span><a href="chap3.html#X844E195C7D55F8BD">3.3-7 USE_LIBRARY_COLLECTOR</a></span>
56 <span class="ContSS"><br /><span class="nocss">&nbsp;&nbsp;</span><a href="chap3.html#X7945C6B97BECCDA8">3.3-8 DEBUG_COMBINATORIAL_COLLECTOR</a></span>
57 <span class="ContSS"><br /><span class="nocss">&nbsp;&nbsp;</span><a href="chap3.html#X7BDFB55D7CB33543">3.3-9 USE_COMBINATORIAL_COLLECTOR</a></span>
58 </div></div>
59 </div>
60
61 <h3>3 <span class="Heading">Collectors</span></h3>
62
63 <p>Let <span class="SimpleMath">G</span> be a group defined by a pc-presentation as described in the Chapter <a href="chap2.html#X792561B378D95B23"><span class="RefLink"><span class="Heading">Introduction to polycyclic presentations</span></span></a>.</p>
64
65 <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∈ I</span> and <span class="SimpleMath">e_i</span> not in the range <span class="SimpleMath">0... 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>
66
67 <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.html#biBLGS90">[LS90]</a> and <a href="chapBib.html#biBSims94">[Sim94]</a> and <em>combinatorial collection from the left</em> by <a href="chapBib.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.html#biBWWM97">[Mer97]</a> and <a href="chapBib.html#biBLGS98">[LS98]</a>.</p>
68
69 <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>
70
71 <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_1g_i_2^e_2... g_i_k^e_k</span> is represented by the generator exponent list <span class="SimpleMath">[i_1,e_1,i_2,e_2,...,i_k,e_k]</span>.</p>
72
73 <p><a id="X800FD91386C08CD8" name="X800FD91386C08CD8"></a></p>
74
75 <h4>3.1 <span class="Heading">Constructing a Collector</span></h4>
76
77 <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>
78
79 <p><a id="X8382A4E78706DE65" name="X8382A4E78706DE65"></a></p>
80
81 <h5>3.1-1 FromTheLeftCollector</h5>
82
83 <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>
84 <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>
85
86
87 <div class="example"><pre>
88 <span class="GAPprompt">gap&gt;</span> <span class="GAPinput">ftl := FromTheLeftCollector( 4 );</span>
89 &lt;&lt;from the left collector with 4 generators&gt;&gt;
90 <span class="GAPprompt">gap&gt;</span> <span class="GAPinput">PcpGroupByCollector( ftl );</span>
91 Pcp-group with orders [ 0, 0, 0, 0 ]
92 <span class="GAPprompt">gap&gt;</span> <span class="GAPinput">IsAbelian(last);</span>
93 true
94 </pre></div>
95
96 <p>If the relative order of a generators has been defined (see <code class="func">SetRelativeOrder</code> (<a href="chap3.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>
97
98 <p><a id="X79A308B28183493B" name="X79A308B28183493B"></a></p>
99
100 <h5>3.1-2 SetRelativeOrder</h5>
101
102 <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>
103 <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>
104 <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.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,...,n</span> where <span class="SimpleMath">n</span> is the number of generators of the collector.</p>
105
106 <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>
107
108 <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>
109
110 <p>The NC version of the function bypasses checks on the range of <var class="Arg">i</var>.</p>
111
112
113 <div class="example"><pre>
114 <span class="GAPprompt">gap&gt;</span> <span class="GAPinput">ftl := FromTheLeftCollector( 4 );</span>
115 &lt;&lt;from the left collector with 4 generators&gt;&gt;
116 <span class="GAPprompt">gap&gt;</span> <span class="GAPinput">for i in [1..4] do SetRelativeOrder( ftl, i, 3 ); od;</span>
117 <span class="GAPprompt">gap&gt;</span> <span class="GAPinput">G := PcpGroupByCollector( ftl );</span>
118 Pcp-group with orders [ 3, 3, 3, 3 ]
119 <span class="GAPprompt">gap&gt;</span> <span class="GAPinput">IsElementaryAbelian( G );</span>
120 true
121 </pre></div>
122
123 <p><a id="X7BC319BA8698420C" name="X7BC319BA8698420C"></a></p>
124
125 <h5>3.1-3 SetPower</h5>
126
127 <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>
128 <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>
129 <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>
130
131 <p>Right hand sides are by default assumed to be trivial.</p>
132
133 <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>
134
135 <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>
136
137 <p><a id="X86A08D887E049347" name="X86A08D887E049347"></a></p>
138
139 <h5>3.1-4 SetConjugate</h5>
140
141 <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>
142 <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>
143 <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>
144
145 <p>The generator number <var class="Arg">i</var> can be negative in order to define conjugation by the inverse of a generator.</p>
146
147 <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>
148
149 <p><a id="X7B25997C7DF92B6D" name="X7B25997C7DF92B6D"></a></p>
150
151 <h5>3.1-5 SetCommutator</h5>
152
153 <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>
154 <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>
155
156 <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>
157
158 <p><a id="X7E9903F57BC5CC24" name="X7E9903F57BC5CC24"></a></p>
159
160 <h5>3.1-6 UpdatePolycyclicCollector</h5>
161
162 <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>
163 <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>
164
165 <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.html#X7C8FBCAB7F63FACB"><span class="RefLink">4.3-1</span></a>)).</p>
166
167 <p><a id="X8006790B86328CE8" name="X8006790B86328CE8"></a></p>
168
169 <h5>3.1-7 IsConfluent</h5>
170
171 <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>
172 <p>tests if the collector <var class="Arg">coll</var> is confluent. The function returns true or false accordingly.</p>
173
174 <p>Compare Chapter <a href="chap2.html#X792561B378D95B23"><span class="RefLink">2</span></a> for a definition of confluence.</p>
175
176 <p>Note that confluence is automatically checked by the function <code class="code">PcpGroupByCollector</code> (see <code class="func">PcpGroupByCollector</code> (<a href="chap4.html#X7C8FBCAB7F63FACB"><span class="RefLink">4.3-1</span></a>)).</p>
177
178 <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>
179
180 <p class="pcenter">\pmatrix{ 0 &amp; 1 \cr -1 &amp; -1}.</p>
181
182 <p>This leads to the following polycyclic presentation:</p>
183
184 <p class="pcenter">\langle g_1,g_2,g_3 | g_1^3,
185 g_2^{g_1}=g_3,
186 g_3^{g_1}=g_2^{-1}g_3^{-1},
187 g_3^{g_2}=g_3\rangle.</p>
188
189
190 <div class="example"><pre>
191 <span class="GAPprompt">gap&gt;</span> <span class="GAPinput">ftl := FromTheLeftCollector( 3 );</span>
192 &lt;&lt;from the left collector with 3 generators&gt;&gt;
193 <span class="GAPprompt">gap&gt;</span> <span class="GAPinput">SetRelativeOrder( ftl, 1, 3 );</span>
194 <span class="GAPprompt">gap&gt;</span> <span class="GAPinput">SetConjugate( ftl, 2, 1, [3,1] );</span>
195 <span class="GAPprompt">gap&gt;</span> <span class="GAPinput">SetConjugate( ftl, 3, 1, [2,-1,3,-1] );</span>
196 <span class="GAPprompt">gap&gt;</span> <span class="GAPinput">UpdatePolycyclicCollector( ftl );</span>
197 <span class="GAPprompt">gap&gt;</span> <span class="GAPinput">IsConfluent( ftl );</span>
198 true
199 </pre></div>
200
201 <p>The action of the inverse of <span class="SimpleMath">g_1</span> on <span class="SimpleMath">⟨ g_2,g_2⟩</span> is given by the matrix</p>
202
203 <p class="pcenter">\pmatrix{ -1 &amp; -1 \cr 1 &amp; 0}.</p>
204
205 <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>
206
207
208 <div class="example"><pre>
209 <span class="GAPprompt">gap&gt;</span> <span class="GAPinput">SetConjugate( ftl, 2, -1, [2,-1,3,-1] );</span>
210 <span class="GAPprompt">gap&gt;</span> <span class="GAPinput">SetConjugate( ftl, 3, -1, [2,1] );</span>
211 <span class="GAPprompt">gap&gt;</span> <span class="GAPinput">IsConfluent( ftl );</span>
212 Error, Collector is out of date called from
213 CollectWordOrFail( coll, ev1, [ j, 1, i, 1 ] ); called from
214 &lt;function&gt;( &lt;arguments&gt; ) called from read-eval-loop
215 Entering break read-eval-print loop ...
216 you can 'quit;' to quit to outer loop, or
217 you can 'return;' to continue
218 <span class="GAPbrkprompt">brk&gt;</span>
219 <span class="GAPprompt">gap&gt;</span> <span class="GAPinput">UpdatePolycyclicCollector( ftl );</span>
220 <span class="GAPprompt">gap&gt;</span> <span class="GAPinput">IsConfluent( ftl );</span>
221 true
222 </pre></div>
223
224 <p><a id="X818484817C3BAAE6" name="X818484817C3BAAE6"></a></p>
225
226 <h4>3.2 <span class="Heading">Accessing Parts of a Collector</span></h4>
227
228 <p><a id="X7DD0DF677AC1CF10" name="X7DD0DF677AC1CF10"></a></p>
229
230 <h5>3.2-1 RelativeOrders</h5>
231
232 <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>
233 <p>returns (a copy of) the list of relative order stored in the collector <var class="Arg">coll</var>.</p>
234
235 <p><a id="X844C0A478735EF4B" name="X844C0A478735EF4B"></a></p>
236
237 <h5>3.2-2 GetPower</h5>
238
239 <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>
240 <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>
241 <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>
242
243 <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>
244
245 <p><a id="X865160E07FA93E00" name="X865160E07FA93E00"></a></p>
246
247 <h5>3.2-3 GetConjugate</h5>
248
249 <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>
250 <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>
251 <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>
252
253 <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>
254
255 <p><a id="X7D6A26A4871FF51A" name="X7D6A26A4871FF51A"></a></p>
256
257 <h5>3.2-4 NumberOfGenerators</h5>
258
259 <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>
260 <p>returns the number of generators of the collector <var class="Arg">coll</var>.</p>
261
262 <p><a id="X873ECF388503E5DE" name="X873ECF388503E5DE"></a></p>
263
264 <h5>3.2-5 ObjByExponents</h5>
265
266 <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>
267 <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.html#X85BCB97B8021EAD6"><span class="RefLink">3.2-6</span></a>) for an example.</p>
268
269 <p><a id="X85BCB97B8021EAD6" name="X85BCB97B8021EAD6"></a></p>
270
271 <h5>3.2-6 ExponentsByObj</h5>
272
273 <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>
274 <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>
275
276
277 <div class="example"><pre>
278 <span class="GAPprompt">gap&gt;</span> <span class="GAPinput">G := UnitriangularPcpGroup( 4, 0 );</span>
279 Pcp-group with orders [ 0, 0, 0, 0, 0, 0 ]
280 <span class="GAPprompt">gap&gt;</span> <span class="GAPinput">coll := Collector ( G );</span>
281 &lt;&lt;from the left collector with 6 generators&gt;&gt;
282 <span class="GAPprompt">gap&gt;</span> <span class="GAPinput">ObjByExponents( coll, [6,-5,4,3,-2,1] );</span>
283 [ 1, 6, 2, -5, 3, 4, 4, 3, 5, -2, 6, 1 ]
284 <span class="GAPprompt">gap&gt;</span> <span class="GAPinput">ExponentsByObj( coll, last );</span>
285 [ 6, -5, 4, 3, -2, 1 ]
286 </pre></div>
287
288 <p><a id="X79AEB3477800DC16" name="X79AEB3477800DC16"></a></p>
289
290 <h4>3.3 <span class="Heading">Special Features</span></h4>
291
292 <p>In this section we descibe collectors for nilpotent groups which make use of the special structure of the given pc-presentation.</p>
293
294 <p><a id="X82EE2ACD7B8C178B" name="X82EE2ACD7B8C178B"></a></p>
295
296 <h5>3.3-1 IsWeightedCollector</h5>
297
298 <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>
299 <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) ≥ 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>
300
301 <p><a id="X7A1D7ED68334282C" name="X7A1D7ED68334282C"></a></p>
302
303 <h5>3.3-2 AddHallPolynomials</h5>
304
305 <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>
306 <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>
307
308 <p><a id="X81FB5BE27903EC32" name="X81FB5BE27903EC32"></a></p>
309
310 <h5>3.3-3 String</h5>
311
312 <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>
313 <p>converts a collector <var class="Arg">coll</var> into a string.</p>
314
315 <p><a id="X7ED466B6807D16FE" name="X7ED466B6807D16FE"></a></p>
316
317 <h5>3.3-4 FTLCollectorPrintTo</h5>
318
319 <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>
320 <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>
321
322 <p><a id="X789D9EB37ECFA9D7" name="X789D9EB37ECFA9D7"></a></p>
323
324 <h5>3.3-5 FTLCollectorAppendTo</h5>
325
326 <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>
327 <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>
328
329 <p><a id="X808A26FB873A354F" name="X808A26FB873A354F"></a></p>
330
331 <h5>3.3-6 UseLibraryCollector</h5>
332
333 <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>
334 <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>
335
336 <p><a id="X844E195C7D55F8BD" name="X844E195C7D55F8BD"></a></p>
337
338 <h5>3.3-7 USE_LIBRARY_COLLECTOR</h5>
339
340 <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>
341 <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>
342
343 <p><a id="X7945C6B97BECCDA8" name="X7945C6B97BECCDA8"></a></p>
344
345 <h5>3.3-8 DEBUG_COMBINATORIAL_COLLECTOR</h5>
346
347 <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>
348 <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>
349
350 <p><a id="X7BDFB55D7CB33543" name="X7BDFB55D7CB33543"></a></p>
351
352 <h5>3.3-9 USE_COMBINATORIAL_COLLECTOR</h5>
353
354 <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>
355 <p>this global variable can be set to <code class="keyw">false</code> in order to prevent the combinatorial collector to be used.</p>
356
357
358 <div class="chlinkprevnextbot">&nbsp;<a href="chap0.html">[Top of Book]</a>&nbsp; <a href="chap0.html#contents">[Contents]</a>&nbsp; &nbsp;<a href="chap2.html">[Previous Chapter]</a>&nbsp; &nbsp;<a href="chap4.html">[Next Chapter]</a>&nbsp; </div>
359
360
361 <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>
362
363 <hr />
364 <p class="foot">generated by <a href="https://www.math.rwth-aachen.de/~Frank.Luebeck/GAPDoc">GAPDoc2HTML</a></p>
365 </body>
366 </html>