| products/Sources/formale Sprachen/GAP/pkg/smallclassnr/doc/chap2_mj.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>
< script type= "text/javascript"
src= "https://cdn.jsdelivr.net/npm/mathjax@2/MathJax.js?config=TeX-AMS-MML_HTMLorMML">
</ script>
< title>GAP (SmallClassNr) - Chapter 2: Classification</ 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= "chap2" onload= "jscontent()">
< div class= "chlinktop">< span class= "chlink1">Goto Chapter: </ span>< a href= "chap0_mj.html">Top< /a> <a href="chap1_mj.html">1</a> <a href="chap2_mj.html">2</a> <a href="chap3_mj.html">3</a> <a href="chapBib_mj.html">Bib</a> <a href="chapInd_mj.html">Ind</a> </div>
<div class="chlinkprevnexttop"> <a href="chap0_mj.html">[Top of Book]</a> <a href="chap0_mj.html#contents">[Contents]</a> <a href="chap1_mj.html">[Previous Chapter]</a> <a href="chap3_mj.html">[Next Chapter]</a> </div>
<p id="mathjaxlink" class="pcenter"><a href="chap2.html">[MathJax off]</a></p>
<p><a id="X8053C9E57C4C5F94" name="X8053C9E57C4C5F94"></a></p>
<div class="ChapSects"><a href="chap2_mj.html#X8053C9E57C4C5F94">2 <span class="Heading">Classification</span></a>
</div>
<h3>2 <span class="Heading">Classification</span></h3>
<p>The <em>class number</em> <span class="SimpleMath">\(k(G)\)</span> of a group <span class="SimpleMath">\(G\)</span> is the number of conjugacy classes of <span class="SimpleMath">\(G\)</span>. In 1903, Landau proved in <a href="chapBib_mj.html#biBland03-a">[Lan03]</a> that for every <span class="SimpleMath">\(n \in \mathbb{N}\)</span>, there are only finitely many finite groups with exactly <span class="SimpleMath">\(n\)</span> conjugacy classes. The <strong class="pkg">SmallClassNr</strong> package provides access to the finite groups with class number at most <span class="SimpleMath">\(14\)</span>.</p>
<p>These groups were classified in the following papers:</p>
<ul>
<li><p><span class="SimpleMath">\(k(G) \leq 5\)</span>, by Miller in <a href="chapBib_mj.html#biBmill11-a">[Mil11]</a> and independently by Burnside in <a href="chapBib_mj.html#biBburn11-a">[Bur11]</a></p>
</li>
<li><p><span class="SimpleMath">\(k(G) = 6,7\)</span>, by Poland in <a href="chapBib_mj.html#biBpola68-a">[Pol68]</a></p>
</li>
<li><p><span class="SimpleMath">\(k(G) = 8\)</span>, by Kosvintsev in <a href="chapBib_mj.html#biBkosv74-a">[Kos74]</a></p>
</li>
<li><p><span class="SimpleMath">\(k(G) = 9\)</span>, by Odincov and Starostin in <a href="chapBib_mj.html#biBos76-a">[OS76]</a></p>
</li>
<li><p><span class="SimpleMath">\(k(G) = 10,11\)</span>, by Vera López and Vera López in <a href="chapBib_mj.html#biBll85-a">[VLVL85]</a> (1)</p>
</li>
<li><p><span class="SimpleMath">\(k(G) = 12\)</span>, by Vera López and Vera López in <a href="chapBib_mj.html#biBll86-a">[VLVL86]</a> (2)</p>
</li>
<li><p><span class="SimpleMath">\(k(G) = 13, 14\)</span>, by Vera López and Sangroniz in <a href="chapBib_mj.html#biBvs07-a">[VLS07]</a></p>
</li>
</ul>
<p>(1) In <a href="chapBib_mj.html#biBll85-a">[VLVL85]</a>, three distinct groups of the form <span class="SimpleMath">\((C_5 \times C_5) \rtimes C_4\)</span> order <span class="SimpleMath">\(100\)</span> with class number <span class="SimpleMath">\(10\)</span> are given. However, only two such groups exist, being the ones with <code class="code">IdClassNr</code> equal to <code class="code">[10,25]</code> and <code class="code">[10,26]</code>.</p>
<p>(2) In <a href="chapBib_mj.html#biBll86-a">[VLVL86]</a>, only 48 groups with class number 12 are listed. The three missing groups are provided in the appendix of <a href="chapBib_mj.html#biBvs07-a">[VLS07]</a>. These are the groups with <code class="code">IdClassNr</code> equal to <code class="code">[12,13]</code>, <code class="code">[12,16]</code> and <code class="code">[12,39]</code>.</p>
<div class="chlinkprevnextbot"> <a href="chap0_mj.html">[Top of Book]</a> <a href="chap0_mj.html#contents">[Contents]</a> <a href="chap1_mj.html">[Previous Chapter]</a> <a href="chap3_mj.html">[Next Chapter]</a> </div>
<div class="chlinkbot"><span class="chlink1">Goto Chapter: </span><a href="chap0_mj.html">Top</a> <a href="chap1_mj.html">1</a> <a href="chap2_mj.html">2</a> <a href="chap3_mj.html">3</a> <a href="chapBib_mj.html">Bib</a> <a href="chapInd_mj.html">Ind</a> </div>
<hr />
<p class="foot">generated by <a href="https://www.math.rwth-aachen.de/~Frank.Luebeck/GAPDoc">GAPDoc2HTML</a></p>
</body>
</html>
¤ Dauer der Verarbeitung: 0.1 Sekunden
(vorverarbeitet am 2026-11-04)
¤
*© Formatika GbR, Deutschland
|
|