Properties

Label 2048.cqm
Order \( 2^{11} \)
Exponent \( 2^{3} \)
Nilpotent yes
Solvable yes
$\card{G^{\mathrm{ab}}}$ \( 2^{6} \)
$\card{Z(G)}$ 8
$\card{\Aut(G)}$ \( 2^{19} \)
$\card{\mathrm{Out}(G)}$ \( 2^{11} \)
Perm deg. not computed
Trans deg. not computed
Rank $5$

Related objects

Downloads

Learn more

Show commands: Gap / Magma / SageMath

Copy content comment:Define the group as a permutation group
 
Copy content magma:G := PermutationGroup< 20 | (2,6)(3,8)(11,16)(13,18), (1,17)(2,6)(3,8)(4,9)(7,12)(11,16)(13,18)(14,19), (2,3)(6,8)(11,13)(16,18), (1,8,14,2)(3,19,6,17)(4,13,12,16)(7,11,9,18), (5,10,20,15), (1,12,19,9)(4,14,7,17)(6,8)(16,18), (1,19)(2,3)(4,7)(6,8)(9,12)(11,13)(14,17)(16,18), (2,8)(3,6)(4,7)(9,12)(11,16)(13,18), (2,6)(3,8)(4,9)(7,12) >;
 
Copy content gap:G := Group( (2,6)(3,8)(11,16)(13,18), (1,17)(2,6)(3,8)(4,9)(7,12)(11,16)(13,18)(14,19), (2,3)(6,8)(11,13)(16,18), (1,8,14,2)(3,19,6,17)(4,13,12,16)(7,11,9,18), (5,10,20,15), (1,12,19,9)(4,14,7,17)(6,8)(16,18), (1,19)(2,3)(4,7)(6,8)(9,12)(11,13)(14,17)(16,18), (2,8)(3,6)(4,7)(9,12)(11,16)(13,18), (2,6)(3,8)(4,9)(7,12) );
 
Copy content sage:G = PermutationGroup(['(2,6)(3,8)(11,16)(13,18)', '(1,17)(2,6)(3,8)(4,9)(7,12)(11,16)(13,18)(14,19)', '(2,3)(6,8)(11,13)(16,18)', '(1,8,14,2)(3,19,6,17)(4,13,12,16)(7,11,9,18)', '(5,10,20,15)', '(1,12,19,9)(4,14,7,17)(6,8)(16,18)', '(1,19)(2,3)(4,7)(6,8)(9,12)(11,13)(14,17)(16,18)', '(2,8)(3,6)(4,7)(9,12)(11,16)(13,18)', '(2,6)(3,8)(4,9)(7,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(7070840823869233431361319832255775671574661617292883210933703467771887917,2048)'); a = G.1; b = G.3; c = G.4; d = G.6; e = G.8; f = G.9; g = G.11;
 

Group information

Description:$(C_4\times D_4^2).D_4$
Order: \(2048\)\(\medspace = 2^{11} \)
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()
 
Exponent: \(8\)\(\medspace = 2^{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()
 
Automorphism group:$C_5^4.(C_4\times D_4)$, of order \(524288\)\(\medspace = 2^{19} \)
Copy content comment:Automorphism group
 
Copy content gap:AutomorphismGroup(G);
 
Copy content magma:AutomorphismGroup(G);
 
Copy content sage_gap:G.AutomorphismGroup()
 
Composition factors:$C_2$ x 11
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()
 
Nilpotency class:$4$
Copy content comment:Nilpotency class of the group
 
Copy content magma:NilpotencyClass(G);
 
Copy content gap:NilpotencyClassOfGroup(G);
 
Copy content sage_gap:G.NilpotencyClassOfGroup()
 
Derived length:$3$
Copy content comment:Derived length of the group
 
Copy content magma:DerivedLength(G);
 
Copy content gap:DerivedLength(G);
 
Copy content sage_gap:G.DerivedLength()
 

This group is nonabelian and a $p$-group (hence nilpotent, solvable, supersolvable, monomial, elementary, and hyperelementary).

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 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 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 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 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 comment:Determine if the group G is simple
 
Copy content magma:IsSimple(G);
 
Copy content gap:IsSimpleGroup(G);
 
Copy content sage_gap:G.IsSimpleGroup()
 

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))
 

Order 1 2 4 8
Elements 1 255 1536 256 2048
Conjugacy classes   1 49 154 8 212
Divisions 1 49 103 6 159
Autjugacy classes 1 21 37 2 61

Minimal presentations

Permutation degree:not computed
Transitive degree:not computed
Rank: $5$
Inequivalent generating 5-tuples: not computed

Minimal degrees of faithful linear representations

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

Constructions

Show commands: Gap / Magma / SageMath


Presentation: ${\langle a, b, c, d, e, f, g \mid a^{4}=c^{4}=d^{4}=e^{2}=f^{4}=g^{2}=[a,b]= \!\cdots\! \rangle}$ Copy content Toggle raw display
Copy content comment:Define the group with the given generators and relations
 
Copy content magma:G := PCGroup([11, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 22, 12696, 17185, 124, 4779, 2414, 445, 192, 11116, 5583, 36637, 18344, 10337, 4804, 679, 294, 5873]); a,b,c,d,e,f,g := Explode([G.1, G.3, G.4, G.6, G.8, G.9, G.11]); AssignNames(~G, ["a", "a2", "b", "c", "c2", "d", "d2", "e", "f", "f2", "g"]);
 
Copy content gap:G := PcGroupCode(7070840823869233431361319832255775671574661617292883210933703467771887917,2048); a := G.1; b := G.3; c := G.4; d := G.6; e := G.8; f := G.9; g := 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(7070840823869233431361319832255775671574661617292883210933703467771887917,2048)'); a = G.1; b = G.3; c = G.4; d = G.6; e = G.8; f = G.9; g = 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(7070840823869233431361319832255775671574661617292883210933703467771887917,2048)'); a = G.1; b = G.3; c = G.4; d = G.6; e = G.8; f = G.9; g = G.11;
 
Permutation group:Degree $20$ $\langle(2,6)(3,8)(11,16)(13,18), (1,17)(2,6)(3,8)(4,9)(7,12)(11,16)(13,18)(14,19) \!\cdots\! \rangle$ Copy content Toggle raw display
Copy content comment:Define the group as a permutation group
 
Copy content magma:G := PermutationGroup< 20 | (2,6)(3,8)(11,16)(13,18), (1,17)(2,6)(3,8)(4,9)(7,12)(11,16)(13,18)(14,19), (2,3)(6,8)(11,13)(16,18), (1,8,14,2)(3,19,6,17)(4,13,12,16)(7,11,9,18), (5,10,20,15), (1,12,19,9)(4,14,7,17)(6,8)(16,18), (1,19)(2,3)(4,7)(6,8)(9,12)(11,13)(14,17)(16,18), (2,8)(3,6)(4,7)(9,12)(11,16)(13,18), (2,6)(3,8)(4,9)(7,12) >;
 
Copy content gap:G := Group( (2,6)(3,8)(11,16)(13,18), (1,17)(2,6)(3,8)(4,9)(7,12)(11,16)(13,18)(14,19), (2,3)(6,8)(11,13)(16,18), (1,8,14,2)(3,19,6,17)(4,13,12,16)(7,11,9,18), (5,10,20,15), (1,12,19,9)(4,14,7,17)(6,8)(16,18), (1,19)(2,3)(4,7)(6,8)(9,12)(11,13)(14,17)(16,18), (2,8)(3,6)(4,7)(9,12)(11,16)(13,18), (2,6)(3,8)(4,9)(7,12) );
 
Copy content sage:G = PermutationGroup(['(2,6)(3,8)(11,16)(13,18)', '(1,17)(2,6)(3,8)(4,9)(7,12)(11,16)(13,18)(14,19)', '(2,3)(6,8)(11,13)(16,18)', '(1,8,14,2)(3,19,6,17)(4,13,12,16)(7,11,9,18)', '(5,10,20,15)', '(1,12,19,9)(4,14,7,17)(6,8)(16,18)', '(1,19)(2,3)(4,7)(6,8)(9,12)(11,13)(14,17)(16,18)', '(2,8)(3,6)(4,7)(9,12)(11,16)(13,18)', '(2,6)(3,8)(4,9)(7,12)'])
 
Direct product: not computed
Semidirect product: not computed
Trans. wreath product: not isomorphic to a non-trivial transitive wreath product
Possibly split product: $(D_4^2:D_4)$ . $C_4$ (16) $(D_4^2:C_4)$ . $D_4$ (4) $(C_4\times D_4^2)$ . $D_4$ (4) $(C_2^5.D_4)$ . $D_4$ all 338
Aut. group: $\Aut(C_{20}:Q_8)$ $\Aut((C_2^2\times C_4):C_{20})$

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

Homology

Abelianization: $C_{2}^{4} \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())
 
Schur multiplier: $C_{2}^{12}$
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()
 

There are 1744 normal subgroups (202 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\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()
 
Commutator: a subgroup isomorphic to $C_2^2\times D_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()
 
Frattini: a subgroup isomorphic to $D_4\times C_2^3$
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()
 
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()
 
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()
 
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()
 
2-Sylow subgroup: $P_{ 2 } \simeq$ $(C_4\times D_4^2).D_4$

Subgroup diagram and profile

Series

Derived series not computed
Copy content comment:Derived series of the group GF
 
Copy content magma:DerivedSeries(G);
 
Copy content gap:DerivedSeriesOfGroup(G);
 
Copy content sage:G.derived_series()
 
Copy content sage_gap:G.DerivedSeriesOfGroup()
 
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_gap:G.ChiefSeries()
 
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()
 
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()
 

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
 

Complex character table

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

Rational character table

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