<html ><head ><title >Nilmat : a GAP 4 package - Index </title ></head >
<body text="#000000" bgcolor="#ffffff" >
<h1 ><font face="Gill Sans,Helvetica,Arial" >Nilmat</font > : a <font face="Gill Sans,Helvetica,Arial" >GAP</font > 4 package - Index </h1 >
<p>
<a href="#idxA" >A</A>
<a href="#idxC" >C</A>
<a href="#idxE" >E</A>
<a href="#idxF" >F</A>
<a href="#idxI" >I</A>
<a href="#idxJ" >J</A>
<a href="#idxM" >M</A>
<a href="#idxN" >N</A>
<a href="#idxP" >P</A>
<a href="#idxR" >R</A>
<a href="#idxS" >S</A>
<a href="#idxT" >T</A>
<a href="#idxU" >U</A>
<H2><A NAME="idxA" >A</A></H2>
<dl >
<dt >A library of primitive nilpotent groups <a href="CHAP002.htm#SECT004" >2.4</a>
<dt >AbelianNormalSeries <a href="CHAP002.htm#SSEC001.4" >2.1.4</a>
</dl ><p>
<H2><A NAME="idxC" >C</A></H2>
<dl >
<dt >ClassLimit <a href="CHAP002.htm#SSEC001.3" >2.1.3</a>
<dt >Computing with nilpotent linear groups <a href="CHAP002.htm" >2.0</a>
<dt >Constructing some nilpotent matrix groups <a href="CHAP003.htm#SECT001" >3.1</a>
</dl ><p>
<H2><A NAME="idxE" >E</A></H2>
<dl >
<dt >Examples <a href="CHAP003.htm" >3.0</a>
</dl ><p>
<H2><A NAME="idxF" >F</A></H2>
<dl >
<dt >Finiteness, Sylow subgroups, testing complete reducibility <a href="CHAP002.htm#SECT003" >2.3</a>
<dt >Further examples of nilpotent matrix groups <a href="CHAP002.htm#SECT005" >2.5</a>
</dl ><p>
<H2><A NAME="idxI" >I</A></H2>
<dl >
<dt >Installation <a href="CHAP004.htm" >4.0</a>
<dt >Introduction <a href="CHAP001.htm" >1.0</a>
<dt >IsCompletelyReducibleNilpotentMatGroup <a href="CHAP002.htm#SSEC003.4" >2.3.4</a>
<dt >IsFiniteNilpotentMatGroup <a href="CHAP002.htm#SSEC003.1" >2.3.1</a>
<dt >IsNilpotentMatGroup <a href="CHAP002.htm#SSEC002.1" >2.2.1</a>
<dt >IsUnipotentMatGroup <a href="CHAP002.htm#SSEC001.2" >2.1.2</a>
</dl ><p>
<H2><A NAME="idxJ" >J</A></H2>
<dl >
<dt >JordanSplitting <a href="CHAP002.htm#SSEC001.1" >2.1.1</a>
</dl ><p>
<H2><A NAME="idxM" >M</A></H2>
<dl >
<dt >MaximalAbsolutelyIrreducibleNilpotentMatGroup <a href="CHAP002.htm#SSEC005.1" >2.5.1</a>
<dt >MonomialNilpotentMatGroup <a href="CHAP002.htm#SSEC005.2" >2.5.2</a>
</dl ><p>
<H2><A NAME="idxN" >N</A></H2>
<dl >
<dt >Nilmat package <a href="CHAP001.htm#I0" >1.0</a> <a href="CHAP002.htm#I0" >2.0</a> <a href="CHAP003.htm#I0" >3.0</a> <a href="CHAP004.htm#I0" >4.0</a>
<dt >NilpotentPrimitiveMatGroups <a href="CHAP002.htm#SSEC004.1" >2.4.1</a>
</dl ><p>
<H2><A NAME="idxP" >P</A></H2>
<dl >
<dt >PiPrimarySplitting <a href="CHAP002.htm#SSEC001.5" >2.1.5</a>
<dt >Preliminaries <a href="CHAP002.htm#SECT001" >2.1</a>
</dl ><p>
<H2><A NAME="idxR" >R</A></H2>
<dl >
<dt >ReducibleNilpotentMatGroup <a href="CHAP002.htm#SSEC005.3" >2.5.3</a>
</dl ><p>
<H2><A NAME="idxS" >S</A></H2>
<dl >
<dt >SizeOfNilpotentMatGroup <a href="CHAP002.htm#SSEC003.3" >2.3.3</a>
<dt >SizesOfNilpotentPrimitiveMatGroups <a href="CHAP002.htm#SSEC004.2" >2.4.2</a>
<dt >SylowSubgroupsOfNilpotentFFMatGroup <a href="CHAP002.htm#SSEC003.2" >2.3.2</a>
</dl ><p>
<H2><A NAME="idxT" >T</A></H2>
<dl >
<dt >Testing nilpotency <a href="CHAP002.htm#SECT002" >2.2</a>
<dt >Testing nilpotency and other functions <a href="CHAP003.htm#SECT002" >3.2</a>
</dl ><p>
<H2><A NAME="idxU" >U</A></H2>
<dl >
<dt >Using the library of primitive nilpotent groups <a href="CHAP003.htm#SECT003" >3.3</a>
</dl ><p>
[<a href="chapters.htm" >Up</a>]<p>
<P>
<address >Nilmat manual<br >August 2022
</address ></body ></html >
quality 97%
¤ Dauer der Verarbeitung: 0.10 Sekunden
(vorverarbeitet)
¤
*© Formatika GbR, Deutschland