<html><head><title>[Polenta] 5 Information Messages</title></head>
<body text="#000000" bgcolor="#ffffff">
[<a href = "chapters.htm">Up</a>] [<a href ="CHAP004.htm">Previous</a>] [<a href = "theindex.htm">Index</a>]
<h1>5 Information Messages</h1><p>
<P>
<H3>Sections</H3>
<oL>
<li> <A HREF="CHAP005.htm#SECT001">Info Class</a>
<li> <A HREF="CHAP005.htm#SECT002">Example</a>
</ol><p>
<p>
It is possible to get informations about the status of the computation of the
functions of Chapter 2 of this manual.
<p>
<p>
<h2><a name="SECT001">5.1 Info Class</a></h2>
<p><p>
<a name = "SSEC001.1"></a>
<li><code>InfoPolenta</code>
<p>
is the Info class of the <font face="Gill Sans,Helvetica,Arial">Polenta</font> package (for more details on the Info mechanism see Section <a href="../../../doc/htm/ref/CHAP007.htm#SECT004">Info Functions</a> of the
<font face="Gill Sans,Helvetica,Arial">GAP</font> Reference Manual).
With the help of the function
<code>SetInfoLevel(InfoPolenta,</code><var>level</var><code>)</code> you can change
the info level of <code>InfoPolenta</code>.
<dl compact>
<dt>--<dd>
If <code>InfoLevel( InfoPolenta )</code> is equal to 0
then no information
messages are displayed.
<dt>--<dd>
If <code>InfoLevel( InfoPolenta )</code> is equal to 1 then basic informations
about the process are provided. For further background on the displayed
informations we refer to <a href="biblio.htm#Assmann"><cite>Assmann</cite></a> (publicly available via the
Internet address <code>http://cayley.math.nat.tu-bs.de/software/assmann/</code>).
<dt>--<dd>
If <code>InfoLevel( InfoPolenta )</code> is equal to 2 then, in addition to the
basic information, the generators of computed subgroups and module series
are displayed.
</dl>
<p>
<p>
<h2><a name="SECT002">5.2 Example</a></h2>
<p><p>
<pre>
gap> SetInfoLevel( InfoPolenta, 1 );
gap> PcpGroupByMatGroup( PolExamples(11) );
#I Determine a constructive polycyclic sequence
for the input group ...
#I
#I Chosen admissible prime: 3
#I
#I Determine a constructive polycyclic sequence
for the image under the p-congruence homomorphism ...
#I finished.
#I Finite image has relative orders [ 3, 2, 3, 3, 3 ].
#I
#I Compute normal subgroup generators for the kernel
of the p-congruence homomorphism ...
#I finished.
#I
#I Compute the radical series ...
#I finished.
#I The radical series has length 4.
#I
#I Compute the composition series ...
#I finished.
#I The composition series has length 5.
#I
#I Compute a constructive polycyclic sequence
for the induced action of the kernel to the composition series ...
#I finished.
#I This polycyclic sequence has relative orders [ ].
#I
#I Calculate normal subgroup generators for the
unipotent part ...
#I finished.
#I
#I Determine a constructive polycyclic sequence
for the unipotent part ...
#I finished.
#I The unipotent part has relative orders
#I [ 0, 0, 0 ].
#I
#I ... computation of a constructive
polycyclic sequence for the whole group finished.
#I
#I Compute the relations of the polycyclic
presentation of the group ...
#I Compute power relations ...
#I ... finished.
#I Compute conjugation relations ...
#I ... finished.
#I Update polycyclic collector ...
#I ... finished.
#I finished.
#I
#I Construct the polycyclic presented group ...
#I finished.
#I
Pcp-group with orders [ 3, 2, 3, 3, 3, 0, 0, 0 ]
gap> SetInfoLevel( InfoPolenta, 2 );
gap> PcpGroupByMatGroup( PolExamples(11) );
#I Determine a constructive polycyclic sequence
for the input group ...
#I
#I Chosen admissible prime: 3
#I
#I Determine a constructive polycyclic sequence
for the image under the p-congruence homomorphism ...
#I finished.
#I Finite image has relative orders [ 3, 2, 3, 3, 3 ].
#I
#I Compute normal subgroup generators for the kernel
of the p-congruence homomorphism ...
#I finished.
#I The normal subgroup generators are
#I [ [ [ 1, -3/2, 0, 0 ], [ 0, 1, 0, 0 ], [ 0, 0, 1, 3 ], [ 0, 0, 0, 1 ] ],
[ [ 1, 0, 0, 24 ], [ 0, 1, 0, 0 ], [ 0, 0, 1, 0 ], [ 0, 0, 0, 1 ] ],
[ [ 1, 3, 3, 15 ], [ 0, 1, 0, 6 ], [ 0, 0, 1, -6 ], [ 0, 0, 0, 1 ] ],
[ [ 1, 3, 3, 9 ], [ 0, 1, 0, 6 ], [ 0, 0, 1, -6 ], [ 0, 0, 0, 1 ] ],
[ [ 1, 3/2, 3/2, 3/2 ], [ 0, 1, 0, 3 ], [ 0, 0, 1, -3 ], [ 0, 0, 0, 1 ] ],
[ [ 1, -3/2, 9/2, -69/2 ], [ 0, 1, 0, 9 ], [ 0, 0, 1, 3 ], [ 0, 0, 0, 1 ] ]
, [ [ 1, 0, 0, -24 ], [ 0, 1, 0, 0 ], [ 0, 0, 1, 0 ], [ 0, 0, 0, 1 ] ],
[ [ 1, -3, -3, -9 ], [ 0, 1, 0, -6 ], [ 0, 0, 1, 6 ], [ 0, 0, 0, 1 ] ],
[ [ 1, -3, -3, -15 ], [ 0, 1, 0, -6 ], [ 0, 0, 1, 6 ], [ 0, 0, 0, 1 ] ],
[ [ 1, -3, 0, 9 ], [ 0, 1, 0, 0 ], [ 0, 0, 1, 6 ], [ 0, 0, 0, 1 ] ],
[ [ 1, -3, -3, -9 ], [ 0, 1, 0, -6 ], [ 0, 0, 1, 6 ], [ 0, 0, 0, 1 ] ],
[ [ 1, -3, 0, 9 ], [ 0, 1, 0, 0 ], [ 0, 0, 1, 6 ], [ 0, 0, 0, 1 ] ],
[ [ 1, -3/2, -3/2, -9/2 ], [ 0, 1, 0, -3 ], [ 0, 0, 1, 3 ], [ 0, 0, 0, 1 ]
],
[ [ 1, -3, -3, -12 ], [ 0, 1, 0, -6 ], [ 0, 0, 1, 6 ], [ 0, 0, 0, 1 ] ],
[ [ 1, 3, -3/2, -21 ], [ 0, 1, 0, -3 ], [ 0, 0, 1, -6 ], [ 0, 0, 0, 1 ] ],
[ [ 1, 3/2, 3/2, 9/2 ], [ 0, 1, 0, 3 ], [ 0, 0, 1, -3 ], [ 0, 0, 0, 1 ] ] ]
#I
#I Compute the radical series ...
#I finished.
#I The radical series has length 4.
#I The radical series is
#I [ [ [ 1, 0, 0, 0 ], [ 0, 1, 0, 0 ], [ 0, 0, 1, 0 ], [ 0, 0, 0, 1 ] ],
[ [ 0, 1, 0, 0 ], [ 0, 0, 1, 0 ], [ 0, 0, 0, 1 ] ], [ [ 0, 0, 0, 1 ] ],
[ ] ]
#I
#I Compute the composition series ...
#I finished.
#I The composition series has length 5.
#I The composition series is
#I [ [ [ 1, 0, 0, 0 ], [ 0, 1, 0, 0 ], [ 0, 0, 1, 0 ], [ 0, 0, 0, 1 ] ],
[ [ 0, 1, 0, 0 ], [ 0, 0, 1, 0 ], [ 0, 0, 0, 1 ] ],
[ [ 0, 0, 1, 0 ], [ 0, 0, 0, 1 ] ], [ [ 0, 0, 0, 1 ] ], [ ] ]
#I
#I Compute a constructive polycyclic sequence
for the induced action of the kernel to the composition series ...
#I finished.
#I This polycyclic sequence has relative orders [ ].
#I
#I Calculate normal subgroup generators for the
unipotent part ...
#I finished.
#I The normal subgroup generators for the unipotent part are
#I [ [ [ 1, -3/2, 0, 0 ], [ 0, 1, 0, 0 ], [ 0, 0, 1, 3 ], [ 0, 0, 0, 1 ] ],
[ [ 1, 0, 0, 24 ], [ 0, 1, 0, 0 ], [ 0, 0, 1, 0 ], [ 0, 0, 0, 1 ] ],
[ [ 1, 3, 3, 15 ], [ 0, 1, 0, 6 ], [ 0, 0, 1, -6 ], [ 0, 0, 0, 1 ] ],
[ [ 1, 3, 3, 9 ], [ 0, 1, 0, 6 ], [ 0, 0, 1, -6 ], [ 0, 0, 0, 1 ] ],
[ [ 1, 3/2, 3/2, 3/2 ], [ 0, 1, 0, 3 ], [ 0, 0, 1, -3 ], [ 0, 0, 0, 1 ] ],
[ [ 1, -3/2, 9/2, -69/2 ], [ 0, 1, 0, 9 ], [ 0, 0, 1, 3 ], [ 0, 0, 0, 1 ] ]
, [ [ 1, 0, 0, -24 ], [ 0, 1, 0, 0 ], [ 0, 0, 1, 0 ], [ 0, 0, 0, 1 ] ],
[ [ 1, -3, -3, -9 ], [ 0, 1, 0, -6 ], [ 0, 0, 1, 6 ], [ 0, 0, 0, 1 ] ],
[ [ 1, -3, -3, -15 ], [ 0, 1, 0, -6 ], [ 0, 0, 1, 6 ], [ 0, 0, 0, 1 ] ],
[ [ 1, -3, 0, 9 ], [ 0, 1, 0, 0 ], [ 0, 0, 1, 6 ], [ 0, 0, 0, 1 ] ],
[ [ 1, -3, -3, -9 ], [ 0, 1, 0, -6 ], [ 0, 0, 1, 6 ], [ 0, 0, 0, 1 ] ],
[ [ 1, -3, 0, 9 ], [ 0, 1, 0, 0 ], [ 0, 0, 1, 6 ], [ 0, 0, 0, 1 ] ],
[ [ 1, -3/2, -3/2, -9/2 ], [ 0, 1, 0, -3 ], [ 0, 0, 1, 3 ], [ 0, 0, 0, 1 ]
],
[ [ 1, -3, -3, -12 ], [ 0, 1, 0, -6 ], [ 0, 0, 1, 6 ], [ 0, 0, 0, 1 ] ],
[ [ 1, 3, -3/2, -21 ], [ 0, 1, 0, -3 ], [ 0, 0, 1, -6 ], [ 0, 0, 0, 1 ] ],
[ [ 1, 3/2, 3/2, 9/2 ], [ 0, 1, 0, 3 ], [ 0, 0, 1, -3 ], [ 0, 0, 0, 1 ] ] ]
#I
#I Determine a constructive polycyclic sequence
for the unipotent part ...
#I finished.
#I The unipotent part has relative orders
#I [ 0, 0, 0 ].
#I
#I ... computation of a constructive
polycyclic sequence for the whole group finished.
#I
#I Compute the relations of the polycyclic
presentation of the group ...
#I Compute power relations ...
.....
#I ... finished.
#I Compute conjugation relations ...
..............................................
#I ... finished.
#I Update polycyclic collector ...
#I ... finished.
#I finished.
#I
#I Construct the polycyclic presented group ...
#I finished.
#I
Pcp-group with orders [ 3, 2, 3, 3, 3, 0, 0, 0 ]
</pre>
<p>
[<a href = "chapters.htm">Up</a>] [<a href ="CHAP004.htm">Previous</a>] [<a href = "theindex.htm">Index</a>]
<P>
<address>Polenta manual<br>June 2007
</address></body></html>
distrib
>
Mandriva
>
2010.0
>
i586
>
media
>
contrib-release
>
by-pkgid
>
5e1854624d3bc613bdd0dd13d1ef9ac7
>
files
>
2644
