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/ctbllib/doc/ (Algebra von RWTH Aachen Version 4.15.1^©) Datei vom 25.4.2025 mit Größe 104 kB

Quelle chap2.html Sprache: HTML

products/sources/formale Sprachen/GAP/pkg/ctbllib/doc/chap2.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 (CTblLib) - Chapter 2: Tutorial for the GAP Character Table Library</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">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="chap5.html">5</a> <a href="chap6.html">6</a> <a href="chap7.html">7</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="chap1.html">[Previous Chapter]</a> <a href="chap3.html">[Next Chapter]</a> </div>

<a href="chap2_mj.html">[MathJax on]</a>
<a id="X7C4E7E1181E82D8E" name="X7C4E7E1181E82D8E"></a>
<div class="ChapSects"><a href="chap2.html#X7C4E7E1181E82D8E">2 Tutorial for the GAP Character Table Library</a>
<div class="ContSect"> <a href="chap2.html#X86B34875862028E8">2.1 Concepts used in the GAP Character Table Library</a>

</div>
<div class="ContSect"> <a href="chap2.html#X84930B2D7849E019">2.2 Accessing a Character Table from the Library</a>

<div class="ContSSBlock">
 <a href="chap2.html#X8658DC3A83B5A98B">2.2-1 Accessing a Character Table via a name</a>

 <a href="chap2.html#X7AA474817D17BF49">2.2-2 Accessing a Character Table via properties</a>

 <a href="chap2.html#X7C6BFB4384CAFFC8">2.2-3 Accessing a Character Table via a Table of Marks</a>

 <a href="chap2.html#X7E6AF18C7F139F54">2.2-4 Accessing a Character Table relative to another Character Table
</a>

 <a href="chap2.html#X7CD1E9AA871848EC">2.2-5 Different character tables for the same group</a>

</div></div>
<div class="ContSect"> <a href="chap2.html#X83B721F3801ED6D1">2.3 Examples of Using the GAP Character Table Library</a>

<div class="ContSSBlock">
 <a href="chap2.html#X87AC9A4181AC369C">2.3-1 Example: Ambivalent Simple Groups</a>

 <a href="chap2.html#X7AD705F685FBF179">2.3-2 Example: Simple p-pure Groups</a>

 <a href="chap2.html#X7C2C7B138646D0C5">2.3-3 Example: Simple Groups with only one p-Block</a>

 <a href="chap2.html#X7FA308D585DC1B40">2.3-4 Example:The Sylow 3 subgroup of 3.O'N

 <a href="chap2.html#X83BF83D87BC1B123">2.3-5 Example: Primitive Permutation Characters of 2.A_6</a>

 <a href="chap2.html#X808DD8997F10D429">2.3-6 Example: A Permutation Character of Fi_23</a>

 <a href="chap2.html#X7A23CB7D8267FE55">2.3-7 Example: Non-commutators in the commutator group</a>

 <a href="chap2.html#X79CDDEE67A41EAB8">2.3-8 Example: An irreducible 11-modular character of J_4
(December 2018)</a>

 <a href="chap2.html#X8135F74080E50B14">2.3-9 Example: Tensor Products that are Generalized Projectives
(October 2019)</a>

 <a href="chap2.html#X7AD5E36B7D44C507">2.3-10 Example: Certain elementary abelian subgroups in quasisimple groups
(November 2020)</a>

</div></div>
</div>

<h3>2 Tutorial for the GAP Character Table Library</h3>

This chapter gives an overview of the basic functionality provided by the GAP Character Table Library. The main concepts and interface functions are presented in the sections <a href="chap2.html#X86B34875862028E8">2.1</a> and <a href="chap2.html#X84930B2D7849E019">2.2</a>, Section <a href="chap2.html#X83B721F3801ED6D1">2.3</a> shows a few small examples.

In order to force that the output of the examples consists only of ASCII characters, we set the user preference <code class="code">DisplayFunction</code> of the AtlasRep to the value <code class="code">"Print"</code>. This is necessary because the LaTeX and HTML versions of GAPDoc documents support only ASCII characters.

<div class="example"><pre>
gap> origpref:= UserPreference( "AtlasRep", "DisplayFunction" );;
gap> SetUserPreference( "AtlasRep", "DisplayFunction", "Print" );
</pre></div>

Some of the examples need functionalities from other GAP packages in the sense that the output looks different if these packages are not available.

<div class="example"><pre>
gap> LoadPackage( "Browse", false );
true
gap> LoadPackage( "SpinSym", false );
true
gap> LoadPackage( "TomLib", false );
true
</pre></div>

<a id="X86B34875862028E8" name="X86B34875862028E8"></a>

<h4>2.1 Concepts used in the GAP Character Table Library</h4>

The main idea behind working with the GAP Character Table Library is to deal with character tables of groups but without having access to these groups. This situation occurs for example if one extracts information from the printed Atlas of Finite Groups (<a href="chapBib.html#biBCCN85">[CCN+85]</a>).

This restriction means first of all that we need a way to access the character tables, see Section <a href="chap2.html#X84930B2D7849E019">2.2</a> for that. Once we have such a character table, we can compute all those data about the underlying group G, say, that are determined by the character table. Chapter <a href="../../../doc/ref/chap71.html#X7F9D58208241D35E">Reference: Attributes and Properties for Groups and Character Tables</a> lists such attributes and properties. For example, it can be computed from the character table of G whether G is solvable or not.

Questions that cannot be answered using only the character table of G can perhaps be treated using additional information. For example, the structure of subgroups of G is in general not determined by the character table of G, but the character table may yield partial information. Two examples can be found in the sections <a href="chap2.html#X7FA308D585DC1B40">2.3-4</a> and <a href="chap2.html#X808DD8997F10D429">2.3-6</a>.

In the character table context, the role of homomorphisms between two groups is taken by class fusions. Monomorphisms correspond to subgroup fusions, epimorphisms correspond to factor fusions. Given two character tables of a group G and a subgroup H of G, one can in general compute only candidates for the class fusion of H into G, for example using <code class="func">PossibleClassFusions</code> (<a href="../../../doc/ref/chap73.html#X7883271F7F26356E">Reference: PossibleClassFusions</a>). Note that G may contain several nonconjugate subgroups isomorphic with H, which may have different class fusions.

One can often reduce a question about a group G to a question about its maximal subgroups. In the character table context, it is often sufficient to know the character table of G, the character tables of its maximal subgroups, and their class fusions into G. We are in this situation if the attribute <code class="func">Maxes</code> (<a href="chap3.html#X8150E63F7DBDF252">3.7-1</a>) is set in the character table of G.

Summary: The character theoretic approach that is supported by the GAP Character Table Library, that is, an approach without explicitly using the underlying groups, has the advantages that it can be used to answer many questions, and that these computations are usually cheap, compared to computations with groups. Disadvantages are that this approach is not always successful, and that answers are often <q>nonconstructive</q> in the sense that one can show the existence of something without getting one's hands on it.

<a id="X84930B2D7849E019" name="X84930B2D7849E019"></a>

<h4>2.2 Accessing a Character Table from the Library</h4>

As stated in Section <a href="chap2.html#X86B34875862028E8">2.1</a>, we must define how character tables from the GAP Character Table Library can be accessed.

<a id="X8658DC3A83B5A98B" name="X8658DC3A83B5A98B"></a>

<h5>2.2-1 Accessing a Character Table via a name</h5>

The most common way to access a character table from the GAP Character Table Library is to call <code class="func">CharacterTable</code> (<a href="chap3.html#X86C06F408706F27A">3.1-2</a>) with argument a string that is an admissible name for the character table. Typical admissible names are similar to the group names used in the Atlas of Finite Groups <a href="chapBib.html#biBCCN85">[CCN+85]</a>. One of these names is the <code class="func">Identifier</code> (<a href="../../../doc/ref/chap71.html#X79C40EE97890202F">Reference: Identifier for character tables</a>) value of the character table, this name is used by GAP when it prints library character tables.

For example, an admissible name for the character table of an almost simple group is the Atlas name, such as <code class="code">A5</code>, <code class="code">M11</code>, or <code class="code">L2(11).2</code>. Other names may be admissible, for example <code class="code">S6</code> is admissible for the symmetric group on six points, which is called A_6.2_1 in the Atlas.

<div class="example"><pre>
gap> CharacterTable( "J1" );
CharacterTable( "J1" )
gap> CharacterTable( "L2(11)" );
CharacterTable( "L2(11)" )
gap> CharacterTable( "S5" );
CharacterTable( "A5.2" )
</pre></div>

<a id="X7AA474817D17BF49" name="X7AA474817D17BF49"></a>

<h5>2.2-2 Accessing a Character Table via properties</h5>

If one does not know an admissible name of the character table of a group one is interested in, or if one does not know whether ths character table is available at all, one can use <code class="func">AllCharacterTableNames</code> (<a href="chap3.html#X7C091641852BB6FE">3.1-4</a>) to compute a list of identifiers of all available character tables with given properties. Analogously, <code class="func">OneCharacterTableName</code> (<a href="chap3.html#X7EC4A57E8393D75C">3.1-5</a>) can be used to compute one such identifier.

<div class="example"><pre>
gap> AllCharacterTableNames( Size, 168 );
[ "(2^2xD14):3", "2^3.7.3", "L3(2)", "L3(4)M7", "L3(4)M8" ]
gap> OneCharacterTableName( NrConjugacyClasses, n -> n <= 4 );
"S3"
</pre></div>

For certain filters, such as <code class="func">Size</code> (<a href="../../../doc/ref/chap30.html#X858ADA3B7A684421">Reference: Size</a>) and <code class="func">NrConjugacyClasses</code> (<a href="../../../doc/ref/chap39.html#X8733F87B7E4C9903">Reference: NrConjugacyClasses</a>), the computations are fast because the values for all library tables are precomputed. See <code class="func">AllCharacterTableNames</code> (<a href="chap3.html#X7C091641852BB6FE">3.1-4</a>) for an overview of these filters.

The function <code class="func">BrowseCTblLibInfo</code> (<a href="chap3.html#X7A038A267CD17032">3.5-2</a>) provides an interactive overview of available character tables, which allows one for example to search also for substrings in identifiers of character tables. This function is available only if the Browse package has been loaded.

<a id="X7C6BFB4384CAFFC8" name="X7C6BFB4384CAFFC8"></a>

<h5>2.2-3 Accessing a Character Table via a Table of Marks</h5>

Let G be a group whose table of marks is available via the TomLib package (see <a href="chapBib.html#biBTomLib">[MNP19]</a> for how to access tables of marks from this library) then the GAP Character Table Library contains the character table of G, and one can access this table by using the table of marks as an argument of <code class="func">CharacterTable</code> (<a href="chap3.html#X87110C1584D09BE4">3.2-2</a>).

<div class="example"><pre>
gap> tom:= TableOfMarks( "M11" );
TableOfMarks( "M11" )
gap> t:= CharacterTable( tom );
CharacterTable( "M11" )
</pre></div>

<a id="X7E6AF18C7F139F54" name="X7E6AF18C7F139F54"></a>

<h5>2.2-4 Accessing a Character Table relative to another Character Table
</h5>

If one has already a character table from the GAP Character Table Library that belongs to the group G, say, then names of related tables can be found as follows.

The value of the attribute <code class="func">Maxes</code> (<a href="chap3.html#X8150E63F7DBDF252">3.7-1</a>), if known, is the list of identifiers of the character tables of all classes of maximal subgroups of G.

<div class="example"><pre>
gap> t:= CharacterTable( "M11" );
CharacterTable( "M11" )
gap> HasMaxes( t );
true
gap> Maxes( t );
[ "A6.2_3", "L2(11)", "3^2:Q8.2", "A5.2", "2.S4" ]
</pre></div>

If the <code class="func">Maxes</code> (<a href="chap3.html#X8150E63F7DBDF252">3.7-1</a>) value of the character table with identifier id, say, is known then the character table of the groups in the i-th class of maximal subgroups can be accessed via the <q>relative name</q> id<code class="code">M</code>i.

<div class="example"><pre>
gap> CharacterTable( "M11M2" );
CharacterTable( "L2(11)" )
</pre></div>

The value of the attribute <code class="func">NamesOfFusionSources</code> (<a href="../../../doc/ref/chap73.html#X7F6569D5786A9D49">Reference: NamesOfFusionSources</a>) is the list of identifiers of those character tables which store class fusions to G. So these character tables belong to subgroups of G and groups that have G as a factor group.

<div class="example"><pre>
gap> NamesOfFusionSources( t );
[ "A5.2", "A6.2_3", "P48/G1/L1/V1/ext2", "P48/G1/L1/V2/ext2",
 "L2(11)", "2.S4", "3^5:M11", "3^6.M11", "3^(2+5+10).(M11x2S4)",
 "s4", "3^2:Q8.2", "M11N2", "5:4", "11:5" ]
</pre></div>

The value of the attribute <code class="func">ComputedClassFusions</code> (<a href="../../../doc/ref/chap73.html#X7F71402285B7DE8E">Reference: ComputedClassFusions</a>) is the list of records whose <code class="code">name</code> components are the identifiers of those character tables to which class fusions are stored. So these character tables belong to overgroups and factor groups of G.

<div class="example"><pre>
gap> List( ComputedClassFusions( t ), r -> r.name );
[ "A11", "M12", "M23", "HS", "McL", "ON", "3^5:M11", "B" ]
</pre></div>

<a id="X7CD1E9AA871848EC" name="X7CD1E9AA871848EC"></a>

<h5>2.2-5 Different character tables for the same group</h5>

The GAP Character Table Library may contain several different character tables of a given group, in the sense that the rows and columns are sorted differently.

For example, the Atlas table of the alternating group A_5 is available, and since A_5 is isomorphic with the groups PSL(2, 4) and PSL(2, 5), two more character tables of A_5 can be constructed in a natural way. The three tables are of course permutation isomorphic. The first two are sorted in the same way, but the rows and columns of the third one are sorted differently.

<div class="example"><pre>
gap> t1:= CharacterTable( "A5" );;
gap> t2:= CharacterTable( "PSL", 2, 4 );;
gap> t3:= CharacterTable( "PSL", 2, 5 );;
gap> TransformingPermutationsCharacterTables( t1, t2 );
rec( columns := (), group := Group([ (4,5) ]), rows := () )
gap> TransformingPermutationsCharacterTables( t1, t3 );
rec( columns := (2,4)(3,5), group := Group([ (2,3) ]),
 rows := (2,5,3,4) )
</pre></div>

Another situation where several character tables for the same group are available is that a group contains several classes of isomorphic maximal subgroups such that the class fusions are different.

For example, the Mathieu group M_12 contains two classes of maximal subgroups of index 12, which are isomorphic with M_11.

<div class="example"><pre>
gap> t:= CharacterTable( "M12" );
CharacterTable( "M12" )
gap> mx:= Maxes( t );
[ "M11", "M12M2", "A6.2^2", "M12M4", "L2(11)", "3^2.2.S4", "M12M7",
 "2xS5", "M8.S4", "4^2:D12", "A4xS3" ]
gap> s1:= CharacterTable( mx[1] );
CharacterTable( "M11" )
gap> s2:= CharacterTable( mx[2] );
CharacterTable( "M12M2" )
</pre></div>

The class fusions into M_12 are stored on the library tables of the maximal subgroups. The groups in the first class of M_11 type subgroups contain elements in the classes <code class="code">4B</code>, <code class="code">6B</code>, and <code class="code">8B</code> of M_12, and the groups in the second class contain elements in the classes <code class="code">4A</code>, <code class="code">6A</code>, and <code class="code">8A</code>. Note that according to the Atlas (see <a href="chapBib.html#biBCCN85">[CCN+85, p. 33]</a>), the permutation characters of the action of M_12 on the cosets of M_11 type subgroups from the two classes of maximal subgroups are <code class="code">1a + 11a</code> and <code class="code">1a + 11b</code>, respectively.

<div class="example"><pre>
gap> GetFusionMap( s1, t );
[ 1, 3, 4, 7, 8, 10, 12, 12, 15, 14 ]
gap> GetFusionMap( s2, t );
[ 1, 3, 4, 6, 8, 10, 11, 11, 14, 15 ]
gap> Display( t );
M12

 2 6 4 6 1 2 5 5 1 2 1 3 3 1 . .
 3 3 1 1 3 2 . . . 1 1 . . . . .
 5 1 1 . . . . . 1 . . . . 1 . .
 11 1 . . . . . . . . . . . . 1 1

 1a 2a 2b 3a 3b 4a 4b 5a 6a 6b 8a 8b 10a 11a 11b
 2P 1a 1a 1a 3a 3b 2b 2b 5a 3b 3a 4a 4b 5a 11b 11a
 3P 1a 2a 2b 1a 1a 4a 4b 5a 2a 2b 8a 8b 10a 11a 11b
 5P 1a 2a 2b 3a 3b 4a 4b 1a 6a 6b 8a 8b 2a 11a 11b
 11P 1a 2a 2b 3a 3b 4a 4b 5a 6a 6b 8a 8b 10a 1a 1a

X.1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1
X.2 11 -1 3 2 -1 -1 3 1 -1 . -1 1 -1 . .
X.3 11 -1 3 2 -1 3 -1 1 -1 . 1 -1 -1 . .
X.4 16 4 . -2 1 . . 1 1 . . . -1 A /A
X.5 16 4 . -2 1 . . 1 1 . . . -1 /A A
X.6 45 5 -3 . 3 1 1 . -1 . -1 -1 . 1 1
X.7 54 6 6 . . 2 2 -1 . . . . 1 -1 -1
X.8 55 -5 7 1 1 -1 -1 . 1 1 -1 -1 . . .
X.9 55 -5 -1 1 1 3 -1 . 1 -1 -1 1 . . .
X.10 55 -5 -1 1 1 -1 3 . 1 -1 1 -1 . . .
X.11 66 6 2 3 . -2 -2 1 . -1 . . 1 . .
X.12 99 -1 3 . 3 -1 -1 -1 -1 . 1 1 -1 . .
X.13 120 . -8 3 . . . . . 1 . . . -1 -1
X.14 144 4 . . -3 . . -1 1 . . . -1 1 1
X.15 176 -4 . -4 -1 . . 1 -1 . . . 1 . .

A = E(11)+E(11)^3+E(11)^4+E(11)^5+E(11)^9
 = (-1+Sqrt(-11))/2 = b11
</pre></div>

Permutation equivalent library tables are related to each other. In the above example, the table <code class="code">s2</code> is a duplicate of <code class="code">s1</code>, and there are functions for making the relations explicit.

<div class="example"><pre>
gap> IsDuplicateTable( s2 );
true
gap> IdentifierOfMainTable( s2 );
"M11"
gap> IdentifiersOfDuplicateTables( s1 );
[ "HSM9", "M12M2", "ONM11" ]
</pre></div>

See Section <a href="chap3.html#X7E5CFB187E313B11">3.6</a> for details about duplicate character tables.

<a id="X83B721F3801ED6D1" name="X83B721F3801ED6D1"></a>

<h4>2.3 Examples of Using the GAP Character Table Library</h4>

The sections <a href="chap2.html#X87AC9A4181AC369C">2.3-1</a>, <a href="chap2.html#X7AD705F685FBF179">2.3-2</a>, and <a href="chap2.html#X7C2C7B138646D0C5">2.3-3</a> show how the function <code class="func">AllCharacterTableNames</code> (<a href="chap3.html#X7C091641852BB6FE">3.1-4</a>) can be used to search for character tables with certain properties. The GAP Character Table Library serves as a tool for finding and checking conjectures in these examples.

In Section <a href="chap2.html#X808DD8997F10D429">2.3-6</a>, a question about a subgroup of the sporadic simple Fischer group G = Fi_23 is answered using only character tables from the GAP Character Table Library.

More examples can be found in <a href="chapBib.html#biBGMN">[BGL+10]</a>, <a href="chapBib.html#biBAmbigFus">[Brea]</a>, <a href="chapBib.html#biBctblpope">[Bred]</a>, <a href="chapBib.html#biBProbGenArxiv">[Bree]</a>, <a href="chapBib.html#biBAuto">[Bref]</a>.

<a id="X87AC9A4181AC369C" name="X87AC9A4181AC369C"></a>

<h5>2.3-1 Example: Ambivalent Simple Groups</h5>

A group G is called ambivalent if each element in G is G-conjugate to its inverse. Equivalently, G is ambivalent if all its characters are real-valued. We are interested in nonabelian simple ambivalent groups. Since ambivalence is of course invariant under permutation equivalence, we may omit duplicate character tables.

<div class="example"><pre>
gap> isambivalent:= tbl -> PowerMap( tbl, -1 )
> = [ 1 .. NrConjugacyClasses( tbl ) ];;
gap> AllCharacterTableNames( IsSimple, true, IsDuplicateTable, false,
> IsAbelian, false, isambivalent, true );
[ "3D4(2)", "3D4(3)", "3D4(4)", "A10", "A14", "A5", "A6", "J1", "J2",
 "L2(101)", "L2(109)", "L2(113)", "L2(121)", "L2(125)", "L2(13)",
 "L2(16)", "L2(17)", "L2(25)", "L2(29)", "L2(32)", "L2(37)",
 "L2(41)", "L2(49)", "L2(53)", "L2(61)", "L2(64)", "L2(73)",
 "L2(8)", "L2(81)", "L2(89)", "L2(97)", "O12+(2)", "O12-(2)",
 "O12-(3)", "O7(5)", "O8+(2)", "O8+(3)", "O8+(7)", "O8-(2)",
 "O8-(3)", "O9(3)", "S10(2)", "S12(2)", "S4(4)", "S4(5)", "S4(8)",
 "S4(9)", "S6(2)", "S6(4)", "S6(5)", "S8(2)" ]
</pre></div>

<a id="X7AD705F685FBF179" name="X7AD705F685FBF179"></a>

<h5>2.3-2 Example: Simple p-pure Groups</h5>

A group G is called p-pure for a prime integer p that divides |G| if the centralizer orders of nonidentity p-elements in G are p-powers. Equivalently, G is p-pure if p divides |G| and each element in G of order divisible by p is a p-element. (This property was studied by L. Héthelyi in 2002.)

We are interested in small nonabelian simple p-pure groups.

<div class="example"><pre>
gap> isppure:= function( p )
> return tbl -> Size( tbl ) mod p = 0 and
> ForAll( OrdersClassRepresentatives( tbl ),
> n -> n mod p <> 0 or IsPrimePowerInt( n ) );
> end;;
gap> for i in [ 2, 3, 5, 7, 11, 13 ] do
> Print( i, "\n",
> AllCharacterTableNames( IsSimple, true, IsAbelian, false,
> IsDuplicateTable, false, isppure( i ), true ),
> "\n" );
> od;
2
[ "A5", "A6", "L2(16)", "L2(17)", "L2(31)", "L2(32)", "L2(64)",
 "L2(8)", "L3(2)", "L3(4)", "Sz(32)", "Sz(8)" ]
3
[ "A5", "A6", "L2(17)", "L2(19)", "L2(27)", "L2(53)", "L2(8)",
 "L2(81)", "L3(2)", "L3(4)" ]
5
[ "A5", "A6", "A7", "L2(11)", "L2(125)", "L2(25)", "L2(49)", "L3(4)",
 "M11", "M22", "S4(7)", "Sz(32)", "Sz(8)", "U4(2)", "U4(3)" ]
7
[ "A7", "A8", "A9", "G2(3)", "HS", "J1", "J2", "L2(13)", "L2(49)",
 "L2(8)", "L2(97)", "L3(2)", "L3(4)", "M22", "O8+(2)", "S6(2)",
 "Sz(8)", "U3(3)", "U3(5)", "U4(3)", "U6(2)" ]
11
[ "A11", "A12", "A13", "Co2", "HS", "J1", "L2(11)", "L2(121)",
 "L2(23)", "L5(3)", "M11", "M12", "M22", "M23", "M24", "McL",
 "O10+(3)", "O12+(3)", "ON", "Suz", "U5(2)", "U6(2)" ]
13
[ "2E6(2)", "2F4(2)'", "3D4(2)", "A13", "A14", "A15", "F4(2)",
 "Fi22", "G2(3)", "G2(4)", "L2(13)", "L2(25)", "L2(27)", "L3(3)",
 "L4(3)", "O7(3)", "O8+(3)", "S4(5)", "S6(3)", "Suz", "Sz(8)",
 "U3(4)" ]
</pre></div>

Looking at these examples, we may observe that the alternating group A_n of degree n is 2-pure iff n ∈ { 4, 5, 6 }, 3-pure iff n ∈ { 3, 4, 5, 6 }, and p-pure, for p ≥ 5, iff n ∈ { p, p+1, p+2 }.

Also, the Suzuki groups Sz(q) are 2-pure since the centralizers of nonidentity 2-elements are contained in Sylow 2-subgroups.

From the inspection of the generic character table(s) of PSL(2, q), we see that PSL(2, p^d) is p-pure Additionally, exactly the following cases of l-purity occur, for a prime l.

<ul>
<li>q is even and q-1 or q+1 is a power of l.

</li>
<li>For q ≡ 1 mod 4, (q+1)/2 is a power of l or q-1 is a power of l = 2.

</li>
<li>For q ≡ 3 mod 4, (q-1)/2 is a power of l or q+1 is a power of l = 2.

</li>
</ul>
<a id="X7C2C7B138646D0C5" name="X7C2C7B138646D0C5"></a>

<h5>2.3-3 Example: Simple Groups with only one p-Block</h5>

Are there nonabelian simple groups with only one p-block, for some prime p?

<div class="example"><pre>
gap> fun:= function( tbl )
> local result, p, bl;
> 
> result:= false;
> for p in PrimeDivisors( Size( tbl ) ) do
> bl:= PrimeBlocks( tbl, p );
> if Length( bl.defect ) = 1 then
> result:= true;
> Print( "only one block: ", Identifier( tbl ), ", p = ", p, "\n" );
> fi;
> od;
> 
> return result;
> end;;
gap> AllCharacterTableNames( IsSimple, true, IsAbelian, false,
> IsDuplicateTable, false, fun, true );
only one block: M22, p = 2
only one block: M24, p = 2
[ "M22", "M24" ]
</pre></div>

We see that the sporadic simple groups M_22 and M_24 have only one 2-block.

<a id="X7FA308D585DC1B40" name="X7FA308D585DC1B40"></a>

<h5>2.3-4 Example:The Sylow 3 subgroup of 3.O'N

We want to determine the structure of the Sylow 3-subgroups of the triple cover G = 3.O'N of the sporadic simple O'Nan group O'N. The Sylow 3-subgroup of O'N is an elementary abelian group of order 3^4, since the Sylow 3 normalizer in O'N has the structure 3^4:2^1+4D_10 (see [CCN+85, p. 132]).

<div class="example"><pre>
gap> CharacterTable( "ONN3" );
CharacterTable( "3^4:2^(1+4)D10" )
</pre></div>

Let P be a Sylow 3-subgroup of G. Then P is not abelian, since the centralizer order of any preimage of an element of order three in the simple factor group of G is not divisible by 3^5. Moreover, the exponent of P is three.

<div class="example"><pre>
gap> 3t:= CharacterTable( "3.ON" );;
gap> orders:= OrdersClassRepresentatives( 3t );;
gap> ord3:= PositionsProperty( orders, x -> x = 3 );
[ 2, 3, 7 ]
gap> sizes:= SizesCentralizers( 3t ){ ord3 };
[ 1382446517760, 1382446517760, 3240 ]
gap> Size( 3t );
1382446517760
gap> Collected( Factors( sizes[3] ) );
[ [ 2, 3 ], [ 3, 4 ], [ 5, 1 ] ]
gap> 9 in orders;
false
</pre></div>

So both the centre and the Frattini subgroup of P are equal to the centre of G, hence P is an extraspecial group 3^1+4_+.

<a id="X83BF83D87BC1B123" name="X83BF83D87BC1B123"></a>

<h5>2.3-5 Example: Primitive Permutation Characters of 2.A_6</h5>

It is often interesting to compute the primitive permutation characters of a group G, that is, the characters of the permutation actions of G on the cosets of its maximal subgroups. These characters can be computed for example when the character tables of G, the character tables of its maximal subgroups, and the class fusions from these character tables into the table of G are known.

<div class="example"><pre>
gap> tbl:= CharacterTable( "2.A6" );;
gap> HasMaxes( tbl );
true
gap> maxes:= Maxes( tbl );
[ "2.A5", "2.A6M2", "3^2:8", "2.Symm(4)", "2.A6M5" ]
gap> mx:= List( maxes, CharacterTable );;
gap> prim1:= List( mx, s -> TrivialCharacter( s )^tbl );;
gap> Display( tbl,
> rec( chars:= prim1, centralizers:= false, powermap:= false ) );
2.A6

 1a 2a 4a 3a 6a 3b 6b 8a 8b 5a 10a 5b 10b

Y.1 6 6 2 3 3 . . . . 1 1 1 1
Y.2 6 6 2 . . 3 3 . . 1 1 1 1
Y.3 10 10 2 1 1 1 1 2 2 . . . .
Y.4 15 15 3 3 3 . . 1 1 . . . .
Y.5 15 15 3 . . 3 3 1 1 . . . .
</pre></div>

These permutation characters are the ones listed in <a href="chapBib.html#biBCCN85">[CCN+85, p. 4]</a>.

<div class="example"><pre>
gap> PermCharInfo( tbl, prim1 ).ATLAS;
[ "1a+5a", "1a+5b", "1a+9a", "1a+5a+9a", "1a+5b+9a" ]
</pre></div>

Alternatively, one can compute the primitive permutation characters from the table of marks if this table and the fusion into it are known.

<div class="example"><pre>
gap> tom:= TableOfMarks( tbl );
TableOfMarks( "2.A6" )
gap> allperm:= PermCharsTom( tbl, tom );;
gap> prim2:= allperm{ MaximalSubgroupsTom( tom )[1] };;
gap> Display( tbl,
> rec( chars:= prim2, centralizers:= false, powermap:= false ) );
2.A6

 1a 2a 4a 3a 6a 3b 6b 8a 8b 5a 10a 5b 10b

Y.1 6 6 2 3 3 . . . . 1 1 1 1
Y.2 6 6 2 . . 3 3 . . 1 1 1 1
Y.3 10 10 2 1 1 1 1 2 2 . . . .
Y.4 15 15 3 . . 3 3 1 1 . . . .
Y.5 15 15 3 3 3 . . 1 1 . . . .
</pre></div>

We see that the two approaches yield the same permutation characters, but the two lists are sorted in a different way. The latter is due to the fact that the rows of the table of marks are ordered in a way that is not compatible with the ordering of maximal subgroups for the character table. Moreover, there is no way to choose the fusion from the character table to the table of marks in such a way that the two lists of permutation characters would become equal. The component <code class="code">perm</code> in the <code class="func">FusionToTom</code> (<a href="chap3.html#X7B1AAED68753B1BE">3.2-4</a>) record of the character table describes the incompatibility.

<div class="example"><pre>
gap> FusionToTom( tbl );
rec( map := [ 1, 2, 5, 4, 8, 3, 7, 11, 11, 6, 13, 6, 13 ],
 name := "2.A6", perm := (4,5),
 text := "fusion map is unique up to table autom." )
</pre></div>

<a id="X808DD8997F10D429" name="X808DD8997F10D429"></a>

<h5>2.3-6 Example: A Permutation Character of Fi_23</h5>

Let x be a <code class="code">3B</code> element in the sporadic simple Fischer group G = Fi_23. The normalizer M of x in G is a maximal subgroup of the type 3^{1+8}_+.2^{1+6}_-.3^{1+2}_+.2S_4. We are interested in the distribution of the elements of the normal subgroup N of the type 3^{1+8}_+ in M to the conjugacy classes of G.

This information can be computed from the permutation character π = 1_N^G, so we try to compute this permutation character. We have π = (1_N^M)^G, and 1_N^M can be computed as the inflation of the regular character of the factor group M/N to M. Note that the character tables of G and M are available, as well as the class fusion of M in G, and that N is the largest normal 3-subgroup of M.

<div class="example"><pre>
gap> t:= CharacterTable( "Fi23" );
CharacterTable( "Fi23" )
gap> mx:= Maxes( t );
[ "2.Fi22", "O8+(3).3.2", "2^2.U6(2).2", "S8(2)", "S3xO7(3)",
 "2..11.m23", "3^(1+8).2^(1+6).3^(1+2).2S4", "Fi23M8", "A12.2",
 "(2^2x2^(1+8)).(3xU4(2)).2", "2^(6+8):(A7xS3)", "S4xS6(2)",
 "S4(4).4", "L2(23)" ]
gap> m:= CharacterTable( mx[7] );
CharacterTable( "3^(1+8).2^(1+6).3^(1+2).2S4" )
gap> n:= ClassPositionsOfPCore( m, 3 );
[ 1 .. 6 ]
gap> f:= m / n;
CharacterTable( "3^(1+8).2^(1+6).3^(1+2).2S4/[ 1, 2, 3, 4, 5, 6 ]" )
gap> reg:= 0 * [ 1 .. NrConjugacyClasses( f ) ];;
gap> reg[1]:= Size( f );;
gap> infl:= reg{ GetFusionMap( m, f ) };
[ 165888, 165888, 165888, 165888, 165888, 165888, 0, 0, 0, 0, 0, 0,
 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 ]
gap> ind:= Induced( m, t, [ infl ] );
[ ClassFunction( CharacterTable( "Fi23" ),
 [ 207766624665600, 0, 0, 0, 603832320, 127567872, 6635520, 663552,
 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
 0, 0, 0, 0, 0, 0 ] ) ]
gap> PermCharInfo( t, ind ).contained;
[ [ 1, 0, 0, 0, 864, 1538, 3456, 13824, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 ] ]
gap> PositionsProperty( OrdersClassRepresentatives( t ), x -> x = 3 );
[ 5, 6, 7, 8 ]
</pre></div>

Thus N contains 864 elements in the class <code class="code">3A</code>, 1538 elements in the class <code class="code">3B</code>, and so on.

<a id="X7A23CB7D8267FE55" name="X7A23CB7D8267FE55"></a>

<h5>2.3-7 Example: Non-commutators in the commutator group</h5>

In general, not every element in the commutator group of a group is itself a commutator. Are there examples in the Character Table Library, and if yes, what is a smallest one?

<div class="example"><pre>
gap> nam:= OneCharacterTableName( CommutatorLength, x -> x > 1
> : OrderedBy:= Size );
"3.(A4x3):2"
gap> Size( CharacterTable( nam ) );
216
</pre></div>

The smallest groups with this property have order 96.

<div class="example"><pre>
gap> OneSmallGroup( Size, [ 2 .. 100 ],
> G -> CommutatorLength( G ) > 1, true );
<pc group of size 96 with 6 generators>
</pre></div>

(Note the different syntax: <code class="func">OneSmallGroup</code> (<a href="../../../pkg/smallgrp/doc/chap1.html#X875EB1167FF6BA82">smallgrp: OneSmallGroup</a>) does not admit a function such as <code class="code">x -> x > 1</code> for describing the admissible values.)

Nonabelian simple groups cannot be expected to have non-commutators, by the main theorem in <a href="chapBib.html#biBLOST2010">[LOST10]</a>.

<div class="example"><pre>
gap> OneCharacterTableName( IsSimple, true, IsAbelian, false,
> IsDuplicateTable, false,
> CommutatorLength, x -> x > 1
> : OrderedBy:= Size );
fail
</pre></div>

Perfect groups can contain non-commutators.

<div class="example"><pre>
gap> nam:= OneCharacterTableName( IsPerfect, true,
> IsDuplicateTable, false,
> CommutatorLength, x -> x > 1
> : OrderedBy:= Size );
"P1/G1/L1/V1/ext2"
gap> Size( CharacterTable( nam ) );
960
</pre></div>

This is in fact the smallest example of a perfect group that contains non-commutators.

<div class="example"><pre>
gap> for n in [ 2 .. 960 ] do
> for i in [ 1 .. NrPerfectGroups( n ) ] do
> g:= PerfectGroup( n, i);
> if CommutatorLength( g ) <> 1 then
> Print( [ n, i ], "\n" );
> fi;
> od;
> od;
[ 960, 2 ]
</pre></div>

<a id="X79CDDEE67A41EAB8" name="X79CDDEE67A41EAB8"></a>

<h5>2.3-8 Example: An irreducible 11-modular character of J_4
(December 2018)</h5>

Let G be the sporadic simple Janko group J_4. For the ordinary irreducible characters of degree 1333 of G, the reductions modulo 11 are known to be irreducible Brauer characters.

David Craven asked Richard Parker how to show that the antisymmetric squares of these Brauer characters are irreducible. Richard proposed the following.

Restrict the given ordinary character χ, say, to a subgroup S of J_4 whose 11-modular character table is known, decompose the restriction χ_S into irreducible Brauer characters, and compute those constituents that are constant on all subsets of conjugacy classes that fuse in J_4. If the Brauer character χ_S cannot be written as a sum of two such constituents then χ, as a Brauer character of J_4, is irreducible.

Here is a GAP session that shows how to apply this idea.

The group J_4 has exactly two ordinary irreducible characters of degree 1333. They are complex conjugate, and so are their antisymmetric squares. Thus we may consider just one of the two.

<div class="example"><pre>
gap> t:= CharacterTable( "J4" );;
gap> deg1333:= Filtered( Irr( t ), x -> x[1] = 1333 );;
gap> antisym:= AntiSymmetricParts( t, deg1333, 2 );;
gap> List( antisym, x -> Position( Irr( t ), x ) );
[ 7, 6 ]
gap> ComplexConjugate( antisym[1] ) = antisym[2];
true
gap> chi:= antisym[1];; chi[1];
887778
</pre></div>

Let S be a maximal subgroup of the structure 2^11:M_24 in J_4. Fortunately, the 11-modular character table of S is available (it had been constructed by Christoph Jansen), and we can restrict the interesting character to this table.

<div class="example"><pre>
gap> s:= CharacterTable( Maxes( t )[1] );;
gap> Size( s ) = 2^11 * Size( CharacterTable( "M24" ) );
true
gap> rest:= RestrictedClassFunction( chi, s );;
gap> smod11:= s mod 11;;
gap> rest:= RestrictedClassFunction( rest, smod11 );;
</pre></div>

The restriction is a sum of nine pairwise different irreducible Brauer characters of S.

<div class="example"><pre>
gap> dec:= Decomposition( Irr( smod11 ), [ rest ], "nonnegative" )[1];;
gap> Sum( dec );
9
gap> constpos:= PositionsProperty( dec, x -> x <> 0 );
[ 15, 36, 46, 53, 55, 58, 63, 67, 69 ]
</pre></div>

Next we compute those sets of classes of S which fuse in J_4.

<div class="example"><pre>
gap> smod11fuss:= GetFusionMap( smod11, s );;
gap> sfust:= GetFusionMap( s, t );;
gap> fus:= CompositionMaps( sfust, smod11fuss );;
gap> inv:= Filtered( InverseMap( fus ), IsList );
[ [ 3, 4, 5 ], [ 2, 6, 7 ], [ 8, 9 ], [ 10, 11, 16 ],
 [ 12, 14, 15, 17, 18, 21 ], [ 13, 19, 20, 22 ], [ 26, 27, 28, 30 ],
 [ 25, 29, 31 ], [ 34, 39 ], [ 35, 37, 38 ], [ 40, 42 ], [ 41, 43 ],
 [ 44, 47, 48 ], [ 45, 49, 50 ], [ 46, 51 ], [ 56, 57 ], [ 63, 64 ],
 [ 69, 70 ] ]
</pre></div>

Finally, we run over all 2^9 subsets of the irreducible constituents.

<div class="example"><pre>
gap> const:= Irr( smod11 ){ constpos };;
gap> zero:= 0 * TrivialCharacter( smod11 );;
gap> comb:= List( Combinations( const ), x -> Sum( x, zero ) );;
gap> cand:= Filtered( comb,
> x -> ForAll( inv, l -> Length( Set( x{ l } ) ) = 1 ) );;
gap> List( cand, x -> x[1] );
[ 0, 887778 ]
</pre></div>

We see that no proper subset of the constituents yields a Brauer character that can be restricted from J_4.

<a id="X8135F74080E50B14" name="X8135F74080E50B14"></a>

<h5>2.3-9 Example: Tensor Products that are Generalized Projectives
(October 2019)</h5>

Let G be a finite group and p be a prime integer. If the tensor product Φ, say, of two ordinary irreducible characters of G vanishes on all p-singular elements of G then Φ is a ℤ-linear combination of the projective indecomposable characters Φ_φ = ∑_{χ ∈ Irr(G)} d_{χ φ} χ of G, where φ runs over the irreducible p-modular Brauer characters of G and d_{χ φ} is the decomposition number of χ and φ. (See for example <a href="chapBib.html#biBNav98">[Nav98, p. 25]</a> or <a href="chapBib.html#biBLP10">[LP10, Def. 4.3.1]</a>.) Such class functions are called generalized projective characters.

In fact, very often Φ is a projective character, that is, the coefficients of the decomposition into projective indecomposable characters are nonnegative.

We are interested in examples where this is not the case. For that, we write a small GAP function that computes, for a given p-modular character table, those tensor products of ordinary irreducible characters that are generalized projective characters but are not projective.

Many years ago, Richard Parker had been interested in the question whether such tensor products can exist for a given group. Note that forming tensor products that vanish on p-singular elements is a recipe for creating projective characters, provided one knows in advance that the answer is negative for the given group.

<div class="example"><pre>
gap> GenProjNotProj:= function( modtbl )
> local p, tbl, X, PIMs, n, psingular, list, labels, i, j, psi,
> pos, dec, poss;
> 
> p:= UnderlyingCharacteristic( modtbl );
> tbl:= OrdinaryCharacterTable( modtbl );
> X:= Irr( tbl );
> PIMs:= TransposedMat( DecompositionMatrix( modtbl ) ) * X;
> n:= Length( X );
> psingular:= Difference( [ 1 .. n ], GetFusionMap( modtbl, tbl ) );
> list:= [];
> labels:= [];
> for i in [ 1 .. n ] do
> for j in [ 1 .. i ] do
> psi:= List( [ 1 .. n ], x -> X[i][x] * X[j][x] );
> if IsZero( psi{ psingular } ) then
> # This is a generalized projective character.
> pos:= Position( list, psi );
> if pos = fail then
> Add( list, psi );
> Add( labels, [ [ j, i ] ] );
> else
> Add( labels[ pos ], [ j, i ] );
> fi;
> fi;
> od;
> od;
> 
> if Length( list ) > 0 then
> # Decompose the generalized projective tensor products
> # into the projective indecomposables.
> dec:= Decomposition( PIMs, list, "nonnegative" );
> poss:= Positions( dec, fail );
> return Set( Concatenation( labels{ poss } ) );
> else
> return [];
> fi;
> end;;
</pre></div>

One group for which the function returns a nonempty result is the sporadic simple Janko group J_2 in characteristic 2.

<div class="example"><pre>
gap> tbl:= CharacterTable( "J2" );;
gap> modtbl:= tbl mod 2;;
gap> pairs:= GenProjNotProj( modtbl );
[ [ 6, 12 ] ]
gap> irr:= Irr( tbl );;
gap> PIMs:= TransposedMat( DecompositionMatrix( modtbl ) ) * irr;;
gap> SolutionMat( PIMs, irr[6] * irr[12] );
[ 0, 0, 0, 1, 1, 1, 0, 0, -2, 3 ]
</pre></div>

Checking all available tables from the library takes several hours of CPU time and also requires a lot of space; finally, it yields the following result.

<div class="example"><pre>
gap> examples:= [];;
gap> for name in AllCharacterTableNames( IsDuplicateTable, false ) do
> tbl:= CharacterTable( name );
> for p in PrimeDivisors( Size( tbl ) ) do
> modtbl:= tbl mod p;
> if modtbl <> fail then
> res:= GenProjNotProj( modtbl );
> if not IsEmpty( res ) then
--> --------------------

--> maximum size reached

--> --------------------

quality99%

¤ Diese beiden folgenden Angebotsgruppen bietet das Unternehmen0.29Angebot Wie Sie bei der Firma Beratungs- und Dienstleistungen beauftragen können ¤

*Eine klare Vorstellung vom Zielzustand

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.