Properties

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

Group information

Description:$C_9:D_9^3.C_6$
Order: \(314928\)\(\medspace = 2^{4} \cdot 3^{9} \)
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.S_3\wr D_4$, of order \(7558272\)\(\medspace = 2^{7} \cdot 3^{10} \)
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 9
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 7047 242 5832 25758 19440 46656 104976 104976 314928
Conjugacy classes   1 5 11 4 20 163 12 42 12 270
Divisions 1 5 10 2 15 154 4 32 4 227
Autjugacy classes 1 3 7 1 10 32 3 15 3 75

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 32 48
Irr. complex chars.   24 6 48 12 16 9 28 0 127 270
Irr. rational chars. 4 8 16 18 12 9 30 3 127 227

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^{2}=c^{18}=d^{9}=e^{9}=f^{9}=[d,e]=[d,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([13, 2, 2, 3, 2, 2, 3, 3, 3, 3, 3, 3, 3, 3, 26, 66, 1151308, 1690419, 6924232, 2558585, 3016264, 10040957, 248460, 154353, 186, 471749, 10164978, 6583, 2540, 304, 1297302, 5307139, 2229, 14980999, 89876, 78657, 29998, 15035, 410, 13663736, 25319, 12696, 26794569, 1347862, 884555, 337008, 168541, 516, 33379642, 1667975, 278041, 139058, 9449867, 18705048, 9552853, 3639218, 353871, 622, 18227676, 997801, 2956875, 903538]); a,b,c,d,e,f := Explode([G.1, G.4, G.5, G.8, G.10, G.12]); AssignNames(~G, ["a", "a2", "a4", "b", "c", "c2", "c6", "d", "d3", "e", "e3", "f", "f3"]);
 
Copy content gap:G := PcGroupCode(475660202377486244417475496373214941678727705945203933968607365540181851366327696535157278499975725587141436750729674159574718207125206310266092055039122088429183612207189011882767805312744584838057279987636367444055908493480021873020391990466875450447231508113645604462681018535108660356351,314928); a := G.1; b := G.4; c := G.5; d := G.8; e := G.10; f := 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(475660202377486244417475496373214941678727705945203933968607365540181851366327696535157278499975725587141436750729674159574718207125206310266092055039122088429183612207189011882767805312744584838057279987636367444055908493480021873020391990466875450447231508113645604462681018535108660356351,314928)'); a = G.1; b = G.4; c = G.5; d = G.8; e = G.10; f = 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(475660202377486244417475496373214941678727705945203933968607365540181851366327696535157278499975725587141436750729674159574718207125206310266092055039122088429183612207189011882767805312744584838057279987636367444055908493480021873020391990466875450447231508113645604462681018535108660356351,314928)'); a = G.1; b = G.4; c = G.5; d = G.8; e = G.10; f = G.12;
 
Permutation group:Degree $36$ $\langle(1,17,32,10,25,28,8,35,13,4,20,23,3,18,33,11,27,29,7,36,14,6,19,22,2,16,31,12,26,30,9,34,15,5,21,24) \!\cdots\! \rangle$ Copy content Toggle raw display
Copy content comment:Define the group as a permutation group
 
Copy content magma:G := PermutationGroup< 36 | (1,17,32,10,25,28,8,35,13,4,20,23,3,18,33,11,27,29,7,36,14,6,19,22,2,16,31,12,26,30,9,34,15,5,21,24), (1,24,7,16,25,36,31,28,14,11,20,5,3,22,8,17,27,35,33,29,15,10,21,4,2,23,9,18,26,34,32,30,13,12,19,6) >;
 
Copy content gap:G := Group( (1,17,32,10,25,28,8,35,13,4,20,23,3,18,33,11,27,29,7,36,14,6,19,22,2,16,31,12,26,30,9,34,15,5,21,24), (1,24,7,16,25,36,31,28,14,11,20,5,3,22,8,17,27,35,33,29,15,10,21,4,2,23,9,18,26,34,32,30,13,12,19,6) );
 
Copy content sage:G = PermutationGroup(['(1,17,32,10,25,28,8,35,13,4,20,23,3,18,33,11,27,29,7,36,14,6,19,22,2,16,31,12,26,30,9,34,15,5,21,24)', '(1,24,7,16,25,36,31,28,14,11,20,5,3,22,8,17,27,35,33,29,15,10,21,4,2,23,9,18,26,34,32,30,13,12,19,6)'])
 
Copy content sage_gap:G = gap.new('Group( (1,17,32,10,25,28,8,35,13,4,20,23,3,18,33,11,27,29,7,36,14,6,19,22,2,16,31,12,26,30,9,34,15,5,21,24), (1,24,7,16,25,36,31,28,14,11,20,5,3,22,8,17,27,35,33,29,15,10,21,4,2,23,9,18,26,34,32,30,13,12,19,6) )')
 
Copy content oscar:G = @permutation_group(36, (1,17,32,10,25,28,8,35,13,4,20,23,3,18,33,11,27,29,7,36,14,6,19,22,2,16,31,12,26,30,9,34,15,5,21,24), (1,24,7,16,25,36,31,28,14,11,20,5,3,22,8,17,27,35,33,29,15,10,21,4,2,23,9,18,26,34,32,30,13,12,19,6))
 
Transitive group: 36T27826 more information
Copy content magma:G := TransitiveGroup(36, 27826);
 
Copy content gap:G := TransitiveGroup(36, 27826);
 
Copy content sage:G = TransitiveGroup(36, 27826)
 
Copy content sage_gap:G = libgap.TransitiveGroup(36, 27826)
 
Copy content oscar:G = transitive_group(36, 27826)
 
Direct product: not computed
Semidirect product: not computed
Trans. wreath product: not computed
Possibly split product: $(C_9:D_9^3)$ . $C_6$ $C_9^2$ . $(D_9^2:C_{12})$ (2) $(C_9^4.C_2^2)$ . $C_{12}$ (2) $C_9^4$ . $(C_2^2:C_{12})$ all 23

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

Homology

Abelianization: $C_{2} \times C_{12} \simeq C_{2} \times C_{4} \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: not computed
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 7985302 subgroups in 19337 conjugacy classes, 39 normal (13 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^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$

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