Properties

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

Group information

Description:$C_3^6.C_3\wr C_2^2$
Order: \(236196\)\(\medspace = 2^{2} \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: \(18\)\(\medspace = 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^5.C_3^5.C_6^3.C_2$, of order \(25509168\)\(\medspace = 2^{4} \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 2, $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:$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 supersolvable (hence solvable and monomial).

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 6 9 18
Elements 1 1215 18224 70956 40824 104976 236196
Conjugacy classes   1 3 145 29 198 57 433
Divisions 1 3 81 17 38 11 151
Autjugacy classes 1 2 23 8 16 7 57

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 12 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 \mid c^{3}=d^{9}=e^{3}=f^{3}=g^{3}=h^{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([12, -2, -3, -2, -3, -3, -3, -3, 3, 3, 3, 3, 3, 24, 209965, 2021546, 1198274, 98, 8290371, 4051599, 553431, 12262324, 2664376, 1730908, 630400, 8530277, 6080849, 1794989, 270485, 281, 54438, 9102, 14681095, 8973523, 155551, 1547467, 540055, 125347, 2134520, 10357652, 3365096, 1758392, 613388, 142952, 3674193, 21939994, 1582450, 866098, 114106, 256678, 8817995, 1516355, 2519471, 334427, 35063]); a,b,c,d,e,f,g,h,i := Explode([G.1, G.3, G.5, G.6, G.8, G.9, G.10, G.11, G.12]); AssignNames(~G, ["a", "a2", "b", "b2", "c", "d", "d3", "e", "f", "g", "h", "i"]);
 
Copy content gap:G := PcGroupCode(62346996502552799835192759933648385321905470162475357643169336001504126152267095365590794701494978268437907255413064935010423133500068883868902529932451479029489710086442692255174846966158909191324092688456634953929134482282858210024494148572345855,236196); a := G.1; b := G.3; c := G.5; d := G.6; e := G.8; f := G.9; g := G.10; h := G.11; i := G.12;
 
Copy content sage:# This uses Sage's interface to GAP, as Sage (currently) has no native support for PC groups G = gap.new('PcGroupCode(62346996502552799835192759933648385321905470162475357643169336001504126152267095365590794701494978268437907255413064935010423133500068883868902529932451479029489710086442692255174846966158909191324092688456634953929134482282858210024494148572345855,236196)'); a = G.1; b = G.3; c = G.5; d = G.6; e = G.8; f = G.9; g = G.10; h = G.11; i = G.12;
 
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(62346996502552799835192759933648385321905470162475357643169336001504126152267095365590794701494978268437907255413064935010423133500068883868902529932451479029489710086442692255174846966158909191324092688456634953929134482282858210024494148572345855,236196)'); a = G.1; b = G.3; c = G.5; d = G.6; e = G.8; f = G.9; g = G.10; h = G.11; i = G.12;
 
Permutation group:Degree $36$ $\langle(1,34,3,35,2,36)(4,9,17,21,29,33)(5,7,18,19,30,31)(6,8,16,20,28,32)(10,14,12,15,11,13) \!\cdots\! \rangle$ Copy content Toggle raw display
Copy content comment:Define the group as a permutation group
 
Copy content magma:G := PermutationGroup< 36 | (1,34,3,35,2,36)(4,9,17,21,29,33)(5,7,18,19,30,31)(6,8,16,20,28,32)(10,14,12,15,11,13)(22,26,24,27,23,25), (1,16,25,6,13,28,3,18,27,5,15,30,2,17,26,4,14,29)(7,35)(8,34)(9,36)(10,21)(11,20)(12,19)(22,33)(23,32)(24,31) >;
 
Copy content gap:G := Group( (1,34,3,35,2,36)(4,9,17,21,29,33)(5,7,18,19,30,31)(6,8,16,20,28,32)(10,14,12,15,11,13)(22,26,24,27,23,25), (1,16,25,6,13,28,3,18,27,5,15,30,2,17,26,4,14,29)(7,35)(8,34)(9,36)(10,21)(11,20)(12,19)(22,33)(23,32)(24,31) );
 
Copy content sage:G = PermutationGroup(['(1,34,3,35,2,36)(4,9,17,21,29,33)(5,7,18,19,30,31)(6,8,16,20,28,32)(10,14,12,15,11,13)(22,26,24,27,23,25)', '(1,16,25,6,13,28,3,18,27,5,15,30,2,17,26,4,14,29)(7,35)(8,34)(9,36)(10,21)(11,20)(12,19)(22,33)(23,32)(24,31)'])
 
Copy content sage_gap:G = gap.new('Group( (1,34,3,35,2,36)(4,9,17,21,29,33)(5,7,18,19,30,31)(6,8,16,20,28,32)(10,14,12,15,11,13)(22,26,24,27,23,25), (1,16,25,6,13,28,3,18,27,5,15,30,2,17,26,4,14,29)(7,35)(8,34)(9,36)(10,21)(11,20)(12,19)(22,33)(23,32)(24,31) )')
 
Copy content oscar:G = @permutation_group(36, (1,34,3,35,2,36)(4,9,17,21,29,33)(5,7,18,19,30,31)(6,8,16,20,28,32)(10,14,12,15,11,13)(22,26,24,27,23,25), (1,16,25,6,13,28,3,18,27,5,15,30,2,17,26,4,14,29)(7,35)(8,34)(9,36)(10,21)(11,20)(12,19)(22,33)(23,32)(24,31))
 
Transitive group: 36T25106 more information
Copy content magma:G := TransitiveGroup(36, 25106);
 
Copy content gap:G := TransitiveGroup(36, 25106);
 
Copy content sage:G = TransitiveGroup(36, 25106)
 
Copy content sage_gap:G = libgap.TransitiveGroup(36, 25106)
 
Copy content oscar:G = transitive_group(36, 25106)
 
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.C_3^3)$ . $D_6$ (2) $(C_3^6.C_3^2)$ . $S_3^2$ $(C_3^6.C_3^2)$ . $S_3^2$ $C_3^5$ . $(C_3^3:S_3^2)$ all 19

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

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}$
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 48 normal subgroups (22 characteristic).

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

Special subgroups

Center: $Z \simeq$ $C_3$ $G/Z \simeq$ $C_3^5.C_3^4.C_2^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^3$ $G/G' \simeq$ $C_2\times 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_3^6$ $G/\Phi \simeq$ $C_3\wr C_2^2$
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.C_3^4$ $G/\operatorname{Fit} \simeq$ $C_2^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^6.C_3\wr C_2^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^4:S_3^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$
3-Sylow subgroup: $P_{ 3 } \simeq$ $C_3^6.C_3^4$

Subgroup diagram and profile

Series

Derived series $C_3^6.C_3\wr C_2^2$ $\rhd$ $C_3^6.C_3^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.C_3\wr C_2^2$ $\rhd$ $C_3^6.C_3^4.C_2$ $\rhd$ $C_3^6.C_3^4$ $\rhd$ $C_3^6.C_3^3$ $\rhd$ $C_3^6.C_3^2$ $\rhd$ $C_3\times C_3^5.C_3$ $\rhd$ $C_3^6$ $\rhd$ $C_3^5$ $\rhd$ $C_3^4$ $\rhd$ $C_3^3$ $\rhd$ $C_3^2$ $\rhd$ $C_3$ $\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.C_3\wr C_2^2$ $\rhd$ $C_3^6.C_3^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$ $\lhd$ $C_3$
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 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 $433 \times 433$ character table is not available for this group.

Rational character table

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