Properties

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

Group information

Description:$C_3^4.\He_3^2:(C_2\times C_4)$
Order: \(472392\)\(\medspace = 2^{3} \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: \(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^6.C_3^5.C_6.C_6.C_2^3$, of order \(51018336\)\(\medspace = 2^{5} \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 3, $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 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 7047 18224 52488 117612 40824 183708 52488 472392
Conjugacy classes   1 3 75 4 19 90 14 6 212
Divisions 1 3 68 2 15 29 4 2 124
Autjugacy classes 1 2 17 2 7 6 6 1 42

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 6 8 9 12 18 24 36 48 72 108 144 216 432
Irr. complex chars.   8 0 8 8 8 16 0 4 58 24 0 78 0 0 0 0 212
Irr. rational chars. 4 2 8 0 8 0 2 6 28 15 2 24 4 3 17 1 124

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, g, h, i, j \mid a^{4}=c^{3}=d^{9}=e^{3}=f^{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([13, 2, 2, 2, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 26, 5040518, 8688825, 106, 18208739, 6509376, 119382, 27950524, 8046497, 3942540, 1830703, 35901221, 8353818, 440887, 1462557, 304, 3538086, 19675, 9860, 3863815, 67412, 1033377, 4675328, 227469, 69532, 29820969, 631822, 8094095, 400188, 221191, 74954, 3027034, 2501951, 1328220, 24209963, 16308888, 3691621, 1276286, 369315, 212080, 2000, 12300508, 8140417, 5932952, 4271019, 1385695, 480713, 5706]); a,b,c,d,e,f,g,h,i,j := Explode([G.1, G.3, G.5, G.6, G.8, G.9, G.10, G.11, G.12, G.13]); AssignNames(~G, ["a", "a2", "b", "b2", "c", "d", "d3", "e", "f", "g", "h", "i", "j"]);
 
Copy content gap:G := PcGroupCode(89863147327876997388984308484339728746141216646446705192203513419370171650950273068880045843094691978428745320687620993436905277157651173725266017571430439573271853632994632138965023804338107906049806531035961048976740750761374053362528764100973870592624421083022473988506047111834849004950143738879,472392); 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; j := 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(89863147327876997388984308484339728746141216646446705192203513419370171650950273068880045843094691978428745320687620993436905277157651173725266017571430439573271853632994632138965023804338107906049806531035961048976740750761374053362528764100973870592624421083022473988506047111834849004950143738879,472392)'); 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; j = 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(89863147327876997388984308484339728746141216646446705192203513419370171650950273068880045843094691978428745320687620993436905277157651173725266017571430439573271853632994632138965023804338107906049806531035961048976740750761374053362528764100973870592624421083022473988506047111834849004950143738879,472392)'); 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; j = G.13;
 
Permutation group:Degree $36$ $\langle(1,5,27,30,13,17,3,6,26,28,15,18,2,4,25,29,14,16)(7,23,33,11,21,34,8,22,31,10,19,36,9,24,32,12,20,35) \!\cdots\! \rangle$ Copy content Toggle raw display
Copy content comment:Define the group as a permutation group
 
Copy content magma:G := PermutationGroup< 36 | (1,5,27,30,13,17,3,6,26,28,15,18,2,4,25,29,14,16)(7,23,33,11,21,34,8,22,31,10,19,36,9,24,32,12,20,35), (1,35,26,24)(2,34,25,22)(3,36,27,23)(4,20,6,21)(5,19)(7,16,33,28)(8,17,32,30)(9,18,31,29)(10,13)(11,14,12,15) >;
 
Copy content gap:G := Group( (1,5,27,30,13,17,3,6,26,28,15,18,2,4,25,29,14,16)(7,23,33,11,21,34,8,22,31,10,19,36,9,24,32,12,20,35), (1,35,26,24)(2,34,25,22)(3,36,27,23)(4,20,6,21)(5,19)(7,16,33,28)(8,17,32,30)(9,18,31,29)(10,13)(11,14,12,15) );
 
Copy content sage:G = PermutationGroup(['(1,5,27,30,13,17,3,6,26,28,15,18,2,4,25,29,14,16)(7,23,33,11,21,34,8,22,31,10,19,36,9,24,32,12,20,35)', '(1,35,26,24)(2,34,25,22)(3,36,27,23)(4,20,6,21)(5,19)(7,16,33,28)(8,17,32,30)(9,18,31,29)(10,13)(11,14,12,15)'])
 
Copy content sage_gap:G = gap.new('Group( (1,5,27,30,13,17,3,6,26,28,15,18,2,4,25,29,14,16)(7,23,33,11,21,34,8,22,31,10,19,36,9,24,32,12,20,35), (1,35,26,24)(2,34,25,22)(3,36,27,23)(4,20,6,21)(5,19)(7,16,33,28)(8,17,32,30)(9,18,31,29)(10,13)(11,14,12,15) )')
 
Copy content oscar:G = @permutation_group(36, (1,5,27,30,13,17,3,6,26,28,15,18,2,4,25,29,14,16)(7,23,33,11,21,34,8,22,31,10,19,36,9,24,32,12,20,35), (1,35,26,24)(2,34,25,22)(3,36,27,23)(4,20,6,21)(5,19)(7,16,33,28)(8,17,32,30)(9,18,31,29)(10,13)(11,14,12,15))
 
Transitive group: 36T30313 more information
Copy content magma:G := TransitiveGroup(36, 30313);
 
Copy content gap:G := TransitiveGroup(36, 30313);
 
Copy content sage:G = TransitiveGroup(36, 30313)
 
Copy content sage_gap:G = libgap.TransitiveGroup(36, 30313)
 
Copy content oscar:G = transitive_group(36, 30313)
 
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)$ . $C_2$ (3) $(C_3^6.C_3^4.C_2)$ . $C_4$ $C_3^5$ . $(C_3^3:S_3^2.C_2)$ $C_3^5$ . $(C_3^3:S_3^2.C_2)$ all 10

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

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_{3} \times C_{6}$
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 19 normal subgroups (11 characteristic).

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

Special subgroups

Center: $Z \simeq$ $C_1$ $G/Z \simeq$ $C_3^4.\He_3^2:(C_2\times C_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_3^6.C_3^4$ $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^6$ $G/\Phi \simeq$ $C_3^4:(C_2\times 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_3^6.C_3^4$ $G/\operatorname{Fit} \simeq$ $C_2\times 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_3^4.\He_3^2:(C_2\times C_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$ $\He_3^2:(C_2\times 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\times C_4$
3-Sylow subgroup: $P_{ 3 } \simeq$ $C_3^6.C_3^4$

Subgroup diagram and profile

Series

Derived series $C_3^4.\He_3^2:(C_2\times C_4)$ $\rhd$ $C_3^6.C_3^4$ $\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^4.\He_3^2:(C_2\times C_4)$ $\rhd$ $C_3^6.C_3^4.C_4$ $\rhd$ $C_3^6.C_3^4.C_2$ $\rhd$ $C_3^6.C_3^4$ $\rhd$ $C_3^6.C_3^2$ $\rhd$ $C_3^6$ $\rhd$ $C_3^5$ $\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_3^4.\He_3^2:(C_2\times C_4)$ $\rhd$ $C_3^6.C_3^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 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

See the $212 \times 212$ 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 $124 \times 124$ rational character table.