Properties

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

Group information

Description:$C_9^4.(C_6\times S_4)$
Order: \(944784\)\(\medspace = 2^{4} \cdot 3^{10} \)
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: \(108\)\(\medspace = 2^{2} \cdot 3^{3} \)
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_9^3.(C_9\times A_4).C_6^2.C_2$, of order \(5668704\)\(\medspace = 2^{5} \cdot 3^{11} \)
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 4, $C_3$ x 10
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 27 36
Elements 1 11475 6074 8748 222534 66096 69984 297432 104976 157464 944784
Conjugacy classes   1 5 14 2 28 114 6 107 15 6 298
Divisions 1 5 12 2 22 102 4 92 12 4 256
Autjugacy classes 1 5 13 2 26 61 6 61 7 6 188

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 12 16 18 24 32 36 48 72 96 144
Irr. complex chars.   12 12 12 3 20 18 28 9 6 28 0 25 20 86 0 19 298
Irr. rational chars. 4 8 4 5 12 7 16 9 6 33 3 25 16 86 3 19 256

Minimal presentations

Permutation degree:$36$
Transitive degree:$36$
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 \mid b^{6}=c^{18}=d^{18}=e^{9}=f^{9}=[c,f]=[e,f]= \!\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, 3, 3, 2, 3, 3, 3, 3, 3, 3, 28, 9232287, 10594334, 13870474, 114, 24840483, 6613841, 54495004, 10494558, 3779612, 4277326, 200, 29435621, 13239091, 9805857, 4463975, 327, 7090, 12555655, 18760917, 562499, 4387873, 143199, 980861, 329, 326600, 326614, 2204532, 1714658, 36352, 498, 1088649, 7348357, 4490691, 30305, 28740106, 4490664, 21488582, 9463660, 2644554, 22284, 612, 58786571, 5878681, 10886439, 4517909, 3265987, 18253, 40334124, 47764106, 4953352, 157302, 235982, 726, 130310221, 61725915, 12573833, 127063, 190623]); a,b,c,d,e,f := Explode([G.1, G.3, G.5, G.8, G.11, G.13]); AssignNames(~G, ["a", "a2", "b", "b2", "c", "c2", "c6", "d", "d2", "d6", "e", "e3", "f", "f3"]);
 
Copy content gap:G := PcGroupCode(12326180360578287561359154492968287247286310211767997658938556199847372207925076898773201769118724800122050930733823168072819868795927856723787082372077933626266287071924896559880782439319565996137190197577851629150922625056211384889553159971675261979831176138055463221976228027707412205476707972337721947779242843455145044458209919427572517051183340014927227549427351885188688631231,944784); a := G.1; b := G.3; c := G.5; d := G.8; e := G.11; f := 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(12326180360578287561359154492968287247286310211767997658938556199847372207925076898773201769118724800122050930733823168072819868795927856723787082372077933626266287071924896559880782439319565996137190197577851629150922625056211384889553159971675261979831176138055463221976228027707412205476707972337721947779242843455145044458209919427572517051183340014927227549427351885188688631231,944784)'); a = G.1; b = G.3; c = G.5; d = G.8; e = G.11; f = 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(12326180360578287561359154492968287247286310211767997658938556199847372207925076898773201769118724800122050930733823168072819868795927856723787082372077933626266287071924896559880782439319565996137190197577851629150922625056211384889553159971675261979831176138055463221976228027707412205476707972337721947779242843455145044458209919427572517051183340014927227549427351885188688631231,944784)'); a = G.1; b = G.3; c = G.5; d = G.8; e = G.11; f = G.13;
 
Permutation group:Degree $36$ $\langle(1,22,32)(2,24,31,3,23,33)(4,5)(7,27,35,21,13,11)(8,25,34,19,15,10)(9,26,36,20,14,12) \!\cdots\! \rangle$ Copy content Toggle raw display
Copy content comment:Define the group as a permutation group
 
Copy content magma:G := PermutationGroup< 36 | (1,22,32)(2,24,31,3,23,33)(4,5)(7,27,35,21,13,11)(8,25,34,19,15,10)(9,26,36,20,14,12)(16,28)(17,29)(18,30), (1,29,12,20,26,17,35,8,14,5,23,32,3,28,11,21,27,18,36,7,15,4,22,33,2,30,10,19,25,16,34,9,13,6,24,31) >;
 
Copy content gap:G := Group( (1,22,32)(2,24,31,3,23,33)(4,5)(7,27,35,21,13,11)(8,25,34,19,15,10)(9,26,36,20,14,12)(16,28)(17,29)(18,30), (1,29,12,20,26,17,35,8,14,5,23,32,3,28,11,21,27,18,36,7,15,4,22,33,2,30,10,19,25,16,34,9,13,6,24,31) );
 
Copy content sage:G = PermutationGroup(['(1,22,32)(2,24,31,3,23,33)(4,5)(7,27,35,21,13,11)(8,25,34,19,15,10)(9,26,36,20,14,12)(16,28)(17,29)(18,30)', '(1,29,12,20,26,17,35,8,14,5,23,32,3,28,11,21,27,18,36,7,15,4,22,33,2,30,10,19,25,16,34,9,13,6,24,31)'])
 
Copy content sage_gap:G = gap.new('Group( (1,22,32)(2,24,31,3,23,33)(4,5)(7,27,35,21,13,11)(8,25,34,19,15,10)(9,26,36,20,14,12)(16,28)(17,29)(18,30), (1,29,12,20,26,17,35,8,14,5,23,32,3,28,11,21,27,18,36,7,15,4,22,33,2,30,10,19,25,16,34,9,13,6,24,31) )')
 
Copy content oscar:G = @permutation_group(36, (1,22,32)(2,24,31,3,23,33)(4,5)(7,27,35,21,13,11)(8,25,34,19,15,10)(9,26,36,20,14,12)(16,28)(17,29)(18,30), (1,29,12,20,26,17,35,8,14,5,23,32,3,28,11,21,27,18,36,7,15,4,22,33,2,30,10,19,25,16,34,9,13,6,24,31))
 
Transitive group: 36T36473 more information
Copy content magma:G := TransitiveGroup(36, 36473);
 
Copy content gap:G := TransitiveGroup(36, 36473);
 
Copy content sage:G = TransitiveGroup(36, 36473)
 
Copy content sage_gap:G = libgap.TransitiveGroup(36, 36473)
 
Copy content oscar:G = transitive_group(36, 36473)
 
Direct product: not computed
Semidirect product: not computed
Trans. wreath product: not isomorphic to a non-trivial transitive wreath product
Possibly split product: $(C_9\wr S_4)$ . $C_6$ $(C_9^4:S_4)$ . $C_6$ $(C_9^4.C_6)$ . $S_4$ $C_9^4$ . $(C_6\times S_4)$ all 36

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

Homology

Abelianization: $C_{2} \times C_{6} \simeq C_{2}^{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}^{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 38 normal subgroups, and all normal subgroups are characteristic.

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\wr A_4$
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.C_3^2$

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 3 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 $298 \times 298$ 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 $256 \times 256$ rational character table (warning: may be slow to load).