Properties

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

Group information

Description:$C_3^6.S_3^4:S_3$
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^8.C_3^4.C_6^2.C_2^5$, of order \(612220032\)\(\medspace = 2^{7} \cdot 3^{14} \)
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:$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
Elements 1 81315 72170 813564 2339694 104976 1312200 944784 5668704
Conjugacy classes   1 10 860 3 657 12 17 33 1593
Divisions 1 10 859 3 643 7 17 17 1557
Autjugacy classes 1 9 72 3 112 6 5 12 220

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, k, l \mid b^{6}=c^{6}=d^{6}=e^{6}= \!\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, 2, 3, 2, 3, 3, 3, 3, 3, 3, 3, 3, 55549440, 36406977, 81, 153322370, 46576515, 43473811, 23201507, 179, 69124, 7700, 3396, 471203141, 202151829, 54122725, 11225717, 277, 149313030, 16150, 595456519, 92924951, 44167719, 1764919, 169815, 375, 3464, 55862808, 27900328, 20792, 3544, 530703369, 15344665, 1969961, 69177, 11609, 2041, 1529098, 326633498, 116062890, 861754, 38106, 23354, 635682827, 17915931, 7838251, 746555, 124507, 20859, 1147461132, 14556700, 2426172, 404444, 67516, 34513933, 440100893, 169779501, 19192381, 1306461, 134525, 288720014, 14826270, 87194926, 25194302, 4199134, 390366, 401092623, 96989215, 155437103, 56365119, 13437023, 1230463]); a,b,c,d,e,f,g,h,i,j,k,l := Explode([G.1, G.2, G.4, G.6, G.8, G.10, G.11, G.12, G.13, G.14, G.15, G.16]); AssignNames(~G, ["a", "b", "b2", "c", "c2", "d", "d2", "e", "e2", "f", "g", "h", "i", "j", "k", "l"]);
 
Copy content gap:G := PcGroupCode(6030651065619853294650447015658583710334957676522772022662910296208966270471106052347872441904944045879806124745730624628125854934390562882851475528523841279238215995652279499384086261685707714096984122330096258358489133073365038882648215758245275349039830782295887996150321722233082263640687622325709788183662002938266788146140426413448390006353151269589125708626340228644061395214921578989954103689635404800936981383315355529293184529309609872757978111574509980173012225894816963465861189471504613096329256315647,5668704); a := G.1; b := G.2; c := G.4; d := G.6; e := G.8; f := G.10; g := G.11; h := G.12; i := G.13; j := G.14; k := G.15; l := 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(6030651065619853294650447015658583710334957676522772022662910296208966270471106052347872441904944045879806124745730624628125854934390562882851475528523841279238215995652279499384086261685707714096984122330096258358489133073365038882648215758245275349039830782295887996150321722233082263640687622325709788183662002938266788146140426413448390006353151269589125708626340228644061395214921578989954103689635404800936981383315355529293184529309609872757978111574509980173012225894816963465861189471504613096329256315647,5668704)'); a = G.1; b = G.2; c = G.4; d = G.6; e = G.8; f = G.10; g = G.11; h = G.12; i = G.13; j = G.14; k = G.15; l = 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(6030651065619853294650447015658583710334957676522772022662910296208966270471106052347872441904944045879806124745730624628125854934390562882851475528523841279238215995652279499384086261685707714096984122330096258358489133073365038882648215758245275349039830782295887996150321722233082263640687622325709788183662002938266788146140426413448390006353151269589125708626340228644061395214921578989954103689635404800936981383315355529293184529309609872757978111574509980173012225894816963465861189471504613096329256315647,5668704)'); a = G.1; b = G.2; c = G.4; d = G.6; e = G.8; f = G.10; g = G.11; h = G.12; i = G.13; j = G.14; k = G.15; l = G.16;
 
Permutation group:Degree $36$ $\langle(1,8,15,21,25,32)(2,9,14,19,26,31)(3,7,13,20,27,33)(4,29,16,5,30,17)(6,28,18) \!\cdots\! \rangle$ Copy content Toggle raw display
Copy content comment:Define the group as a permutation group
 
Copy content magma:G := PermutationGroup< 36 | (1,8,15,21,25,32)(2,9,14,19,26,31)(3,7,13,20,27,33)(4,29,16,5,30,17)(6,28,18)(10,36,24)(11,34,23,12,35,22), (1,18,19,36,3,17,21,35,2,16,20,34)(4,31,24,13,6,32,23,14,5,33,22,15)(7,11,27,29)(8,10,25,28)(9,12,26,30), (1,35,2,34,3,36)(4,32)(5,33)(6,31)(7,30)(8,28)(9,29)(10,25,11,26,12,27)(13,22,15,24,14,23)(16,20)(17,19)(18,21) >;
 
Copy content gap:G := Group( (1,8,15,21,25,32)(2,9,14,19,26,31)(3,7,13,20,27,33)(4,29,16,5,30,17)(6,28,18)(10,36,24)(11,34,23,12,35,22), (1,18,19,36,3,17,21,35,2,16,20,34)(4,31,24,13,6,32,23,14,5,33,22,15)(7,11,27,29)(8,10,25,28)(9,12,26,30), (1,35,2,34,3,36)(4,32)(5,33)(6,31)(7,30)(8,28)(9,29)(10,25,11,26,12,27)(13,22,15,24,14,23)(16,20)(17,19)(18,21) );
 
Copy content sage:G = PermutationGroup(['(1,8,15,21,25,32)(2,9,14,19,26,31)(3,7,13,20,27,33)(4,29,16,5,30,17)(6,28,18)(10,36,24)(11,34,23,12,35,22)', '(1,18,19,36,3,17,21,35,2,16,20,34)(4,31,24,13,6,32,23,14,5,33,22,15)(7,11,27,29)(8,10,25,28)(9,12,26,30)', '(1,35,2,34,3,36)(4,32)(5,33)(6,31)(7,30)(8,28)(9,29)(10,25,11,26,12,27)(13,22,15,24,14,23)(16,20)(17,19)(18,21)'])
 
Copy content sage_gap:G = gap.new('Group( (1,8,15,21,25,32)(2,9,14,19,26,31)(3,7,13,20,27,33)(4,29,16,5,30,17)(6,28,18)(10,36,24)(11,34,23,12,35,22), (1,18,19,36,3,17,21,35,2,16,20,34)(4,31,24,13,6,32,23,14,5,33,22,15)(7,11,27,29)(8,10,25,28)(9,12,26,30), (1,35,2,34,3,36)(4,32)(5,33)(6,31)(7,30)(8,28)(9,29)(10,25,11,26,12,27)(13,22,15,24,14,23)(16,20)(17,19)(18,21) )')
 
Copy content oscar:G = @permutation_group(36, (1,8,15,21,25,32)(2,9,14,19,26,31)(3,7,13,20,27,33)(4,29,16,5,30,17)(6,28,18)(10,36,24)(11,34,23,12,35,22), (1,18,19,36,3,17,21,35,2,16,20,34)(4,31,24,13,6,32,23,14,5,33,22,15)(7,11,27,29)(8,10,25,28)(9,12,26,30), (1,35,2,34,3,36)(4,32)(5,33)(6,31)(7,30)(8,28)(9,29)(10,25,11,26,12,27)(13,22,15,24,14,23)(16,20)(17,19)(18,21))
 
Transitive group: 36T54681 more information
Copy content magma:G := TransitiveGroup(36, 54681);
 
Copy content gap:G := TransitiveGroup(36, 54681);
 
Copy content sage:G = TransitiveGroup(36, 54681)
 
Copy content sage_gap:G = libgap.TransitiveGroup(36, 54681)
 
Copy content oscar:G = transitive_group(36, 54681)
 
Direct product: not computed
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)$ (2) $(C_3^{10}.C_2^4)$ . $S_3$ all 41

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}^{2} \times C_{6}^{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 69 normal subgroups (65 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: not computed
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^6$
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_3^{10}.C_3$

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 5 larger groups in the database.

This group is a maximal quotient of 1 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 $1593 \times 1593$ character table is not available for this group.

Rational character table

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