Properties

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

Group information

Description:$C_3^{12}.C_2.\SL(3,3)$
Order: \(5969145312\)\(\medspace = 2^{5} \cdot 3^{15} \cdot 13 \)
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: \(936\)\(\medspace = 2^{3} \cdot 3^{2} \cdot 13 \)
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:Group of order \(5969145312\)\(\medspace = 2^{5} \cdot 3^{15} \cdot 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$, $C_3$ x 12, $\SL(3,3)$
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:$1$
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 nonsolvable.

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 8 9 12 13 18 24 26
Elements 1 1308555 6672536 9211644 731548584 165809592 380747952 736931520 918330048 773778096 1326476736 918330048 5969145312
Conjugacy classes   1 3 154 2 268 4 63 44 4 39 16 4 602
Divisions 1 3 154 2 268 2 62 38 1 38 8 1 578

Minimal presentations

Permutation degree:$39$
Transitive degree:$39$
Rank: $2$
Inequivalent generating pairs: not computed

Minimal degrees of faithful linear representations

Over $\mathbb{C}$ Over $\mathbb{R}$ Over $\mathbb{Q}$
Irreducible 26 not computed not computed
Arbitrary not computed not computed not computed

Constructions

Show commands: Gap / Magma / Oscar / SageMath


Permutation group:Degree $39$ $\langle(1,6,15,16,25,36,11,32,2,5,13,18,27,34,10,31,3,4,14,17,26,35,12,33)(7,22,20,29) \!\cdots\! \rangle$ Copy content Toggle raw display
Copy content comment:Define the group as a permutation group
 
Copy content magma:G := PermutationGroup< 39 | (1,6,15,16,25,36,11,32,2,5,13,18,27,34,10,31,3,4,14,17,26,35,12,33)(7,22,20,29)(8,24,19,30)(9,23,21,28)(37,39), (1,38,6,29,18,20,8,36,3,37,5,28,17,19,7,35,2,39,4,30,16,21,9,34)(10,33,26,23,11,31,27,24,12,32,25,22)(14,15) >;
 
Copy content gap:G := Group( (1,6,15,16,25,36,11,32,2,5,13,18,27,34,10,31,3,4,14,17,26,35,12,33)(7,22,20,29)(8,24,19,30)(9,23,21,28)(37,39), (1,38,6,29,18,20,8,36,3,37,5,28,17,19,7,35,2,39,4,30,16,21,9,34)(10,33,26,23,11,31,27,24,12,32,25,22)(14,15) );
 
Copy content sage:G = PermutationGroup(['(1,6,15,16,25,36,11,32,2,5,13,18,27,34,10,31,3,4,14,17,26,35,12,33)(7,22,20,29)(8,24,19,30)(9,23,21,28)(37,39)', '(1,38,6,29,18,20,8,36,3,37,5,28,17,19,7,35,2,39,4,30,16,21,9,34)(10,33,26,23,11,31,27,24,12,32,25,22)(14,15)'])
 
Copy content sage_gap:G = gap.new('Group( (1,6,15,16,25,36,11,32,2,5,13,18,27,34,10,31,3,4,14,17,26,35,12,33)(7,22,20,29)(8,24,19,30)(9,23,21,28)(37,39), (1,38,6,29,18,20,8,36,3,37,5,28,17,19,7,35,2,39,4,30,16,21,9,34)(10,33,26,23,11,31,27,24,12,32,25,22)(14,15) )')
 
Copy content oscar:G = @permutation_group(39, (1,6,15,16,25,36,11,32,2,5,13,18,27,34,10,31,3,4,14,17,26,35,12,33)(7,22,20,29)(8,24,19,30)(9,23,21,28)(37,39), (1,38,6,29,18,20,8,36,3,37,5,28,17,19,7,35,2,39,4,30,16,21,9,34)(10,33,26,23,11,31,27,24,12,32,25,22)(14,15))
 
Transitive group: 39T250 more information
Copy content magma:G := TransitiveGroup(39, 250);
 
Copy content gap:G := TransitiveGroup(39, 250);
 
Copy content sage:G = TransitiveGroup(39, 250)
 
Copy content sage_gap:G = libgap.TransitiveGroup(39, 250)
 
Copy content oscar:G = transitive_group(39, 250)
 
Direct product: not computed
Semidirect product: not computed
Trans. wreath product: not computed
Possibly split product: $C_3^{12}$ . $\GL(3,3)$ $(C_3^{12}.\SL(3,3))$ . $C_2$ $(C_3^{12}.C_2)$ . $\SL(3,3)$ $C_3^6$ . $(C_3^6.\GL(3,3))$ more information

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

Homology

Abelianization: $C_{2} $
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 6 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: 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^6$
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_3^7.C_3^5.C_3^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 2 larger groups in the database.

This group is a maximal quotient of 1 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 $602 \times 602$ character table is not available for this group.

Rational character table

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