Properties

Label 746496.bb
Order \( 2^{10} \cdot 3^{6} \)
Exponent \( 2^{4} \cdot 3 \)
Nilpotent no
Solvable yes
$\card{G^{\mathrm{ab}}}$ \( 2^{3} \)
$\card{Z(G)}$ 2
$\card{\Aut(G)}$ \( 2^{11} \cdot 3^{6} \)
$\card{\mathrm{Out}(G)}$ \( 2^{2} \)
Perm deg. $22$
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< 22 | (1,3,5,8,13,14)(2,4,6,10,15,9)(7,12,17,18,16,11)(19,21,22,20), (1,2)(3,4)(5,7,11,16)(6,9)(8,13,17,12)(10,14,18,15)(19,20,22,21) >;
 
Copy content gap:G := Group( (1,3,5,8,13,14)(2,4,6,10,15,9)(7,12,17,18,16,11)(19,21,22,20), (1,2)(3,4)(5,7,11,16)(6,9)(8,13,17,12)(10,14,18,15)(19,20,22,21) );
 
Copy content sage:G = PermutationGroup(['(1,3,5,8,13,14)(2,4,6,10,15,9)(7,12,17,18,16,11)(19,21,22,20)', '(1,2)(3,4)(5,7,11,16)(6,9)(8,13,17,12)(10,14,18,15)(19,20,22,21)'])
 
Copy content sage_gap:G = gap.new('Group( (1,3,5,8,13,14)(2,4,6,10,15,9)(7,12,17,18,16,11)(19,21,22,20), (1,2)(3,4)(5,7,11,16)(6,9)(8,13,17,12)(10,14,18,15)(19,20,22,21) )')
 
Copy content oscar:G = @permutation_group(22, (1,3,5,8,13,14)(2,4,6,10,15,9)(7,12,17,18,16,11)(19,21,22,20), (1,2)(3,4)(5,7,11,16)(6,9)(8,13,17,12)(10,14,18,15)(19,20,22,21))
 

Group information

Description:$(C_3^3\times C_6).\GL(2,3)\wr C_2$
Order: \(746496\)\(\medspace = 2^{10} \cdot 3^{6} \)
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: \(48\)\(\medspace = 2^{4} \cdot 3 \)
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^4.Q_8^2.S_3^2.C_2^3$, of order \(1492992\)\(\medspace = 2^{11} \cdot 3^{6} \)
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 10, $C_3$ x 6
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:$6$
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 8 12 16 24
Elements 1 4231 6560 55512 135008 113184 241920 93312 96768 746496
Conjugacy classes   1 11 9 14 51 24 20 4 20 154
Divisions 1 11 9 11 51 13 15 1 10 122
Autjugacy classes 1 9 9 10 41 17 14 2 12 115

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 16 18 24 32 48 64 96 128 256 512
Irr. complex chars.   8 2 24 8 10 8 12 18 2 4 16 8 18 4 4 8 0 154
Irr. rational chars. 4 4 6 8 13 4 4 15 4 8 11 8 14 4 8 6 1 122

Minimal presentations

Permutation degree:$22$
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 16 16 16
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 b^{4}=c^{3}=e^{12}=g^{12}=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([16, 2, 2, 2, 3, 2, 2, 2, 3, 2, 3, 2, 2, 3, 3, 2, 3, 7118336, 1817281, 81, 26468930, 20029443, 19636243, 291, 39951364, 2903060, 8596836, 4163092, 54788, 63621125, 30718869, 5477221, 166805, 33669, 277, 49565830, 36086870, 1013414, 388470, 102662, 326, 1036295, 1053207, 12327, 101751560, 10628952, 352552, 259256, 217800, 1738456, 766472, 445080, 424, 95523849, 23431705, 1474601, 576057, 46153, 1708889, 937065, 277561, 3033, 80572810, 61649306, 228138, 84554, 1290522, 1118410, 99914, 7530, 522, 19077131, 48024603, 184395, 2138203, 1147499, 338811, 571, 8626188, 25878556, 189772, 35036, 60012, 4902925, 258077, 32514093, 1354845, 580717, 677501, 113037, 16285, 21677, 2877, 96215054, 48107550, 2073694, 1658990, 570366, 293902, 129758, 14574, 21790, 718, 3538959, 1769503, 442463, 1548399, 55423, 239759, 110751, 21679, 18623]); a,b,c,d,e,f,g,h,i := Explode([G.1, G.2, G.4, G.5, G.6, G.9, G.11, G.14, G.15]); AssignNames(~G, ["a", "b", "b2", "c", "d", "e", "e2", "e4", "f", "f2", "g", "g2", "g4", "h", "i", "i2"]);
 
Copy content gap:G := PcGroupCode(3312181253950534210011149793252669609189324406898221415223513929223516378789090445146398315576317707044780098257896855836055190896203131438222846807413597066438822306190108701003136460026763561613420171049550089146114237874308416490151253424976939126401696912644639904385755962921583461019087976164611774047854151688643726539065196510209030006704109119378267219626097792409532448027390570615824356835995789433129889828337107633155146686354037274443990387133523093250204194571593213737279428975509864354550592518845194902268479616841996667946624941037241967539755962546253057904346851233633544638797,746496); a := G.1; b := G.2; c := G.4; d := G.5; e := G.6; f := G.9; g := G.11; h := G.14; i := G.15;
 
Copy content sage:# This uses Sage's interface to GAP, as Sage (currently) has no native support for PC groups G = gap.new('PcGroupCode(3312181253950534210011149793252669609189324406898221415223513929223516378789090445146398315576317707044780098257896855836055190896203131438222846807413597066438822306190108701003136460026763561613420171049550089146114237874308416490151253424976939126401696912644639904385755962921583461019087976164611774047854151688643726539065196510209030006704109119378267219626097792409532448027390570615824356835995789433129889828337107633155146686354037274443990387133523093250204194571593213737279428975509864354550592518845194902268479616841996667946624941037241967539755962546253057904346851233633544638797,746496)'); a = G.1; b = G.2; c = G.4; d = G.5; e = G.6; f = G.9; g = G.11; h = G.14; i = G.15;
 
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(3312181253950534210011149793252669609189324406898221415223513929223516378789090445146398315576317707044780098257896855836055190896203131438222846807413597066438822306190108701003136460026763561613420171049550089146114237874308416490151253424976939126401696912644639904385755962921583461019087976164611774047854151688643726539065196510209030006704109119378267219626097792409532448027390570615824356835995789433129889828337107633155146686354037274443990387133523093250204194571593213737279428975509864354550592518845194902268479616841996667946624941037241967539755962546253057904346851233633544638797,746496)'); a = G.1; b = G.2; c = G.4; d = G.5; e = G.6; f = G.9; g = G.11; h = G.14; i = G.15;
 
Permutation group:Degree $22$ $\langle(1,3,5,8,13,14)(2,4,6,10,15,9)(7,12,17,18,16,11)(19,21,22,20), (1,2)(3,4)(5,7,11,16)(6,9)(8,13,17,12)(10,14,18,15)(19,20,22,21)\rangle$ Copy content Toggle raw display
Copy content comment:Define the group as a permutation group
 
Copy content magma:G := PermutationGroup< 22 | (1,3,5,8,13,14)(2,4,6,10,15,9)(7,12,17,18,16,11)(19,21,22,20), (1,2)(3,4)(5,7,11,16)(6,9)(8,13,17,12)(10,14,18,15)(19,20,22,21) >;
 
Copy content gap:G := Group( (1,3,5,8,13,14)(2,4,6,10,15,9)(7,12,17,18,16,11)(19,21,22,20), (1,2)(3,4)(5,7,11,16)(6,9)(8,13,17,12)(10,14,18,15)(19,20,22,21) );
 
Copy content sage:G = PermutationGroup(['(1,3,5,8,13,14)(2,4,6,10,15,9)(7,12,17,18,16,11)(19,21,22,20)', '(1,2)(3,4)(5,7,11,16)(6,9)(8,13,17,12)(10,14,18,15)(19,20,22,21)'])
 
Copy content sage_gap:G = gap.new('Group( (1,3,5,8,13,14)(2,4,6,10,15,9)(7,12,17,18,16,11)(19,21,22,20), (1,2)(3,4)(5,7,11,16)(6,9)(8,13,17,12)(10,14,18,15)(19,20,22,21) )')
 
Copy content oscar:G = @permutation_group(22, (1,3,5,8,13,14)(2,4,6,10,15,9)(7,12,17,18,16,11)(19,21,22,20), (1,2)(3,4)(5,7,11,16)(6,9)(8,13,17,12)(10,14,18,15)(19,20,22,21))
 
Transitive group: 36T34180 36T34181 more information
Copy content magma:G := TransitiveGroup(36, 34180);
 
Copy content gap:G := TransitiveGroup(36, 34180);
 
Copy content sage:G = TransitiveGroup(36, 34180)
 
Copy content sage_gap:G = libgap.TransitiveGroup(36, 34180)
 
Copy content oscar:G = transitive_group(36, 34180)
 
Copy content magma:G := TransitiveGroup(36, 34181);
 
Copy content gap:G := TransitiveGroup(36, 34181);
 
Copy content sage:G = TransitiveGroup(36, 34181)
 
Copy content sage_gap:G = libgap.TransitiveGroup(36, 34181)
 
Copy content oscar:G = transitive_group(36, 34181)
 
Direct product: not computed
Semidirect product: not computed
Trans. wreath product: not isomorphic to a non-trivial transitive wreath product
Possibly split product: $(C_3^4.Q_8^2.S_3^2)$ . $C_4$ (2) $C_3^4$ . $(Q_8^2.S_3^2:C_4)$ $(C_3^2:S_3^2)$ . $(S_4^2:C_4)$ $(C_3^4:C_2^3)$ . $(S_4\wr C_2)$ all 19

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

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}^{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 23 normal subgroups (21 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_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: 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_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: 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)
 

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 3 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 $154 \times 154$ 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 $122 \times 122$ rational character table.