Quelle CHAP002.htm Sprache: HTML

products/Sources/formale Sprachen/GAP/pkg/grpconst/htm/CHAP002.htm

<html><head><title>[grpconst] 2 Introduction to GrpConst</title></head>
<body text="#000000" bgcolor="#ffffff">
[<a href = "chapters.htm">Up</a>] [<a href ="CHAP001.htm">Previous</a>] [<a href ="CHAP003.htm">Next</a>] [<a href = "theindex.htm">Index</a>]
<h1>2 Introduction to GrpConst</h1>

<a name = "I0"></a>

This package contains three methods to construct the groups of a
certain type up to isomorphism.

The Frattini Extension Method:

This method can be used to determine all soluble groups of a given
order. The practicability of the method depends clearly on the
chosen order. Furthermore, the efficiency of the method might be
increased by restricting the construction to groups with certain
properties. This is easily possible for a number of properties;
for example, it is useful and straightforward to compute non-nilpotent
groups only.
(See Chapter <a href="CHAP004.htm">The Frattini Extension Method</a>.)

The Cyclic Split Extension Method:

The cyclic split extension method can be used to list all groups of
order <var>pn cdotq</var> for different primes <var>p</var> and <var>q</var> which have a
normal Sylow subgroup. These groups are also soluble, and hence might
also be obtained by the Frattini extension method. However, the cyclic
split extension method is more effective on this case. Note that this
method relies on a list of groups of order <var>pn</var>. Moreover, the
efficiency of this method depends on an effective method to compute
automorphism groups of <var>p</var>-groups. (See Chapter <a href="CHAP005.htm">The Cyclic Split Extension Method</a>.)

The Upwards Extension Method:

The upwards extension method is the most general of the three methods.
It can be used to construct all groups of a given order. However, it
is the least efficient of the three methods and hence should only be
used to construct non-soluble groups. Note that this method needs
a list of perfect groups of order dividing the given one.
(See Chapter <a href="CHAP006.htm">The Upwards Extension Method</a>.)

Furthermore, the package contains a wrap up function which combines
the three methods to a general algorithm to construct the groups of
a given order. (See Chapter <a href="CHAP003.htm">Construction of All Groups</a>.) Finally,
there is an info class <code>InfoGrpCon</code> available for the functions of
this share package with possible levels 1 up to 4.


[<a href = "chapters.htm">Up</a>] [<a href ="CHAP001.htm">Previous</a>] [<a href ="CHAP003.htm">Next</a>] [<a href = "theindex.htm">Index</a>]

<address>grpconst manual January 2024
</address></body></html>

quality100%

¤ Dauer der Verarbeitung: 0.20 Sekunden (vorverarbeitet) ¤

Wurzel

Suchen

Beweissystem der NASA

Beweissystem Isabelle

NIST Cobol Testsuite

Cephes Mathematical Library

Wiener Entwicklungsmethode

Haftungshinweis

Die Informationen auf dieser Webseite wurden nach bestem Wissen sorgfältig zusammengestellt. Es wird jedoch weder Vollständigkeit, noch Richtigkeit, noch Qualität der bereit gestellten Informationen zugesichert.

Bemerkung:

Die farbliche Syntaxdarstellung ist noch experimentell.