| Quellcodebibliothek Statistik Leitseite products/Sources/formale Sprachen/GAP/pkg/polenta/doc/ (Algebra von RWTH Aachen Version 4.15.1©) Datei vom 10.3.2025 mit Größe 10 kB |
|
Quelle chap5.html Sprache: HTML |
|||||||||||
<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Strict//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-strict.dtd"> <html xmlns="http://www.w3.org/1999/xhtml" xml:lang="en"> <head> <title>GAP (Polenta) - Chapter 5: Information Messages</title> <meta http-equiv="content-type" content="text/html; charset=UTF-8" /> <meta name="generator" content="GAPDoc2HTML" /> <link rel="stylesheet" type="text/css" href="manual.css" /> <script src="manual.js" type="text/javascript"></script> <script type="text/javascript">overwriteStyle();</script> </head> <body class="chap5" onload="jscontent()"> <div class="chlinktop"><span class="chlink1">Goto Chapter: </span><a href="chap0.html">Top</a> <a <div class="chlinkprevnexttop"> <a href="chap0.html">[Top of Book]</a> <a href="chap0.html#con <p id="mathjaxlink" class="pcenter"><a href="chap5_mj.html">[MathJax on]</a></p> <p><a id="X85677704855596EB" name="X85677704855596EB"></a></p> <div class="ChapSects"><a href="chap5.html#X85677704855596EB">5 <span class="Heading">Info <div class="ContSect"><span class="tocline"><span class="nocss"> </span><a href="chap5.html#X7 </span> <div class="ContSSBlock"> <span class="ContSS"><br /><span class="nocss"> </span><a href="chap5.html#X809F2CFB87393CE0">5 </div></div> <div class="ContSect"><span class="tocline"><span class="nocss"> </span><a href="chap5.html#X8 </span> </div> </div> <h3>5 <span class="Heading">Information Messages</span></h3> <p>It is possible to get informations about the status of the computation of the functions of Chap <p><a id="X7EBFC26F83EB9F72" name="X7EBFC26F83EB9F72"></a></p> <h4>5.1 <span class="Heading">Info Class</span></h4> <p><a id="X809F2CFB87393CE0" name="X809F2CFB87393CE0"></a></p> <h5>5.1-1 InfoPolenta</h5> <div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">‣ In <p>is the Info class of the <strong class="pkg">Polenta</strong> package (for more details on the In <ul> <li><p>If <code class="code">InfoLevel( InfoPolenta )</code> is equal to 0 then no information messa </li> <li><p>If <code class="code">InfoLevel( InfoPolenta )</code> is equal to 1 then basic informations a </li> <li><p>If <code class="code">InfoLevel( InfoPolenta )</code> is equal to 2 then, in addition to the ba </li> </ul> <p><a id="X85861B017AEEC50B" name="X85861B017AEEC50B"></a></p> <h4>5.2 <span class="Heading">Example</span></h4> <div class="example"><pre> <span class="GAPprompt">gap></span> <span class="GAPinput">SetInfoLevel( InfoPolenta, 1 );</sp <span class="GAPprompt">gap></span> <span class="GAPinput">PcpGroupByMatGroup( PolExamples( #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 ] <span class="GAPprompt">gap></span> <span class="GAPinput">SetInfoLevel( InfoPolenta, 2 );</sp <span class="GAPprompt">gap></span> <span class="GAPinput">PcpGroupByMatGroup( PolExamples( #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></div> <div class="chlinkprevnextbot"> <a href="chap0.html">[Top of Book]</a> <a href="chap0.html#con <div class="chlinkbot"><span class="chlink1">Goto Chapter: </span><a href="chap0.html">Top</a> <a <hr /> <p class="foot">generated by <a href="https://www.math.rwth-aachen.de/~Frank.Luebeck/GA </body> </html> ¤ Dauer der Verarbeitung: 0.7 Sekunden ¤*© Formatika GbR, Deutschland |
|
2026-03-28