Sophie: gap-system-packages-4.4.12-5mdv2010.0 i586

gap-system-packages-4.4.12-5mdv2010.0.i586.rpm

<html><head><title>[GrpConst] 7 Examples with Runtimes</title></head>
<body text="#000000" bgcolor="#ffffff">
[<a href = "chapters.htm">Up</a>] [<a href ="CHAP006.htm">Previous</a>] [<a href = "theindex.htm">Index</a>]
<h1>7 Examples with Runtimes</h1><p>
<p>

In this chapter we outline some examples of applications of
the methods described above. The examples are meant to give
an idea of the possible applications of the package. Thus we
included runtimes for all examples, but omitted the output
in some cases, since it would be too long to be printed.
The runtimes have been obtained on a 400 Mhz PC running under
Linux.
<p>
<pre>
gap&gt; ConstructAllGroups( 60 );; time;
4080
</pre>
<p>
In the following examples we observe that the restriction to
certain groups is often helpful. Note that nilpotent groups 
can often be obtained as direct product of <var>p</var>-groups which,
in turn, might better be constructed by <var>p</var>-group generation
methods.
<p>
<pre>
gap&gt; FrattiniExtensionMethod( 5^3 * 7 * 31, true );;       
gap&gt; time;
13670

gap&gt; flags := rec( nonnilpot := true );; 
gap&gt; FrattiniExtensionMethod( 5^3 * 7 * 31, flags, true );;
gap&gt; time;
8400

gap&gt; flags := rec( nonsupsol := true );;                 
gap&gt; FrattiniExtensionMethod( 5^3 * 7 * 31, flags, true );;
gap&gt; time;
3640

gap&gt; flags := rec( nonpnorm := [31] );;
gap&gt; FrattiniExtensionMethod( 5^3 * 7 * 31, flags, true );;
gap&gt; time;
1740
</pre>
<p>
Next we consider groups of an order whose factorision contains
a large prime. Note that the Small Groups library contains a 
generic method to construct the groups whose order is the product 
of at most 3 primes. This method is used in <code>ConstructAllGroups</code> 
which is therefore much more efficient in the next example.
<p>
<pre>
gap&gt; FrattiniExtensionMethod( 10007 * 2, true );
[ &lt;pc group of size 20014 with 2 generators&gt;, 
  &lt;pc group of size 20014 with 2 generators&gt; ]
gap&gt; time;
87950

gap&gt; flags := rec( nonnilpot := true );;
gap&gt; FrattiniExtensionMethod( 10007 * 2, flags, true  );                    
[ &lt;pc group of size 20014 with 2 generators&gt; ]
gap&gt; time;
48950

gap&gt; ConstructAllGroups( 10007 * 2 );
[ &lt;pc group of size 20014 with 2 generators&gt;, 
  &lt;pc group of size 20014 with 2 generators&gt; ]
gap&gt; time;
30
</pre>
<p>
Finally we consider an order which factorises in seven primes and 
contains a moderately large prime power. Note that there are 943
non-nilpotent groups of order <var>288 = 2<sup>5</sup> cdot3<sup>2</sup></var> while there
are only 90 such groups without normal Sylow subgroup.
<p>
<pre>
gap&gt; flags := rec( nonnilpot := true );;
gap&gt; FrattiniExtensionMethod( 2^5 * 3^2, flags, true );;
gap&gt; time;
656630

gap&gt; flags := rec( nonpnorm := [2,3] );; 
gap&gt; FrattiniExtensionMethod( 2^5 * 3^2, flags, true );;
gap&gt; time;
58180
</pre>
<p>
<p>
[<a href = "chapters.htm">Up</a>] [<a href ="CHAP006.htm">Previous</a>] [<a href = "theindex.htm">Index</a>]
<P>
<address>GrpConst manual<br>August 2003
</address></body></html>