Ziele Untersuchung
mit Columbo Integrität von
Datenbanken Interaktion und
Portierbarkeit Ergonomie der
Schnittstellen

Angebot Produkte Projekt Beratung

Mittel Analytik Modellierung Sprachen Algebra Logik Hardware Denken Kreativität

Zusammenhänge Gesellschaft Wirtschaft Branche Firma


products/sources/formale Sprachen/GAP/pkg/unitlib/doc/ (Algebra von RWTH Aachen Version 4.15.1^©) Datei vom 12.5.2025 mit Größe 7 kB

SSL chap4.html Sprache: HTML

products/sources/formale Sprachen/GAP/pkg/unitlib/doc/chap4.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 (UnitLib) - Chapter 4: An example of UnitLib usage</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="chap4" onload="jscontent()">

<div class="chlinktop">Goto Chapter: <a href="chap0.html">Top</a> <a href="chap1.html">1</a> <a href="chap2.html">2</a> <a href="chap3.html">3</a> <a href="chap4.html">4</a> <a href="chapBib.html">Bib</a> <a href="chapInd.html">Ind</a> </div>

<div class="chlinkprevnexttop"> <a href="chap0.html">[Top of Book]</a> <a href="chap0.html#contents">[Contents]</a> <a href="chap3.html">[Previous Chapter]</a> <a href="chapBib.html">[Next Chapter]</a> </div>

<a href="chap4_mj.html">[MathJax on]</a>
<a id="X796C0EEB80C005D1" name="X796C0EEB80C005D1"></a>
<div class="ChapSects"><a href="chap4.html#X796C0EEB80C005D1">4 An example of UnitLib usage</a>
</div>

<h3>4 An example of UnitLib usage</h3>

We will finish with several examples of UnitLib usage to give an idea how to work with the package.

In the first example we retrieve from the library the normalized unit group of the group algebra of the dihedral group of order 128 over the field of two elements, compute its center and find some of its properties, and then check that the group generated by these generators expressed in terms of group algebra elements is abelian:

<div class="example"><pre>

gap> IdGroup(DihedralGroup(128));
[ 128, 161 ]
gap> V := PcNormalizedUnitGroupSmallGroup( 128, 161 );
<pc group of size 170141183460469231731687303715884105728 with 127 generators>
gap> C := Center( V ); 
<pc group with 34 generators>
gap> gens := MinimalGeneratingSet( C );;
gap> Length(gens);
19
gap> Size(C);
17179869184
gap> AbelianInvariants(C);
[ 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 4, 4, 4, 4, 8, 8, 16, 32 ]
gap> KG := UnderlyingGroupRing( V );
<algebra-with-one over GF(2), with 7 generators>
gap> f := NaturalBijectionToNormalizedUnitGroup( KG );;
gap> IsAbelian( Group( List( gens, x -> x^f ) ));
true

</pre></div>

In the second example we will check the conjecture about the coincidence of the lower and upper Lie nilpotency indices of the modular group algebras for all non-abelian groups of order 64.

It is known that these indices coincide for p-groups with p>3 <a href="chapBib.html#biBBhandari-Passi">[BP92]</a>, but in the general case the problem remains open.

The indices t_L(G) and t^L(G) can be computed using the LAGUNA package. While the upper Lie nilpotency index can be expressed only in terms of the underlying group G, the lower Lie nilpotency index is determined by the formula t_L(G) = cl V(KG) + 1 <a href="chapBib.html#biBDu">[Du92]</a>, and can be computed immediately whenever V(KG) is known.

In the program below we enumerate all groups of size 64 and check the conjecture (we do not exclude from consideration some particular cases when the conjecture is known to be true for p=2, because this is beyond the task of this manual).

<div class="example"><pre>

gap> for n in [ 1 .. NrSmallGroups( 64 ) ] do
> if not IsAbelian( SmallGroup( 64, n ) ) then
> V := PcNormalizedUnitGroupSmallGroup( 64, n );
> KG := UnderlyingGroupRing( V );
> if LieLowerNilpotencyIndex( KG ) <>
> LieUpperNilpotencyIndex( KG ) then
> Print( n," - counterexample !!! \n" );
> break;
> fi;
> fi;
> od;

</pre></div>

Thus, the test was finished without finding a counterexample.

In the next example we will answer the question about possible nilpotency classes of normalized unit groups of modular group algebras of nonabelian groups of order 64:

<div class="example"><pre>

gap> cl := [];;
gap> for n in [ 1 .. NrSmallGroups( 64 ) ] do
> if not IsAbelian( SmallGroup( 64, n ) ) then
> V := PcNormalizedUnitGroupSmallGroup( 64, n ); 
> AddSet( cl, NilpotencyClassOfGroup( V ) );
> fi;
> od;
gap> cl;
[ 2, 3, 4, 5, 6, 7, 8, 16 ]

</pre></div>

With UnitLib you can perform the computation from the last example in several hours on a modern computer. Without UnitLib you will spend the same time to compute only several normalized unit groups V(KG) for groups of order 128 with the help of the LAGUNA package. Note that without LAGUNA such computation would not be feasible at all.

<div class="chlinkprevnextbot"> <a href="chap0.html">[Top of Book]</a> <a href="chap0.html#contents">[Contents]</a> <a href="chap3.html">[Previous Chapter]</a> <a href="chapBib.html">[Next Chapter]</a> </div>

<div class="chlinkbot">Goto Chapter: <a href="chap0.html">Top</a> <a href="chap1.html">1</a> <a href="chap2.html">2</a> <a href="chap3.html">3</a> <a href="chap4.html">4</a> <a href="chapBib.html">Bib</a> <a href="chapInd.html">Ind</a> </div>

<hr />
generated by <a href="https://www.math.rwth-aachen.de/~Frank.Luebeck/GAPDoc">GAPDoc2HTML</a>
</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.