Properties

Label 419904.ln
Order \( 2^{6} \cdot 3^{8} \)
Exponent \( 2^{2} \cdot 3^{2} \)
Nilpotent no
Solvable yes
$\card{G^{\mathrm{ab}}}$ \( 2^{3} \)
$\card{Z(G)}$ 1
$\card{\Aut(G)}$ \( 2^{7} \cdot 3^{10} \)
$\card{\mathrm{Out}(G)}$ \( 2 \cdot 3^{2} \)
Perm deg. $36$
Trans deg. $36$
Rank $3$

Related objects

Downloads

Learn more

Show commands: Gap / Magma / Oscar / SageMath

Copy content comment:Construction of abstract group
 
Copy content magma:G := PermutationGroup< 36 | (1,34,3,36,2,35)(4,31,17,7)(5,33,16,8)(6,32,18,9)(10,26,12,25,11,27)(13,24,15,23,14,22)(19,30,20,28)(21,29), (1,32,14,9,25,19,3,31,13,8,27,21,2,33,15,7,26,20)(4,23,18,34)(5,24,17,36)(6,22,16,35)(10,30,11,29)(12,28), (1,9,27,21,14,32,2,8,25,20,15,31,3,7,26,19,13,33)(4,35,30,11,16,23,6,36,29,12,18,24,5,34,28,10,17,22) >;
 
Copy content gap:G := Group( (1,34,3,36,2,35)(4,31,17,7)(5,33,16,8)(6,32,18,9)(10,26,12,25,11,27)(13,24,15,23,14,22)(19,30,20,28)(21,29), (1,32,14,9,25,19,3,31,13,8,27,21,2,33,15,7,26,20)(4,23,18,34)(5,24,17,36)(6,22,16,35)(10,30,11,29)(12,28), (1,9,27,21,14,32,2,8,25,20,15,31,3,7,26,19,13,33)(4,35,30,11,16,23,6,36,29,12,18,24,5,34,28,10,17,22) );
 
Copy content sage:G = PermutationGroup(['(1,34,3,36,2,35)(4,31,17,7)(5,33,16,8)(6,32,18,9)(10,26,12,25,11,27)(13,24,15,23,14,22)(19,30,20,28)(21,29)', '(1,32,14,9,25,19,3,31,13,8,27,21,2,33,15,7,26,20)(4,23,18,34)(5,24,17,36)(6,22,16,35)(10,30,11,29)(12,28)', '(1,9,27,21,14,32,2,8,25,20,15,31,3,7,26,19,13,33)(4,35,30,11,16,23,6,36,29,12,18,24,5,34,28,10,17,22)'])
 
Copy content sage_gap:G = gap.new('Group( (1,34,3,36,2,35)(4,31,17,7)(5,33,16,8)(6,32,18,9)(10,26,12,25,11,27)(13,24,15,23,14,22)(19,30,20,28)(21,29), (1,32,14,9,25,19,3,31,13,8,27,21,2,33,15,7,26,20)(4,23,18,34)(5,24,17,36)(6,22,16,35)(10,30,11,29)(12,28), (1,9,27,21,14,32,2,8,25,20,15,31,3,7,26,19,13,33)(4,35,30,11,16,23,6,36,29,12,18,24,5,34,28,10,17,22) )')
 
Copy content oscar:G = @permutation_group(36, (1,34,3,36,2,35)(4,31,17,7)(5,33,16,8)(6,32,18,9)(10,26,12,25,11,27)(13,24,15,23,14,22)(19,30,20,28)(21,29), (1,32,14,9,25,19,3,31,13,8,27,21,2,33,15,7,26,20)(4,23,18,34)(5,24,17,36)(6,22,16,35)(10,30,11,29)(12,28), (1,9,27,21,14,32,2,8,25,20,15,31,3,7,26,19,13,33)(4,35,30,11,16,23,6,36,29,12,18,24,5,34,28,10,17,22))
 

Group information

Description:$D_9\wr C_2^2$
Order: \(419904\)\(\medspace = 2^{6} \cdot 3^{8} \)
Copy content comment:Order of the group
 
Copy content magma:Order(G);
 
Copy content gap:Order(G);
 
Copy content sage:G.order()
 
Copy content sage_gap:G.Order()
 
Copy content oscar:order(G)
 
Exponent: \(36\)\(\medspace = 2^{2} \cdot 3^{2} \)
Copy content comment:Exponent of the group
 
Copy content magma:Exponent(G);
 
Copy content gap:Exponent(G);
 
Copy content sage:G.exponent()
 
Copy content sage_gap:G.Exponent()
 
Copy content oscar:exponent(G)
 
Automorphism group:$D_9\wr A_4.C_6$, of order \(7558272\)\(\medspace = 2^{7} \cdot 3^{10} \)
Copy content comment:Automorphism group
 
Copy content gap:AutomorphismGroup(G);
 
Copy content magma:AutomorphismGroup(G);
 
Copy content sage:libgap(G).AutomorphismGroup()
 
Copy content sage_gap:G.AutomorphismGroup()
 
Copy content oscar:automorphism_group(G)
 
Composition factors:$C_2$ x 6, $C_3$ x 8
Copy content comment:Composition factors of the group
 
Copy content magma:CompositionFactors(G);
 
Copy content gap:CompositionSeries(G);
 
Copy content sage:G.composition_series()
 
Copy content sage_gap:G.CompositionSeries()
 
Copy content oscar:composition_series(G)
 
Derived length:$3$
Copy content comment:Derived length of the group
 
Copy content magma:DerivedLength(G);
 
Copy content gap:DerivedLength(G);
 
Copy content sage:libgap(G).DerivedLength()
 
Copy content sage_gap:G.DerivedLength()
 
Copy content oscar:derived_length(G)
 

This group is nonabelian and solvable. Whether it is monomial has not been computed.

Copy content comment:Determine if the group G is abelian
 
Copy content magma:IsAbelian(G);
 
Copy content gap:IsAbelian(G);
 
Copy content sage:G.is_abelian()
 
Copy content sage_gap:G.IsAbelian()
 
Copy content oscar:is_abelian(G)
 
Copy content comment:Determine if the group G is cyclic
 
Copy content magma:IsCyclic(G);
 
Copy content gap:IsCyclic(G);
 
Copy content sage:G.is_cyclic()
 
Copy content sage_gap:G.IsCyclic()
 
Copy content oscar:is_cyclic(G)
 
Copy content comment:Determine if the group G is nilpotent
 
Copy content magma:IsNilpotent(G);
 
Copy content gap:IsNilpotentGroup(G);
 
Copy content sage:G.is_nilpotent()
 
Copy content sage_gap:G.IsNilpotentGroup()
 
Copy content oscar:is_nilpotent(G)
 
Copy content comment:Determine if the group G is solvable
 
Copy content magma:IsSolvable(G);
 
Copy content gap:IsSolvableGroup(G);
 
Copy content sage:G.is_solvable()
 
Copy content sage_gap:G.IsSolvableGroup()
 
Copy content oscar:is_solvable(G)
 
Copy content comment:Determine if the group G is supersolvable
 
Copy content gap:IsSupersolvableGroup(G);
 
Copy content sage:G.is_supersolvable()
 
Copy content sage_gap:G.IsSupersolvableGroup()
 
Copy content oscar:is_supersolvable(G)
 
Copy content comment:Determine if the group G is simple
 
Copy content magma:IsSimple(G);
 
Copy content gap:IsSimpleGroup(G);
 
Copy content sage:G.is_simple()
 
Copy content sage_gap:G.IsSimpleGroup()
 
Copy content oscar:is_simple(G)
 

Group statistics

Copy content comment:Compute statistics for the group G
 
Copy content magma:// Magma code to output the first two rows of the group statistics table element_orders := [Order(g) : g in G]; orders := Set(element_orders); printf "Orders: %o\n", orders; printf "Elements: %o %o\n", [#[x : x in element_orders | x eq n] : n in orders], Order(G); cc_orders := [cc[1] : cc in ConjugacyClasses(G)]; printf "Conjugacy classes: %o %o\n", [#[x : x in cc_orders | x eq n] : n in orders], #cc_orders;
 
Copy content gap:# Gap code to output the first two rows of the group statistics table element_orders := List(Elements(G), g -> Order(g)); orders := Set(element_orders); Print("Orders: ", orders, "\n"); element_counts := List(orders, n -> Length(Filtered(element_orders, x -> x = n))); Print("Elements: ", element_counts, " ", Size(G), "\n"); cc_orders := List(ConjugacyClasses(G), cc -> Order(Representative(cc))); cc_counts := List(orders, n -> Length(Filtered(cc_orders, x -> x = n))); Print("Conjugacy classes: ", cc_counts, " ", Length(ConjugacyClasses(G)), "\n");
 
Copy content sage:# Sage code to output the first two rows of the group statistics table element_orders = [g.order() for g in G] orders = sorted(list(set(element_orders))) print("Orders:", orders) print("Elements:", [element_orders.count(n) for n in orders], G.order()) cc_orders = [cc[0].order() for cc in G.conjugacy_classes()] print("Conjugacy classes:", [cc_orders.count(n) for n in orders], len(cc_orders))
 
Copy content sage_gap:# Sage code (using the GAP interface) to output the first two rows of the group statistics table element_orders = [g.Order() for g in G.Elements()] orders = sorted(list(set(element_orders))) print("Orders:", orders) print("Elements:", [element_orders.count(n) for n in orders], G.Order()) cc_orders = [cc.Representative().Order() for cc in G.ConjugacyClasses()] print("Conjugacy classes:", [cc_orders.count(n) for n in orders], len(cc_orders))
 
Copy content oscar:# Oscar code to output the first two rows of the group statistics table element_orders = [order(g) for g in elements(G)] orders = sort(unique(element_orders)) println("Orders: ", orders) element_counts = [count(==(n), element_orders) for n in orders] println("Elements: ", element_counts, " ", order(G)) ccs = conjugacy_classes(G) cc_orders = [order(representative(cc)) for cc in ccs] cc_counts = [count(==(n), cc_orders) for n in orders] println("Conjugacy classes: ", cc_counts, " ", length(ccs))
 

Order 1 2 3 4 6 9 12 18 36
Elements 1 10971 80 96228 18432 6480 34992 147744 104976 419904
Conjugacy classes   1 9 6 6 20 168 3 192 9 414
Divisions 1 9 6 6 20 56 3 64 3 168
Autjugacy classes 1 5 4 2 8 23 1 20 1 65

Copy content comment:Compute statistics about the characters of G
 
Copy content magma:// Outputs [<d_1,c_1>, <d_2,c_2>, ...] where c_i is the number of irr. complex chars. of G with degree d_i CharacterDegrees(G);
 
Copy content gap:# Outputs [[d_1,c_1], [d_2,c_2], ...] where c_i is the number of irr. complex chars. of G with degree d_i CharacterDegrees(G);
 
Copy content sage:# Outputs [[d_1,c_1], [d_2,c_2], ...] where c_i is the number of irr. complex chars. of G with degree d_i character_degrees = [c[0] for c in G.character_table()] [[n, character_degrees.count(n)] for n in set(character_degrees)]
 
Copy content sage_gap:# Outputs [[d_1,c_1], [d_2,c_2], ...] where c_i is the number of irr. complex chars. of G with degree d_i G.CharacterDegrees()
 
Copy content oscar:# Outputs an MSet containing the absolutely irreducible degrees of G and their multiplicities. character_degrees(G)
 

Dimension 1 2 4 8 16 24 32 48 64 96 192
Irr. complex chars.   8 6 2 80 100 0 164 0 54 0 0 414
Irr. rational chars. 8 6 2 20 7 20 2 31 0 54 18 168

Minimal presentations

Permutation degree:$36$
Transitive degree:$36$
Rank: $3$
Inequivalent generating triples: not computed

Minimal degrees of faithful linear representations

Over $\mathbb{C}$ Over $\mathbb{R}$ Over $\mathbb{Q}$
Irreducible 8 8 24
Arbitrary not computed not computed not computed

Constructions

Show commands: Gap / Magma / Oscar / SageMath


Presentation: ${\langle a, b, c, d, e, f, g \mid b^{2}=c^{4}=d^{18}=e^{18}=f^{9}=g^{9}= \!\cdots\! \rangle}$ Copy content Toggle raw display
Copy content comment:Define the group with the given generators and relations
 
Copy content magma:G := PCGroup([14, 2, 2, 2, 2, 2, 3, 3, 2, 3, 3, 3, 3, 3, 3, 187292, 8716345, 2365274, 1043212, 114, 13366979, 8006897, 1506544, 9867778, 4070672, 375386, 200, 24772613, 6542611, 836673, 2735, 327, 3386886, 9428, 381058, 2400, 5258855, 1725717, 5392611, 68593, 2175327, 490973, 329, 31356872, 616918, 12251268, 72626, 77176, 498, 39204489, 1330583, 9801157, 60531, 166385, 28740106, 11984934, 798388, 612, 23514635, 8103, 653237, 6604428, 419368, 8491446, 235982, 726, 3048205, 846761, 6858487, 190623]); a,b,c,d,e,f,g := Explode([G.1, G.2, G.3, G.5, G.8, G.11, G.13]); AssignNames(~G, ["a", "b", "c", "c2", "d", "d2", "d6", "e", "e2", "e6", "f", "f3", "g", "g3"]);
 
Copy content gap:G := PcGroupCode(1484722512546581146517270473524382998464346127281031465242192063744836518902534320891956636504252288159019708314463898324305164603940143003433184451376008588031702706444448419373699533094690481297892632816548121239544902871056843271353989460880830100882687181688977847620830535680701882928709620065038613345729262568275210742032521629614527,419904); a := G.1; b := G.2; c := G.3; d := G.5; e := G.8; f := G.11; g := G.13;
 
Copy content sage:# This uses Sage's interface to GAP, as Sage (currently) has no native support for PC groups G = gap.new('PcGroupCode(1484722512546581146517270473524382998464346127281031465242192063744836518902534320891956636504252288159019708314463898324305164603940143003433184451376008588031702706444448419373699533094690481297892632816548121239544902871056843271353989460880830100882687181688977847620830535680701882928709620065038613345729262568275210742032521629614527,419904)'); a = G.1; b = G.2; c = G.3; d = G.5; e = G.8; f = G.11; g = G.13;
 
Copy content sage_gap:# This uses Sage's interface to GAP, as Sage (currently) has no native support for PC groups G = gap.new('PcGroupCode(1484722512546581146517270473524382998464346127281031465242192063744836518902534320891956636504252288159019708314463898324305164603940143003433184451376008588031702706444448419373699533094690481297892632816548121239544902871056843271353989460880830100882687181688977847620830535680701882928709620065038613345729262568275210742032521629614527,419904)'); a = G.1; b = G.2; c = G.3; d = G.5; e = G.8; f = G.11; g = G.13;
 
Permutation group:Degree $36$ $\langle(1,34,3,36,2,35)(4,31,17,7)(5,33,16,8)(6,32,18,9)(10,26,12,25,11,27)(13,24,15,23,14,22) \!\cdots\! \rangle$ Copy content Toggle raw display
Copy content comment:Define the group as a permutation group
 
Copy content magma:G := PermutationGroup< 36 | (1,34,3,36,2,35)(4,31,17,7)(5,33,16,8)(6,32,18,9)(10,26,12,25,11,27)(13,24,15,23,14,22)(19,30,20,28)(21,29), (1,32,14,9,25,19,3,31,13,8,27,21,2,33,15,7,26,20)(4,23,18,34)(5,24,17,36)(6,22,16,35)(10,30,11,29)(12,28), (1,9,27,21,14,32,2,8,25,20,15,31,3,7,26,19,13,33)(4,35,30,11,16,23,6,36,29,12,18,24,5,34,28,10,17,22) >;
 
Copy content gap:G := Group( (1,34,3,36,2,35)(4,31,17,7)(5,33,16,8)(6,32,18,9)(10,26,12,25,11,27)(13,24,15,23,14,22)(19,30,20,28)(21,29), (1,32,14,9,25,19,3,31,13,8,27,21,2,33,15,7,26,20)(4,23,18,34)(5,24,17,36)(6,22,16,35)(10,30,11,29)(12,28), (1,9,27,21,14,32,2,8,25,20,15,31,3,7,26,19,13,33)(4,35,30,11,16,23,6,36,29,12,18,24,5,34,28,10,17,22) );
 
Copy content sage:G = PermutationGroup(['(1,34,3,36,2,35)(4,31,17,7)(5,33,16,8)(6,32,18,9)(10,26,12,25,11,27)(13,24,15,23,14,22)(19,30,20,28)(21,29)', '(1,32,14,9,25,19,3,31,13,8,27,21,2,33,15,7,26,20)(4,23,18,34)(5,24,17,36)(6,22,16,35)(10,30,11,29)(12,28)', '(1,9,27,21,14,32,2,8,25,20,15,31,3,7,26,19,13,33)(4,35,30,11,16,23,6,36,29,12,18,24,5,34,28,10,17,22)'])
 
Copy content sage_gap:G = gap.new('Group( (1,34,3,36,2,35)(4,31,17,7)(5,33,16,8)(6,32,18,9)(10,26,12,25,11,27)(13,24,15,23,14,22)(19,30,20,28)(21,29), (1,32,14,9,25,19,3,31,13,8,27,21,2,33,15,7,26,20)(4,23,18,34)(5,24,17,36)(6,22,16,35)(10,30,11,29)(12,28), (1,9,27,21,14,32,2,8,25,20,15,31,3,7,26,19,13,33)(4,35,30,11,16,23,6,36,29,12,18,24,5,34,28,10,17,22) )')
 
Copy content oscar:G = @permutation_group(36, (1,34,3,36,2,35)(4,31,17,7)(5,33,16,8)(6,32,18,9)(10,26,12,25,11,27)(13,24,15,23,14,22)(19,30,20,28)(21,29), (1,32,14,9,25,19,3,31,13,8,27,21,2,33,15,7,26,20)(4,23,18,34)(5,24,17,36)(6,22,16,35)(10,30,11,29)(12,28), (1,9,27,21,14,32,2,8,25,20,15,31,3,7,26,19,13,33)(4,35,30,11,16,23,6,36,29,12,18,24,5,34,28,10,17,22))
 
Transitive group: 36T29121 36T29154 more information
Copy content magma:G := TransitiveGroup(36, 29121);
 
Copy content gap:G := TransitiveGroup(36, 29121);
 
Copy content sage:G = TransitiveGroup(36, 29121)
 
Copy content sage_gap:G = libgap.TransitiveGroup(36, 29121)
 
Copy content oscar:G = transitive_group(36, 29121)
 
Copy content magma:G := TransitiveGroup(36, 29154);
 
Copy content gap:G := TransitiveGroup(36, 29154);
 
Copy content sage:G = TransitiveGroup(36, 29154)
 
Copy content sage_gap:G = libgap.TransitiveGroup(36, 29154)
 
Copy content oscar:G = transitive_group(36, 29154)
 
Direct product: not computed
Semidirect product: $C_9^4$ $\,\rtimes\,$ $(C_2\wr C_2^2)$ more information
Trans. wreath product: $D_9$ $\ \wr\ $$C_2^2$
Possibly split product: $(C_9:D_9^3)$ . $D_4$ (3) $(D_9^2\wr C_2)$ . $C_2$ (3) $(C_9:D_9^3)$ . $C_2^3$ $C_3^4$ . $(S_3\wr C_2^2)$ all 12

Elements of the group are displayed as words in the presentation generators from the presentation above.

Homology

Abelianization: $C_{2}^{3} $
Copy content comment:The abelianization of the group
 
Copy content magma:quo< G | CommutatorSubgroup(G) >;
 
Copy content gap:FactorGroup(G, DerivedSubgroup(G));
 
Copy content sage:G.quotient(G.commutator())
 
Copy content sage_gap:G.FactorGroup(G.DerivedSubgroup())
 
Copy content oscar:quo(G, derived_subgroup(G)[1])
 
Schur multiplier: not computed
Copy content comment:The Schur multiplier of the group
 
Copy content gap:AbelianInvariantsMultiplier(G);
 
Copy content sage:G.homology(2)
 
Copy content sage_gap:G.AbelianInvariantsMultiplier()
 
Commutator length: $1$
Copy content comment:The commutator length of the group
 
Copy content gap:CommutatorLength(G);
 
Copy content sage_gap:G.CommutatorLength()
 

Subgroups

Copy content comment:List of subgroups of the group
 
Copy content magma:Subgroups(G);
 
Copy content gap:AllSubgroups(G);
 
Copy content sage:G.subgroups()
 
Copy content sage_gap:G.AllSubgroups()
 
Copy content oscar:subgroups(G)
 

There are 29 normal subgroups (8 characteristic).

Characteristic subgroups are shown in this color. Normal (but not characteristic) subgroups are shown in this color.

Special subgroups

Center: a subgroup isomorphic to $C_1$
Copy content comment:Center of the group
 
Copy content magma:Center(G);
 
Copy content gap:Center(G);
 
Copy content sage:G.center()
 
Copy content sage_gap:G.Center()
 
Copy content oscar:center(G)
 
Commutator: a subgroup isomorphic to $C_9:D_9^3$
Copy content comment:Commutator subgroup of the group G
 
Copy content magma:CommutatorSubgroup(G);
 
Copy content gap:DerivedSubgroup(G);
 
Copy content sage:G.commutator()
 
Copy content sage_gap:G.DerivedSubgroup()
 
Copy content oscar:derived_subgroup(G)
 
Frattini: a subgroup isomorphic to $C_3^4$
Copy content comment:Frattini subgroup of the group G
 
Copy content magma:FrattiniSubgroup(G);
 
Copy content gap:FrattiniSubgroup(G);
 
Copy content sage:G.frattini_subgroup()
 
Copy content sage_gap:G.FrattiniSubgroup()
 
Copy content oscar:frattini_subgroup(G)
 
Fitting: not computed
Copy content comment:Fitting subgroup of the group G
 
Copy content magma:FittingSubgroup(G);
 
Copy content gap:FittingSubgroup(G);
 
Copy content sage:G.fitting_subgroup()
 
Copy content sage_gap:G.FittingSubgroup()
 
Copy content oscar:fitting_subgroup(G)
 
Radical: not computed
Copy content comment:Radical of the group G
 
Copy content magma:Radical(G);
 
Copy content gap:SolvableRadical(G);
 
Copy content sage_gap:G.SolvableRadical()
 
Copy content oscar:solvable_radical(G)
 
Socle: not computed
Copy content comment:Socle of the group G
 
Copy content magma:Socle(G);
 
Copy content gap:Socle(G);
 
Copy content sage:G.socle()
 
Copy content sage_gap:G.Socle()
 
Copy content oscar:socle(G)
 
3-Sylow subgroup: $P_{ 3 } \simeq$ $C_9^4$

Subgroup diagram and profile

Series

Derived series not computed
Copy content comment:Derived series of the group G
 
Copy content magma:DerivedSeries(G);
 
Copy content gap:DerivedSeriesOfGroup(G);
 
Copy content sage:G.derived_series()
 
Copy content sage_gap:G.DerivedSeriesOfGroup()
 
Copy content oscar:derived_series(G)
 
Chief series not computed
Copy content comment:Chief series of the group G
 
Copy content magma:ChiefSeries(G);
 
Copy content gap:ChiefSeries(G);
 
Copy content sage:libgap(G).ChiefSeries()
 
Copy content sage_gap:G.ChiefSeries()
 
Copy content oscar:chief_series(G)
 
Lower central series not computed
Copy content comment:The lower central series of the group G
 
Copy content magma:LowerCentralSeries(G);
 
Copy content gap:LowerCentralSeriesOfGroup(G);
 
Copy content sage:G.lower_central_series()
 
Copy content sage_gap:G.LowerCentralSeriesOfGroup()
 
Copy content oscar:lower_central_series(G)
 
Upper central series not computed
Copy content comment:The upper central series of the group G
 
Copy content magma:UpperCentralSeries(G);
 
Copy content gap:UpperCentralSeriesOfGroup(G);
 
Copy content sage:G.upper_central_series()
 
Copy content sage_gap:G.UpperCentralSeriesOfGroup()
 
Copy content oscar:upper_central_series(G)
 

Supergroups

This group is a maximal subgroup of 7 larger groups in the database.

This group is a maximal quotient of 0 larger groups in the database.

Character theory

Copy content comment:Character table
 
Copy content magma:CharacterTable(G); // Output not guaranteed to exactly match the LMFDB table
 
Copy content gap:CharacterTable(G); # Output not guaranteed to exactly match the LMFDB table
 
Copy content sage:G.character_table() # Output not guaranteed to exactly match the LMFDB table
 
Copy content sage_gap:G.CharacterTable() # Output not guaranteed to exactly match the LMFDB table
 
Copy content oscar:character_table(G) # Output not guaranteed to exactly match the LMFDB table
 

Complex character table

See the $414 \times 414$ character table (warning: may be slow to load). Alternatively, you may search for characters of this group with desired properties.

Rational character table

See the $168 \times 168$ rational character table (warning: may be slow to load).