Properties

Label 5668704.il
Order \( 2^{5} \cdot 3^{11} \)
Exponent \( 2^{2} \cdot 3^{2} \)
Nilpotent no
Solvable yes
$\card{G^{\mathrm{ab}}}$ \( 2^{3} \)
$\card{Z(G)}$ \( 1 \)
$\card{\Aut(G)}$ \( 2^{5} \cdot 3^{13} \)
$\card{\mathrm{Out}(G)}$ \( 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,35,33,29,26,23,19,17,13,11,9,6,3,36,32,30,27,22,20,18,14,12,8,5,2,34,31,28,25,24,21,16,15,10,7,4), (1,28,33,36)(2,29,32,35)(3,30,31,34)(4,8,23,27)(5,9,22,25)(6,7,24,26)(10,13,17,21)(11,14,16,20)(12,15,18,19), (1,18,2,16)(3,17)(4,26,30,15,5,25,28,13,6,27,29,14)(7,12,33,22,9,11,31,24,8,10,32,23)(19,36)(20,35,21,34) >;
 
Copy content gap:G := Group( (1,35,33,29,26,23,19,17,13,11,9,6,3,36,32,30,27,22,20,18,14,12,8,5,2,34,31,28,25,24,21,16,15,10,7,4), (1,28,33,36)(2,29,32,35)(3,30,31,34)(4,8,23,27)(5,9,22,25)(6,7,24,26)(10,13,17,21)(11,14,16,20)(12,15,18,19), (1,18,2,16)(3,17)(4,26,30,15,5,25,28,13,6,27,29,14)(7,12,33,22,9,11,31,24,8,10,32,23)(19,36)(20,35,21,34) );
 
Copy content sage:G = PermutationGroup(['(1,35,33,29,26,23,19,17,13,11,9,6,3,36,32,30,27,22,20,18,14,12,8,5,2,34,31,28,25,24,21,16,15,10,7,4)', '(1,28,33,36)(2,29,32,35)(3,30,31,34)(4,8,23,27)(5,9,22,25)(6,7,24,26)(10,13,17,21)(11,14,16,20)(12,15,18,19)', '(1,18,2,16)(3,17)(4,26,30,15,5,25,28,13,6,27,29,14)(7,12,33,22,9,11,31,24,8,10,32,23)(19,36)(20,35,21,34)'])
 
Copy content sage_gap:G = gap.new('Group( (1,35,33,29,26,23,19,17,13,11,9,6,3,36,32,30,27,22,20,18,14,12,8,5,2,34,31,28,25,24,21,16,15,10,7,4), (1,28,33,36)(2,29,32,35)(3,30,31,34)(4,8,23,27)(5,9,22,25)(6,7,24,26)(10,13,17,21)(11,14,16,20)(12,15,18,19), (1,18,2,16)(3,17)(4,26,30,15,5,25,28,13,6,27,29,14)(7,12,33,22,9,11,31,24,8,10,32,23)(19,36)(20,35,21,34) )')
 
Copy content oscar:G = @permutation_group(36, (1,35,33,29,26,23,19,17,13,11,9,6,3,36,32,30,27,22,20,18,14,12,8,5,2,34,31,28,25,24,21,16,15,10,7,4), (1,28,33,36)(2,29,32,35)(3,30,31,34)(4,8,23,27)(5,9,22,25)(6,7,24,26)(10,13,17,21)(11,14,16,20)(12,15,18,19), (1,18,2,16)(3,17)(4,26,30,15,5,25,28,13,6,27,29,14)(7,12,33,22,9,11,31,24,8,10,32,23)(19,36)(20,35,21,34))
 

Group information

Description:$C_3^7.S_3^2\wr C_2$
Order: \(5668704\)\(\medspace = 2^{5} \cdot 3^{11} \)
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:$C_3^6.C_3^5.C_6^2.C_2^3$, of order \(51018336\)\(\medspace = 2^{5} \cdot 3^{13} \)
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 5, $C_3$ x 11
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:$4$
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 21411 19682 393660 1454814 157464 1259712 1889568 472392 5668704
Conjugacy classes   1 10 177 3 379 77 6 127 3 783
Divisions 1 10 132 3 271 50 6 81 1 555
Autjugacy classes 1 10 83 3 205 47 4 87 1 441

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 24 not computed not computed
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}=c^{18}=d^{18}=e^{6}=f^{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([16, 2, 2, 3, 2, 3, 3, 2, 3, 3, 2, 3, 3, 3, 3, 3, 3, 68779392, 80812353, 81, 180286082, 299401347, 1329043, 1379, 179, 264003844, 4820, 3396, 308, 24012293, 6933, 239070726, 45855958, 12053702, 39080214, 20576374, 326, 140353543, 88639511, 14736423, 23593015, 16798535, 503, 292263560, 186648, 31160, 347431689, 66251545, 53343401, 61430457, 4225033, 4518809, 3343785, 1375321, 473, 689762314, 2052890, 342202, 38122, 88826, 510603275, 746523, 124475, 387179, 3579, 53374476, 14556700, 77635644, 43670092, 7644, 1160054797, 29611037, 4935229, 40429, 238013, 57853454, 83980830, 27993662, 18895758, 77918, 7962639, 483729439, 13436991, 14929999, 248991]); a,b,c,d,e,f,g,h,i,j := Explode([G.1, G.2, G.4, G.7, G.10, G.12, G.13, G.14, G.15, G.16]); AssignNames(~G, ["a", "b", "b2", "c", "c2", "c6", "d", "d2", "d6", "e", "e2", "f", "g", "h", "i", "j"]);
 
Copy content gap:G := PcGroupCode(868846089776812338108168209013686865688156052928742793759529226471438826581920640963197207012510466500632920334187792248054770284822991059798440247121229419574707308326977220519775899676157744648130159524835824091109694993280517072876710063941767252471447854065350497225431891875686596678666736801034866863973626884479258062213984836882936695772045005921444650223651815242594306038292073290815088877722636172534014968958432303747905863419106597612970859138808563586413499167560162872158732670414271,5668704); a := G.1; b := G.2; c := G.4; d := G.7; e := G.10; f := G.12; g := G.13; h := G.14; i := G.15; j := G.16;
 
Copy content sage:# This uses Sage's interface to GAP, as Sage (currently) has no native support for PC groups G = gap.new('PcGroupCode(868846089776812338108168209013686865688156052928742793759529226471438826581920640963197207012510466500632920334187792248054770284822991059798440247121229419574707308326977220519775899676157744648130159524835824091109694993280517072876710063941767252471447854065350497225431891875686596678666736801034866863973626884479258062213984836882936695772045005921444650223651815242594306038292073290815088877722636172534014968958432303747905863419106597612970859138808563586413499167560162872158732670414271,5668704)'); a = G.1; b = G.2; c = G.4; d = G.7; e = G.10; f = G.12; g = G.13; h = G.14; i = G.15; j = G.16;
 
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(868846089776812338108168209013686865688156052928742793759529226471438826581920640963197207012510466500632920334187792248054770284822991059798440247121229419574707308326977220519775899676157744648130159524835824091109694993280517072876710063941767252471447854065350497225431891875686596678666736801034866863973626884479258062213984836882936695772045005921444650223651815242594306038292073290815088877722636172534014968958432303747905863419106597612970859138808563586413499167560162872158732670414271,5668704)'); a = G.1; b = G.2; c = G.4; d = G.7; e = G.10; f = G.12; g = G.13; h = G.14; i = G.15; j = G.16;
 
Permutation group:Degree $36$ $\langle(1,35,33,29,26,23,19,17,13,11,9,6,3,36,32,30,27,22,20,18,14,12,8,5,2,34,31,28,25,24,21,16,15,10,7,4) \!\cdots\! \rangle$ Copy content Toggle raw display
Copy content comment:Define the group as a permutation group
 
Copy content magma:G := PermutationGroup< 36 | (1,35,33,29,26,23,19,17,13,11,9,6,3,36,32,30,27,22,20,18,14,12,8,5,2,34,31,28,25,24,21,16,15,10,7,4), (1,28,33,36)(2,29,32,35)(3,30,31,34)(4,8,23,27)(5,9,22,25)(6,7,24,26)(10,13,17,21)(11,14,16,20)(12,15,18,19), (1,18,2,16)(3,17)(4,26,30,15,5,25,28,13,6,27,29,14)(7,12,33,22,9,11,31,24,8,10,32,23)(19,36)(20,35,21,34) >;
 
Copy content gap:G := Group( (1,35,33,29,26,23,19,17,13,11,9,6,3,36,32,30,27,22,20,18,14,12,8,5,2,34,31,28,25,24,21,16,15,10,7,4), (1,28,33,36)(2,29,32,35)(3,30,31,34)(4,8,23,27)(5,9,22,25)(6,7,24,26)(10,13,17,21)(11,14,16,20)(12,15,18,19), (1,18,2,16)(3,17)(4,26,30,15,5,25,28,13,6,27,29,14)(7,12,33,22,9,11,31,24,8,10,32,23)(19,36)(20,35,21,34) );
 
Copy content sage:G = PermutationGroup(['(1,35,33,29,26,23,19,17,13,11,9,6,3,36,32,30,27,22,20,18,14,12,8,5,2,34,31,28,25,24,21,16,15,10,7,4)', '(1,28,33,36)(2,29,32,35)(3,30,31,34)(4,8,23,27)(5,9,22,25)(6,7,24,26)(10,13,17,21)(11,14,16,20)(12,15,18,19)', '(1,18,2,16)(3,17)(4,26,30,15,5,25,28,13,6,27,29,14)(7,12,33,22,9,11,31,24,8,10,32,23)(19,36)(20,35,21,34)'])
 
Copy content sage_gap:G = gap.new('Group( (1,35,33,29,26,23,19,17,13,11,9,6,3,36,32,30,27,22,20,18,14,12,8,5,2,34,31,28,25,24,21,16,15,10,7,4), (1,28,33,36)(2,29,32,35)(3,30,31,34)(4,8,23,27)(5,9,22,25)(6,7,24,26)(10,13,17,21)(11,14,16,20)(12,15,18,19), (1,18,2,16)(3,17)(4,26,30,15,5,25,28,13,6,27,29,14)(7,12,33,22,9,11,31,24,8,10,32,23)(19,36)(20,35,21,34) )')
 
Copy content oscar:G = @permutation_group(36, (1,35,33,29,26,23,19,17,13,11,9,6,3,36,32,30,27,22,20,18,14,12,8,5,2,34,31,28,25,24,21,16,15,10,7,4), (1,28,33,36)(2,29,32,35)(3,30,31,34)(4,8,23,27)(5,9,22,25)(6,7,24,26)(10,13,17,21)(11,14,16,20)(12,15,18,19), (1,18,2,16)(3,17)(4,26,30,15,5,25,28,13,6,27,29,14)(7,12,33,22,9,11,31,24,8,10,32,23)(19,36)(20,35,21,34))
 
Transitive group: 36T54903 more information
Copy content magma:G := TransitiveGroup(36, 54903);
 
Copy content gap:G := TransitiveGroup(36, 54903);
 
Copy content sage:G = TransitiveGroup(36, 54903)
 
Copy content sage_gap:G = libgap.TransitiveGroup(36, 54903)
 
Copy content oscar:G = transitive_group(36, 54903)
 
Direct product: not isomorphic to a non-trivial direct product
Semidirect product: not computed
Trans. wreath product: not isomorphic to a non-trivial transitive wreath product
Possibly split product: $C_3^6$ . $(S_3^4:S_3)$ $(C_3^7.S_3^3)$ . $D_6$ (3) $C_3^8$ . $(D_6^2:S_3)$ $C_3^9$ . $(D_6\wr C_2)$ (2) all 39

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

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: $C_{2}^{4}$
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 65 normal subgroups, 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^7.S_3^2\wr C_2$
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_3^5.C_2^2$ $G/G' \simeq$ $C_2^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: $\Phi \simeq$ $C_3^6$ $G/\Phi \simeq$ $S_3^4:S_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^9.C_3^2$ $G/\operatorname{Fit} \simeq$ $C_2^2\wr C_2$
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^7.S_3^2\wr C_2$ $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^4$ $G/\operatorname{soc} \simeq$ $C_3^5:D_6\wr C_2$
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\wr C_2$
3-Sylow subgroup: $P_{ 3 } \simeq$ $C_3^9.C_3^2$

Subgroup diagram and profile

Series

Derived series $C_3^7.S_3^2\wr C_2$ $\rhd$ $C_3^6.C_3^5.C_2^2$ $\rhd$ $C_3^8.C_3^2$ $\rhd$ $C_3^4$ $\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^7.S_3^2\wr C_2$ $\rhd$ $C_3^7.C_3^4.C_2^4$ $\rhd$ $C_3^7.C_3^4.C_2^3$ $\rhd$ $C_3^6.C_3^5.C_2^2$ $\rhd$ $C_3^8.C_3^3.C_2$ $\rhd$ $C_3^9.C_3^2$ $\rhd$ $C_3^8.C_3^2$ $\rhd$ $C_3^6.C_3^2$ $\rhd$ $C_3^6$ $\rhd$ $C_3^4$ $\rhd$ $C_3^2$ $\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^7.S_3^2\wr C_2$ $\rhd$ $C_3^6.C_3^5.C_2^2$ $\rhd$ $C_3^9.C_3^2$
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 2 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

The $783 \times 783$ character table is not available for this group.

Rational character table

The $555 \times 555$ rational character table is not available for this group.