Properties

Label 512.6344809
Order \( 2^{9} \)
Exponent \( 2^{2} \)
Nilpotent yes
Solvable yes
$\card{G^{\mathrm{ab}}}$ \( 2^{5} \)
$\card{Z(G)}$ \( 2^{3} \)
$\card{\Aut(G)}$ \( 2^{20} \)
$\card{\mathrm{Out}(G)}$ \( 2^{14} \)
Perm deg. $14$
Trans deg. $32$
Rank $5$

Related objects

Downloads

Learn more

Show commands: Gap / Magma / Oscar / SageMath

Copy content comment:Construction of abstract group
 
Copy content magma:G := SmallGroup(512, 6344809);
 
Copy content gap:G := SmallGroup(512, 6344809);
 
Copy content sage:G = PermutationGroup(['(2,6)(7,8)(9,10)(11,12)', '(2,7)(3,4)(10,12)(13,14)', '(1,2)(3,8)(4,6)(5,7)(9,10)(11,12)', '(1,3)(2,8)(4,5)(6,7)(9,10)(11,12)(13,14)', '(9,11)(10,12)(13,14)', '(2,7)(6,8)(9,11)(10,12)', '(1,4)(2,6)(3,5)(7,8)', '(1,5)(2,7)(3,4)(6,8)(9,11)(10,12)', '(1,5)(2,7)(3,4)(6,8)'])
 
Copy content sage_gap:G = libgap.SmallGroup(512, 6344809)
 
Copy content oscar:G = small_group(512, 6344809)
 

Group information

Description:$C_2^6:D_4$
Order: \(512\)\(\medspace = 2^{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: \(4\)\(\medspace = 2^{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_2^8.C_2^4.C_2^6.C_2^2$, of order \(1048576\)\(\medspace = 2^{20} \)
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 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)
 
Nilpotency class:$3$
Copy content comment:Nilpotency class of the group
 
Copy content magma:NilpotencyClass(G);
 
Copy content gap:if IsNilpotentGroup(G) then NilpotencyClassOfGroup(G); fi;
 
Copy content sage:libgap(G).NilpotencyClassOfGroup() if G.is_nilpotent() else -1
 
Copy content sage_gap:G.NilpotencyClassOfGroup() if G.IsNilpotentGroup() else -1
 
Copy content oscar:if is_nilpotent(G) nilpotency_class(G) end
 
Derived length:$2$
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, a $p$-group (hence nilpotent, solvable, supersolvable, monomial, elementary, and hyperelementary), metabelian, and rational.

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 4
Elements 1 191 320 512
Conjugacy classes   1 57 34 92
Divisions 1 57 34 92
Autjugacy classes 1 14 6 21

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
Irr. complex chars.   32 40 20 92
Irr. rational chars. 32 40 20 92

Minimal presentations

Permutation degree:$14$
Transitive degree:$32$
Rank: $5$
Inequivalent generating 5-tuples: $9999360$

Minimal degrees of faithful linear representations

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

Constructions

Show commands: Gap / Magma / Oscar / SageMath


Presentation: ${\langle a, b, c, d, e, f, g \mid a^{2}=b^{4}=c^{4}=d^{2}=e^{2}=f^{2}=g^{2}= \!\cdots\! \rangle}$ Copy content Toggle raw display
Copy content comment:Define the group with the given generators and relations
 
Copy content magma:G := PCGroup([9, 2, 2, 2, 2, 2, 2, 2, 2, 2, 109, 46, 3171, 2172, 525, 102, 3543, 5776, 1474, 11681, 2951]); a,b,c,d,e,f,g := Explode([G.1, G.2, G.4, G.6, G.7, G.8, G.9]); AssignNames(~G, ["a", "b", "b2", "c", "c2", "d", "e", "f", "g"]);
 
Copy content gap:G := PcGroupCode(174566849373059514142597227006597371397386,512); a := G.1; b := G.2; c := G.4; d := G.6; e := G.7; f := G.8; g := G.9;
 
Copy content sage:# This uses Sage's interface to GAP, as Sage (currently) has no native support for PC groups G = gap.new('PcGroupCode(174566849373059514142597227006597371397386,512)'); a = G.1; b = G.2; c = G.4; d = G.6; e = G.7; f = G.8; g = G.9;
 
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(174566849373059514142597227006597371397386,512)'); a = G.1; b = G.2; c = G.4; d = G.6; e = G.7; f = G.8; g = G.9;
 
Permutation group:Degree $14$ $\langle(2,6)(7,8)(9,10)(11,12), (2,7)(3,4)(10,12)(13,14), (1,2)(3,8)(4,6)(5,7) \!\cdots\! \rangle$ Copy content Toggle raw display
Copy content comment:Define the group as a permutation group
 
Copy content magma:G := PermutationGroup< 14 | (2,6)(7,8)(9,10)(11,12), (2,7)(3,4)(10,12)(13,14), (1,2)(3,8)(4,6)(5,7)(9,10)(11,12), (1,3)(2,8)(4,5)(6,7)(9,10)(11,12)(13,14), (9,11)(10,12)(13,14), (2,7)(6,8)(9,11)(10,12), (1,4)(2,6)(3,5)(7,8), (1,5)(2,7)(3,4)(6,8)(9,11)(10,12), (1,5)(2,7)(3,4)(6,8) >;
 
Copy content gap:G := Group( (2,6)(7,8)(9,10)(11,12), (2,7)(3,4)(10,12)(13,14), (1,2)(3,8)(4,6)(5,7)(9,10)(11,12), (1,3)(2,8)(4,5)(6,7)(9,10)(11,12)(13,14), (9,11)(10,12)(13,14), (2,7)(6,8)(9,11)(10,12), (1,4)(2,6)(3,5)(7,8), (1,5)(2,7)(3,4)(6,8)(9,11)(10,12), (1,5)(2,7)(3,4)(6,8) );
 
Copy content sage:G = PermutationGroup(['(2,6)(7,8)(9,10)(11,12)', '(2,7)(3,4)(10,12)(13,14)', '(1,2)(3,8)(4,6)(5,7)(9,10)(11,12)', '(1,3)(2,8)(4,5)(6,7)(9,10)(11,12)(13,14)', '(9,11)(10,12)(13,14)', '(2,7)(6,8)(9,11)(10,12)', '(1,4)(2,6)(3,5)(7,8)', '(1,5)(2,7)(3,4)(6,8)(9,11)(10,12)', '(1,5)(2,7)(3,4)(6,8)'])
 
Copy content sage_gap:G = gap.new('Group( (2,6)(7,8)(9,10)(11,12), (2,7)(3,4)(10,12)(13,14), (1,2)(3,8)(4,6)(5,7)(9,10)(11,12), (1,3)(2,8)(4,5)(6,7)(9,10)(11,12)(13,14), (9,11)(10,12)(13,14), (2,7)(6,8)(9,11)(10,12), (1,4)(2,6)(3,5)(7,8), (1,5)(2,7)(3,4)(6,8)(9,11)(10,12), (1,5)(2,7)(3,4)(6,8) )')
 
Copy content oscar:G = @permutation_group(14, (2,6)(7,8)(9,10)(11,12), (2,7)(3,4)(10,12)(13,14), (1,2)(3,8)(4,6)(5,7)(9,10)(11,12), (1,3)(2,8)(4,5)(6,7)(9,10)(11,12)(13,14), (9,11)(10,12)(13,14), (2,7)(6,8)(9,11)(10,12), (1,4)(2,6)(3,5)(7,8), (1,5)(2,7)(3,4)(6,8)(9,11)(10,12), (1,5)(2,7)(3,4)(6,8))
 
Direct product: $C_2$ $\, \times\, $ $(C_2^5:D_4)$
Semidirect product: $C_2^6$ $\,\rtimes\,$ $D_4$ $C_2^7$ $\,\rtimes\,$ $C_2^2$ $C_2^6$ $\,\rtimes\,$ $C_2^3$ $(C_2^3:D_4)$ $\,\rtimes\,$ $D_4$ (2) all 53
Trans. wreath product: not isomorphic to a non-trivial transitive wreath product
Non-split product: $C_2^3$ . $D_4^2$ (2) $C_2^6$ . $C_2^3$ (2) $C_2^5$ . $C_2^4$ (3) $C_2^4$ . $C_2^5$ all 30
Aut. group: $\Aut(\OD_{16}:C_4)$ $\Aut((C_2^2\times C_8):C_2)$ $\Aut(C_4^2.C_2^2)$ $\Aut(C_4^2:C_6)$ all 8

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

Homology

Abelianization: $C_{2}^{5} $
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}^{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()
 
Copy content oscar:subgroups(G)
 

There are 51506 subgroups in 14992 conjugacy classes, 754 normal (34 characteristic).

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

Special subgroups

Center: $Z \simeq$ $C_2^3$ $G/Z \simeq$ $C_2^3:D_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_2^4$ $G/G' \simeq$ $C_2^5$
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_2^4$ $G/\Phi \simeq$ $C_2^5$
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_2^6:D_4$ $G/\operatorname{Fit} \simeq$ $C_1$
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_2^6:D_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_2^3$ $G/\operatorname{soc} \simeq$ $C_2^3:D_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^6:D_4$

Subgroup diagram and profile

Series

Derived series $C_2^6:D_4$ $\rhd$ $C_2^4$ $\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_2^6:D_4$ $\rhd$ $C_2^5:D_4$ $\rhd$ $C_2^3\wr C_2$ $\rhd$ $C_2^3:D_4$ $\rhd$ $C_2^2\times D_4$ $\rhd$ $C_2^4$ $\rhd$ $C_2^3$ $\rhd$ $C_2^2$ $\rhd$ $C_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_2^6:D_4$ $\rhd$ $C_2^4$ $\rhd$ $C_2$ $\rhd$ $C_1$
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$ $\lhd$ $C_2^3$ $\lhd$ $C_2^6$ $\lhd$ $C_2^6:D_4$
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 6 larger groups in the database.

This group is a maximal quotient of 4 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

Every character has rational values, so the complex character table is the same as the rational character table below.

Rational character table

See the $92 \times 92$ rational character table. Alternatively, you may search for characters of this group with desired properties.