Properties

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

Group information

Description:$C_9^2\wr C_2.D_4$
Order: \(104976\)\(\medspace = 2^{4} \cdot 3^{8} \)
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_9^4.C_6.C_6^2.C_2^4$, of order \(22674816\)\(\medspace = 2^{7} \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 8
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 36
Elements 1 8199 80 29160 4680 6480 5832 33048 17496 104976
Conjugacy classes   1 5 10 4 14 504 2 228 6 774
Divisions 1 5 10 2 14 168 1 76 1 278
Autjugacy classes 1 5 5 2 7 15 1 11 1 48

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 4 8 12 16 24 48
Irr. complex chars.   8 2 112 332 0 320 0 0 774
Irr. rational chars. 4 4 14 9 30 2 109 106 278

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 8 not computed 24
Arbitrary not computed not computed not computed

Constructions

Show commands: Gap / Magma / Oscar / SageMath


Presentation: ${\langle a, b, c, d, e \mid a^{4}=b^{18}=c^{18}=d^{9}=e^{9}=[b,d]=[b,e]= \!\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, 2, 2, 3, 3, 2, 3, 3, 3, 3, 3, 3, 24, 20450, 638870, 98, 1046403, 1551, 183, 2360164, 1456, 4346213, 1770353, 1678349, 187313, 116909, 209, 3161766, 48402, 1003998, 330, 748807, 41491, 860575, 5633288, 559892, 33116, 428, 4772169, 466581, 71349, 12154570, 6158614, 526, 6165515, 5038871]); a,b,c,d,e := Explode([G.1, G.3, G.6, G.9, G.11]); AssignNames(~G, ["a", "a2", "b", "b2", "b6", "c", "c2", "c6", "d", "d3", "e", "e3"]);
 
Copy content gap:G := PcGroupCode(30736905742482522579983506119602542818140187846201260700769812727683339397942967480150277138972509444796358199339051182285225371073627791239656434105780388101209331173052648480108926977944506815,104976); a := G.1; b := G.3; c := G.6; d := G.9; e := G.11;
 
Copy content sage:# This uses Sage's interface to GAP, as Sage (currently) has no native support for PC groups G = gap.new('PcGroupCode(30736905742482522579983506119602542818140187846201260700769812727683339397942967480150277138972509444796358199339051182285225371073627791239656434105780388101209331173052648480108926977944506815,104976)'); a = G.1; b = G.3; c = G.6; d = G.9; e = G.11;
 
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(30736905742482522579983506119602542818140187846201260700769812727683339397942967480150277138972509444796358199339051182285225371073627791239656434105780388101209331173052648480108926977944506815,104976)'); a = G.1; b = G.3; c = G.6; d = G.9; e = G.11;
 
Permutation group:Degree $36$ $\langle(1,12,14,34)(2,10,13,36)(3,11,15,35)(4,31,17,8)(5,32,16,7)(6,33,18,9)(19,28,21,29) \!\cdots\! \rangle$ Copy content Toggle raw display
Copy content comment:Define the group as a permutation group
 
Copy content magma:G := PermutationGroup< 36 | (1,12,14,34)(2,10,13,36)(3,11,15,35)(4,31,17,8)(5,32,16,7)(6,33,18,9)(19,28,21,29)(20,30)(22,26)(23,25,24,27), (1,13)(2,15)(3,14)(4,36,6,34,5,35)(7,20)(8,19)(9,21)(10,18,11,17,12,16)(22,30,23,29,24,28)(25,26)(31,32) >;
 
Copy content gap:G := Group( (1,12,14,34)(2,10,13,36)(3,11,15,35)(4,31,17,8)(5,32,16,7)(6,33,18,9)(19,28,21,29)(20,30)(22,26)(23,25,24,27), (1,13)(2,15)(3,14)(4,36,6,34,5,35)(7,20)(8,19)(9,21)(10,18,11,17,12,16)(22,30,23,29,24,28)(25,26)(31,32) );
 
Copy content sage:G = PermutationGroup(['(1,12,14,34)(2,10,13,36)(3,11,15,35)(4,31,17,8)(5,32,16,7)(6,33,18,9)(19,28,21,29)(20,30)(22,26)(23,25,24,27)', '(1,13)(2,15)(3,14)(4,36,6,34,5,35)(7,20)(8,19)(9,21)(10,18,11,17,12,16)(22,30,23,29,24,28)(25,26)(31,32)'])
 
Copy content sage_gap:G = gap.new('Group( (1,12,14,34)(2,10,13,36)(3,11,15,35)(4,31,17,8)(5,32,16,7)(6,33,18,9)(19,28,21,29)(20,30)(22,26)(23,25,24,27), (1,13)(2,15)(3,14)(4,36,6,34,5,35)(7,20)(8,19)(9,21)(10,18,11,17,12,16)(22,30,23,29,24,28)(25,26)(31,32) )')
 
Copy content oscar:G = @permutation_group(36, (1,12,14,34)(2,10,13,36)(3,11,15,35)(4,31,17,8)(5,32,16,7)(6,33,18,9)(19,28,21,29)(20,30)(22,26)(23,25,24,27), (1,13)(2,15)(3,14)(4,36,6,34,5,35)(7,20)(8,19)(9,21)(10,18,11,17,12,16)(22,30,23,29,24,28)(25,26)(31,32))
 
Transitive group: 36T20371 more information
Copy content magma:G := TransitiveGroup(36, 20371);
 
Copy content gap:G := TransitiveGroup(36, 20371);
 
Copy content sage:G = TransitiveGroup(36, 20371)
 
Copy content sage_gap:G = libgap.TransitiveGroup(36, 20371)
 
Copy content oscar:G = transitive_group(36, 20371)
 
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_9^4.C_2)$ . $D_4$ $(C_9^2\wr C_2)$ . $D_4$ $D_9^2$ . $(C_9^2:C_4)$ $C_9^2$ . $(D_9^2:C_4)$ all 21

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

Homology

Abelianization: $C_{2} \times C_{4} $
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} \times C_{18}$
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 4246951 subgroups in 10425 conjugacy classes, 25 normal, and all normal subgroups are characteristic.

Characteristic subgroups are shown in this color.

Special subgroups

Center: $Z \simeq$ $C_1$ $G/Z \simeq$ $C_9^2\wr C_2.D_4$
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_9^2\wr C_2$ $G/G' \simeq$ $C_2\times C_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: $\Phi \simeq$ $C_3^4$ $G/\Phi \simeq$ $(C_3^2\times S_3^2):C_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: $\operatorname{Fit} \simeq$ $C_9^4$ $G/\operatorname{Fit} \simeq$ $C_2^2:C_4$
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_9^2\wr C_2.D_4$ $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^2\times S_3^2):C_4$
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:C_4$
3-Sylow subgroup: $P_{ 3 } \simeq$ $C_9^4$

Subgroup diagram and profile

Series

Derived series $C_9^2\wr C_2.D_4$ $\rhd$ $C_9^2\wr C_2$ $\rhd$ $C_9^2$ $\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_9^2\wr C_2.D_4$ $\rhd$ $C_9^4:(C_2\times C_4)$ $\rhd$ $C_9^4.C_2^2$ $\rhd$ $C_9^4.C_2$ $\rhd$ $C_9^4$ $\rhd$ $C_3^2\times C_9^2$ $\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_9^2\wr C_2.D_4$ $\rhd$ $C_9^2\wr C_2$ $\rhd$ $C_9^4$
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 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

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

Rational character table

See the $278 \times 278$ rational character table (warning: may be slow to load).