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

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

<html><head><title>[Polycyclic] 1 Preface</title></head>
<body text="#000000" bgcolor="#ffffff">
[<a href = "chapters.htm">Up</a>] [<a href ="CHAP002.htm">Next</a>] [<a href = "theindex.htm">Index</a>]
<h1>1 Preface</h1><p>
<p>
A group <var>G</var> is called <strong>polycyclic</strong> if there exists a subnormal series
in <var>G</var> with cyclic factors.  Every polycyclic group is soluble and
every supersoluble group is polycyclic.  The class of polycyclic
groups is closed with respect to forming subgroups, factor groups and
extensions. Polycyclic groups can also be characterised as those
soluble groups in which each subgroup is finitely generated.
<p>
K. A. Hirsch  has initiated the investigation of  polycyclic groups in
1938,  see <a href="biblio.htm#Hir38b"><cite>Hir38b</cite></a>,  <a href="biblio.htm#Hir38a"><cite>Hir38a</cite></a>,  <a href="biblio.htm#Hir46"><cite>Hir46</cite></a>, <a href="biblio.htm#Hir52"><cite>Hir52</cite></a>,
<a href="biblio.htm#Hir54"><cite>Hir54</cite></a>, and their central  position in infinite group theory has
been recognised since.
<p>
A well-known result of Hirsch asserts that each polycyclic group is
finitely presented. In fact, a polycyclic group has a presentation
which exhibits its polycyclic structure: a <strong>pc-presentation</strong> as defined 
in the Chapter <a href="CHAP002.htm">Introduction to polycyclic presentations</a>. Pc-presentations 
allow efficient computations with the groups they define. In particular, 
the word problem is efficiently solvable in a group given by a
pc-presentation. Further, subgroups and factor groups of groups given
by a pc-presentation can be handled effectively.
<p>
The <font face="Gill Sans,Helvetica,Arial">GAP</font> 4 package <font face="Gill Sans,Helvetica,Arial">polycyclic</font> is designed for computations
with polycyclic groups which are given by a pc-presentation.  The
package contains methods to solve the word problem in such groups and
to handle subgroups and factor groups of polycyclic groups. Based on
these basic algorithms we present a collection of methods to construct
polycyclic groups and to investigate their structure.
<p>
In <a href="biblio.htm#BCRS91"><cite>BCRS91</cite></a> and <a href="biblio.htm#Seg90"><cite>Seg90</cite></a> the theory of problems which are 
decidable in polycyclic-by-finite groups has been started. As a result 
of these investigation we know that a large number of group theoretic 
problems are decidable by algorithms in polycyclic groups. However, 
practical algorithms which are suitable for computer implementations
have not been obtained by this study. We have developed a new set of
practical methods for groups given by pc-presentations, see for example
<a href="biblio.htm#Eic00"><cite>Eic00</cite></a>, and this package is a collection of implementations for these 
and other methods. 
<p>
We refer to <a href="biblio.htm#Rob82"><cite>Rob82</cite></a>, page 147ff, and <a href="biblio.htm#Seg83"><cite>Seg83</cite></a> for background on 
polycyclic groups. Further, in <a href="biblio.htm#Sims94"><cite>Sims94</cite></a> a variation of the basic 
methods for groups with pc-presentation is introduced. Finally, we note 
that the main GAP library contains many practical algorithms to compute 
with finite polycyclic groups. This is described in the Section on 
polycyclic groups in the reference manual. 
<p>
<p>
[<a href = "chapters.htm">Up</a>] [<a href ="CHAP002.htm">Next</a>] [<a href = "theindex.htm">Index</a>]
<P>
<address>Polycyclic manual<br>Februar 2009
</address></body></html>