Properties

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

Related objects

Downloads

Learn more

Show commands: Gap / Magma / Oscar / SageMath

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

Group information

Description:$C_3^6:(A_4\times \GL(2,3))$
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: \(72\)\(\medspace = 2^{3} \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:$C_3^6.(S_4\times \GL(2,3))$, of order \(839808\)\(\medspace = 2^{7} \cdot 3^{8} \)
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:$5$
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 8 9 12 18 24
Elements 1 2295 12392 17496 154440 34992 46656 34992 46656 69984 419904
Conjugacy classes   1 5 14 2 28 4 6 2 2 4 68
Divisions 1 5 12 2 25 2 3 1 1 1 53
Autjugacy classes 1 5 12 2 21 4 3 1 1 2 52

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 3 4 6 8 9 12 24 32 48 64 96 128 144 192 288 384
Irr. complex chars.   6 9 8 3 3 0 2 1 8 6 8 3 2 0 4 3 2 0 68
Irr. rational chars. 2 3 4 3 3 2 2 2 8 2 8 3 2 1 4 1 2 1 53

Minimal presentations

Permutation degree:$27$
Transitive degree:$27$
Rank: $2$
Inequivalent generating pairs: not computed

Minimal degrees of faithful linear representations

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

Constructions

Show commands: Gap / Magma / Oscar / SageMath


Presentation: ${\langle a, b, c, d, e, f, g, h, i, j \mid b^{6}=d^{4}=e^{6}=f^{3}=g^{3}= \!\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, 3, 2, 3, 2, 2, 2, 2, 3, 3, 3, 3, 3, 3, 28, 2124375, 1783154, 5720038, 114, 12494499, 1581905, 14358964, 6215598, 3416312, 1364836, 724980, 20771861, 4218499, 1374441, 1231067, 380917, 243, 10174758, 14457764, 1949842, 692712, 1140390, 2437351, 20225541, 983843, 997297, 210623, 107149, 1211, 329, 5878664, 5225494, 1415268, 1427378, 473824, 237966, 1100, 18869769, 16087703, 477185, 161359, 3453, 1787, 33086602, 29981976, 2055014, 990580, 726946, 600064, 11182, 58320, 27482123, 17273113, 3015975, 1201589, 502723, 323985, 36383, 30349, 15095820, 12370202, 2830504, 1537604, 698962, 118032, 74172685, 35280027, 10762793, 2972983, 1097669, 341907, 381121, 97719]); a,b,c,d,e,f,g,h,i,j := Explode([G.1, G.3, G.5, G.6, G.8, G.10, G.11, G.12, G.13, G.14]); AssignNames(~G, ["a", "a2", "b", "b2", "c", "d", "d2", "e", "e2", "f", "g", "h", "i", "j"]);
 
Copy content gap:G := PcGroupCode(16634343538628804898377643684299501664308831061678981136762011214353329198060814518086901252843556166310931951615246890373176266117167890759980476403180942723423856534373480574619541382137949080828749785535122857838276716058106763935235712750869985510704643089129638208385303929622138159267470429302682844254126986476340016941932097409166280099881339606844489621260594931327305992328467119297622332948050634506281344029818676482226482129480629212223,419904); a := G.1; b := G.3; c := G.5; d := G.6; e := G.8; f := G.10; g := G.11; h := G.12; i := G.13; j := G.14;
 
Copy content sage:# This uses Sage's interface to GAP, as Sage (currently) has no native support for PC groups G = gap.new('PcGroupCode(16634343538628804898377643684299501664308831061678981136762011214353329198060814518086901252843556166310931951615246890373176266117167890759980476403180942723423856534373480574619541382137949080828749785535122857838276716058106763935235712750869985510704643089129638208385303929622138159267470429302682844254126986476340016941932097409166280099881339606844489621260594931327305992328467119297622332948050634506281344029818676482226482129480629212223,419904)'); a = G.1; b = G.3; c = G.5; d = G.6; e = G.8; f = G.10; g = G.11; h = G.12; i = G.13; j = G.14;
 
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(16634343538628804898377643684299501664308831061678981136762011214353329198060814518086901252843556166310931951615246890373176266117167890759980476403180942723423856534373480574619541382137949080828749785535122857838276716058106763935235712750869985510704643089129638208385303929622138159267470429302682844254126986476340016941932097409166280099881339606844489621260594931327305992328467119297622332948050634506281344029818676482226482129480629212223,419904)'); a = G.1; b = G.3; c = G.5; d = G.6; e = G.8; f = G.10; g = G.11; h = G.12; i = G.13; j = G.14;
 
Permutation group:Degree $27$ $\langle(1,7,8,4,6,9,2,3)(10,15,11,14,13,17,12,18)(20,23,21,25,27,24,26,22), (1,24,14,4,23,18,3,26,17,8,25,11,9,27,10,6,22,12,7,19,16,5,20,13)(2,21,15)\rangle$ Copy content Toggle raw display
Copy content comment:Define the group as a permutation group
 
Copy content magma:G := PermutationGroup< 27 | (1,7,8,4,6,9,2,3)(10,15,11,14,13,17,12,18)(20,23,21,25,27,24,26,22), (1,24,14,4,23,18,3,26,17,8,25,11,9,27,10,6,22,12,7,19,16,5,20,13)(2,21,15) >;
 
Copy content gap:G := Group( (1,7,8,4,6,9,2,3)(10,15,11,14,13,17,12,18)(20,23,21,25,27,24,26,22), (1,24,14,4,23,18,3,26,17,8,25,11,9,27,10,6,22,12,7,19,16,5,20,13)(2,21,15) );
 
Copy content sage:G = PermutationGroup(['(1,7,8,4,6,9,2,3)(10,15,11,14,13,17,12,18)(20,23,21,25,27,24,26,22)', '(1,24,14,4,23,18,3,26,17,8,25,11,9,27,10,6,22,12,7,19,16,5,20,13)(2,21,15)'])
 
Copy content sage_gap:G = gap.new('Group( (1,7,8,4,6,9,2,3)(10,15,11,14,13,17,12,18)(20,23,21,25,27,24,26,22), (1,24,14,4,23,18,3,26,17,8,25,11,9,27,10,6,22,12,7,19,16,5,20,13)(2,21,15) )')
 
Copy content oscar:G = @permutation_group(27, (1,7,8,4,6,9,2,3)(10,15,11,14,13,17,12,18)(20,23,21,25,27,24,26,22), (1,24,14,4,23,18,3,26,17,8,25,11,9,27,10,6,22,12,7,19,16,5,20,13)(2,21,15))
 
Transitive group: 27T1614 36T28795 36T29451 more information
Copy content magma:G := TransitiveGroup(27, 1614);
 
Copy content gap:G := TransitiveGroup(27, 1614);
 
Copy content sage:G = TransitiveGroup(27, 1614)
 
Copy content sage_gap:G = libgap.TransitiveGroup(27, 1614)
 
Copy content oscar:G = transitive_group(27, 1614)
 
Copy content magma:G := TransitiveGroup(36, 28795);
 
Copy content gap:G := TransitiveGroup(36, 28795);
 
Copy content sage:G = TransitiveGroup(36, 28795)
 
Copy content sage_gap:G = libgap.TransitiveGroup(36, 28795)
 
Copy content oscar:G = transitive_group(36, 28795)
 
Copy content magma:G := TransitiveGroup(36, 29451);
 
Copy content gap:G := TransitiveGroup(36, 29451);
 
Copy content sage:G = TransitiveGroup(36, 29451)
 
Copy content sage_gap:G = libgap.TransitiveGroup(36, 29451)
 
Copy content oscar:G = transitive_group(36, 29451)
 
Direct product: not isomorphic to a non-trivial direct product
Semidirect product: $(C_3^6.A_4)$ $\,\rtimes\,$ $\GL(2,3)$ $C_3^6$ $\,\rtimes\,$ $(A_4\times \GL(2,3))$ $(C_3^6:(Q_8\times A_4))$ $\,\rtimes\,$ $S_3$ $(C_3^6:Q_8)$ $\,\rtimes\,$ $(S_3\times A_4)$ all 9
Trans. wreath product: not isomorphic to a non-trivial transitive wreath product
Non-split product: $(C_3^5:S_3)$ . $(A_4\times S_4)$ $(C_3^6.(C_2\times A_4))$ . $S_4$ $((C_3:S_3)^3)$ . $(C_3\times S_4)$ more information

Elements of the group are displayed as permutations of degree 27.

Homology

Abelianization: $C_{6} \simeq C_{2} \times C_{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: $C_{2}$
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 6520834 subgroups in 4766 conjugacy classes, 16 normal, and all normal subgroups are characteristic.

Characteristic subgroups are shown in this color.

Special subgroups

Center: $Z \simeq$ $C_1$ $G/Z \simeq$ $C_3^6:(A_4\times \GL(2,3))$
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: $G' \simeq$ $C_3^6:(C_2^2\times \SL(2,3))$ $G/G' \simeq$ $C_6$
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: $\Phi \simeq$ $C_1$ $G/\Phi \simeq$ $C_3^6:(A_4\times \GL(2,3))$
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: $\operatorname{Fit} \simeq$ $C_3^6$ $G/\operatorname{Fit} \simeq$ $A_4\times \GL(2,3)$
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: $R \simeq$ $C_3^6:(A_4\times \GL(2,3))$ $G/R \simeq$ $C_1$
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: $\operatorname{soc} \simeq$ $C_3^6$ $G/\operatorname{soc} \simeq$ $A_4\times \GL(2,3)$
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)
 
2-Sylow subgroup: $P_{ 2 } \simeq$ $C_2^2\times \SD_{16}$
3-Sylow subgroup: $P_{ 3 } \simeq$ $C_3^6:C_3^2$

Subgroup diagram and profile

Series

Derived series $C_3^6:(A_4\times \GL(2,3))$ $\rhd$ $C_3^6:(C_2^2\times \SL(2,3))$ $\rhd$ $C_3^6:Q_8$ $\rhd$ $C_3^5:S_3$ $\rhd$ $C_3^6$ $\rhd$ $C_1$
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 $C_3^6:(A_4\times \GL(2,3))$ $\rhd$ $C_3^6:(A_4\times \SL(2,3))$ $\rhd$ $C_3^6:(C_2^2\times \SL(2,3))$ $\rhd$ $C_3^6.Q_8.C_3$ $\rhd$ $C_3^6:Q_8$ $\rhd$ $C_3^5:S_3$ $\rhd$ $C_3^6$ $\rhd$ $C_1$
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 $C_3^6:(A_4\times \GL(2,3))$ $\rhd$ $C_3^6:(C_2^2\times \SL(2,3))$
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 $C_1$
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 3 larger groups in the database.

This group is a maximal quotient of 2 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 $68 \times 68$ character table. Alternatively, you may search for characters of this group with desired properties.

Rational character table

See the $53 \times 53$ rational character table.