Properties

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

Group information

Description:$C_2^5.C_2^8:C_{10}$
Order: \(81920\)\(\medspace = 2^{14} \cdot 5 \)
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: \(20\)\(\medspace = 2^{2} \cdot 5 \)
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^2:C_4\times A_6$, of order \(10485760\)\(\medspace = 2^{21} \cdot 5 \)
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 14, $C_5$
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 4 5 10
Elements 1 543 15840 16384 49152 81920
Conjugacy classes   1 15 180 4 12 212
Divisions 1 15 163 1 3 183
Autjugacy classes 1 11 102 4 8 126

Minimal presentations

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

Minimal degrees of faithful linear representations

Over $\mathbb{C}$ Over $\mathbb{R}$ Over $\mathbb{Q}$
Irreducible 20 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 a^{10}=e^{4}=g^{4}=h^{4}=i^{4}= \!\cdots\! \rangle}$ Copy content Toggle raw display
Copy content comment:Define the group with the given generators and relations
 
Copy content magma:G := PCGroup([15, 2, 5, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 30, 2479052, 21842, 299552, 594003, 246618, 277593, 204048, 3692254, 1614019, 201934, 24199, 124864, 5394605, 1570970, 369395, 6890, 3485, 260, 6988806, 268821, 5438407, 130822, 80677, 279412, 62467, 62002, 2032, 2413808, 952448, 285158, 186893, 23828, 3323, 20363, 398, 6336009, 12024, 4364260, 3539275, 1077160, 191455, 200710, 92485, 2095, 7390, 490, 230411, 3801626, 7289112, 6550077, 998442, 499257, 249672, 124887, 31317, 21972, 2502, 582, 9710413, 2704828, 9540014, 7506029]); a,b,c,d,e,f,g,h,i,j := Explode([G.1, G.3, G.4, G.5, G.6, G.8, G.9, G.11, G.13, G.15]); AssignNames(~G, ["a", "a2", "b", "c", "d", "e", "e2", "f", "g", "g2", "h", "h2", "i", "i2", "j"]);
 
Copy content gap:G := PcGroupCode(60909327879311562684508368362068990722253550607236318676710333444664157145421759616305510524061444485962360513284194785368880751884316197307926641791220259551127627926797501233548567019491627983872813091457099242922876937699019309725439953930912596481885663336707281656200712535966258830276429815531545384591106115046538408295269373457280927566659584,81920); a := G.1; b := G.3; c := G.4; d := G.5; e := G.6; f := G.8; g := G.9; h := G.11; i := G.13; j := G.15;
 
Copy content sage:# This uses Sage's interface to GAP, as Sage (currently) has no native support for PC groups G = gap.new('PcGroupCode(60909327879311562684508368362068990722253550607236318676710333444664157145421759616305510524061444485962360513284194785368880751884316197307926641791220259551127627926797501233548567019491627983872813091457099242922876937699019309725439953930912596481885663336707281656200712535966258830276429815531545384591106115046538408295269373457280927566659584,81920)'); a = G.1; b = G.3; c = G.4; d = G.5; e = G.6; f = G.8; g = G.9; h = G.11; i = G.13; j = G.15;
 
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(60909327879311562684508368362068990722253550607236318676710333444664157145421759616305510524061444485962360513284194785368880751884316197307926641791220259551127627926797501233548567019491627983872813091457099242922876937699019309725439953930912596481885663336707281656200712535966258830276429815531545384591106115046538408295269373457280927566659584,81920)'); a = G.1; b = G.3; c = G.4; d = G.5; e = G.6; f = G.8; g = G.9; h = G.11; i = G.13; j = G.15;
 
Permutation group:Degree $40$ $\langle(1,28,38,17,16,2,27,37,18,15)(3,25,39,19,14,4,26,40,20,13)(5,30,35,22,9,6,29,36,21,10) \!\cdots\! \rangle$ Copy content Toggle raw display
Copy content comment:Define the group as a permutation group
 
Copy content magma:G := PermutationGroup< 40 | (1,28,38,17,16,2,27,37,18,15)(3,25,39,19,14,4,26,40,20,13)(5,30,35,22,9,6,29,36,21,10)(7,31,34,24,11,8,32,33,23,12), (1,24,29,11,34,2,23,30,12,33)(3,22,32,10,35)(4,21,31,9,36)(5,19,27,14,40)(6,20,28,13,39)(7,17,26,15,37,8,18,25,16,38), (1,32,33,18,14,2,31,34,17,13)(3,30,35,20,16)(4,29,36,19,15)(5,25,40,21,11)(6,26,39,22,12)(7,27,38,23,9,8,28,37,24,10) >;
 
Copy content gap:G := Group( (1,28,38,17,16,2,27,37,18,15)(3,25,39,19,14,4,26,40,20,13)(5,30,35,22,9,6,29,36,21,10)(7,31,34,24,11,8,32,33,23,12), (1,24,29,11,34,2,23,30,12,33)(3,22,32,10,35)(4,21,31,9,36)(5,19,27,14,40)(6,20,28,13,39)(7,17,26,15,37,8,18,25,16,38), (1,32,33,18,14,2,31,34,17,13)(3,30,35,20,16)(4,29,36,19,15)(5,25,40,21,11)(6,26,39,22,12)(7,27,38,23,9,8,28,37,24,10) );
 
Copy content sage:G = PermutationGroup(['(1,28,38,17,16,2,27,37,18,15)(3,25,39,19,14,4,26,40,20,13)(5,30,35,22,9,6,29,36,21,10)(7,31,34,24,11,8,32,33,23,12)', '(1,24,29,11,34,2,23,30,12,33)(3,22,32,10,35)(4,21,31,9,36)(5,19,27,14,40)(6,20,28,13,39)(7,17,26,15,37,8,18,25,16,38)', '(1,32,33,18,14,2,31,34,17,13)(3,30,35,20,16)(4,29,36,19,15)(5,25,40,21,11)(6,26,39,22,12)(7,27,38,23,9,8,28,37,24,10)'])
 
Copy content sage_gap:G = gap.new('Group( (1,28,38,17,16,2,27,37,18,15)(3,25,39,19,14,4,26,40,20,13)(5,30,35,22,9,6,29,36,21,10)(7,31,34,24,11,8,32,33,23,12), (1,24,29,11,34,2,23,30,12,33)(3,22,32,10,35)(4,21,31,9,36)(5,19,27,14,40)(6,20,28,13,39)(7,17,26,15,37,8,18,25,16,38), (1,32,33,18,14,2,31,34,17,13)(3,30,35,20,16)(4,29,36,19,15)(5,25,40,21,11)(6,26,39,22,12)(7,27,38,23,9,8,28,37,24,10) )')
 
Copy content oscar:G = @permutation_group(40, (1,28,38,17,16,2,27,37,18,15)(3,25,39,19,14,4,26,40,20,13)(5,30,35,22,9,6,29,36,21,10)(7,31,34,24,11,8,32,33,23,12), (1,24,29,11,34,2,23,30,12,33)(3,22,32,10,35)(4,21,31,9,36)(5,19,27,14,40)(6,20,28,13,39)(7,17,26,15,37,8,18,25,16,38), (1,32,33,18,14,2,31,34,17,13)(3,30,35,20,16)(4,29,36,19,15)(5,25,40,21,11)(6,26,39,22,12)(7,27,38,23,9,8,28,37,24,10))
 
Transitive group: 40T23676 40T25010 40T29480 40T29621 all 6
Copy content magma:G := TransitiveGroup(40, 23676);
 
Copy content gap:G := TransitiveGroup(40, 23676);
 
Copy content sage:G = TransitiveGroup(40, 23676)
 
Copy content sage_gap:G = libgap.TransitiveGroup(40, 23676)
 
Copy content oscar:G = transitive_group(40, 23676)
 
Copy content magma:G := TransitiveGroup(40, 25010);
 
Copy content gap:G := TransitiveGroup(40, 25010);
 
Copy content sage:G = TransitiveGroup(40, 25010)
 
Copy content sage_gap:G = libgap.TransitiveGroup(40, 25010)
 
Copy content oscar:G = transitive_group(40, 25010)
 
Copy content magma:G := TransitiveGroup(40, 29480);
 
Copy content gap:G := TransitiveGroup(40, 29480);
 
Copy content sage:G = TransitiveGroup(40, 29480)
 
Copy content sage_gap:G = libgap.TransitiveGroup(40, 29480)
 
Copy content oscar:G = transitive_group(40, 29480)
 
Copy content magma:G := TransitiveGroup(40, 29621);
 
Copy content gap:G := TransitiveGroup(40, 29621);
 
Copy content sage:G = TransitiveGroup(40, 29621)
 
Copy content sage_gap:G = libgap.TransitiveGroup(40, 29621)
 
Copy content oscar:G = transitive_group(40, 29621)
 
Copy content magma:G := TransitiveGroup(40, 30721);
 
Copy content gap:G := TransitiveGroup(40, 30721);
 
Copy content sage:G = TransitiveGroup(40, 30721)
 
Copy content sage_gap:G = libgap.TransitiveGroup(40, 30721)
 
Copy content oscar:G = transitive_group(40, 30721)
 
Copy content magma:G := TransitiveGroup(40, 39357);
 
Copy content gap:G := TransitiveGroup(40, 39357);
 
Copy content sage:G = TransitiveGroup(40, 39357)
 
Copy content sage_gap:G = libgap.TransitiveGroup(40, 39357)
 
Copy content oscar:G = transitive_group(40, 39357)
 
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_2^6$ . $(C_2^8:C_5)$ $C_2^5$ . $(C_2^8:C_{10})$ $C_4^4$ . $(C_2.C_2\wr C_5)$ $(C_2^5.C_2^8:C_5)$ . $C_2$ all 16

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

Homology

Abelianization: $C_{10} \simeq C_{2} \times C_{5}$
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}^{7}$
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: $2$
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 48 normal subgroups (44 characteristic).

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

Special subgroups

Center: $Z \simeq$ $C_2$ $G/Z \simeq$ $C_2^4.C_2^4.C_2^4.C_{10}$
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_2^5.C_2^6.C_2^2$ $G/G' \simeq$ $C_{10}$
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_2^5$ $G/\Phi \simeq$ $C_2^8:C_{10}$
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_2^6.C_2^6.C_2^2$ $G/\operatorname{Fit} \simeq$ $C_5$
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_2^5.C_2^8:C_{10}$ $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_2^5$ $G/\operatorname{soc} \simeq$ $C_2^8:C_{10}$
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^6.C_2^6.C_2^2$
5-Sylow subgroup: $P_{ 5 } \simeq$ $C_5$

Subgroup diagram and profile

Series

Derived series $C_2^5.C_2^8:C_{10}$ $\rhd$ $C_2^5.C_2^6.C_2^2$ $\rhd$ $C_2^5$ $\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_2^5.C_2^8:C_{10}$ $\rhd$ $C_2^5.C_2^8:C_5$ $\rhd$ $C_2^5.C_2^6.C_2^2$ $\rhd$ $C_2^5.C_2^4$ $\rhd$ $C_2^5$ $\rhd$ $C_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_2^5.C_2^8:C_{10}$ $\rhd$ $C_2^5.C_2^6.C_2^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$ $\lhd$ $C_2$
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 $212 \times 212$ character table is not available for this group.

Rational character table

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