LMFDB - Abstract group 8192.wy: $C_2^{10}.D

comment:Define the group as a permutation group

magma:G := PermutationGroup< 20 | (8,15)(10,16)(12,18)(13,19), (1,12)(2,6)(3,8)(4,9)(5,18)(7,15)(10,16)(13,19), (1,3)(2,4)(5,7)(6,9)(10,13)(16,19), (1,3)(2,6)(4,9)(5,7)(8,18)(10,19)(12,15)(13,16), (11,14)(17,20), (1,5)(3,7)(8,15)(10,16)(12,18)(13,19), (1,3)(2,4)(5,7)(6,9)(8,12)(15,18), (1,5)(2,6)(3,7)(4,9)(10,16)(13,19), (1,3)(5,7)(8,12)(10,13)(15,18)(16,19), (1,10,18,4,5,13,12,2)(3,16,15,9,7,19,8,6)(14,17), (2,4)(6,9)(8,12)(10,13)(15,18)(16,19), (11,17)(14,20) >;

gap:G := Group( (8,15)(10,16)(12,18)(13,19), (1,12)(2,6)(3,8)(4,9)(5,18)(7,15)(10,16)(13,19), (1,3)(2,4)(5,7)(6,9)(10,13)(16,19), (1,3)(2,6)(4,9)(5,7)(8,18)(10,19)(12,15)(13,16), (11,14)(17,20), (1,5)(3,7)(8,15)(10,16)(12,18)(13,19), (1,3)(2,4)(5,7)(6,9)(8,12)(15,18), (1,5)(2,6)(3,7)(4,9)(10,16)(13,19), (1,3)(5,7)(8,12)(10,13)(15,18)(16,19), (1,10,18,4,5,13,12,2)(3,16,15,9,7,19,8,6)(14,17), (2,4)(6,9)(8,12)(10,13)(15,18)(16,19), (11,17)(14,20) );

sage:G = PermutationGroup(['(8,15)(10,16)(12,18)(13,19)', '(1,12)(2,6)(3,8)(4,9)(5,18)(7,15)(10,16)(13,19)', '(1,3)(2,4)(5,7)(6,9)(10,13)(16,19)', '(1,3)(2,6)(4,9)(5,7)(8,18)(10,19)(12,15)(13,16)', '(11,14)(17,20)', '(1,5)(3,7)(8,15)(10,16)(12,18)(13,19)', '(1,3)(2,4)(5,7)(6,9)(8,12)(15,18)', '(1,5)(2,6)(3,7)(4,9)(10,16)(13,19)', '(1,3)(5,7)(8,12)(10,13)(15,18)(16,19)', '(1,10,18,4,5,13,12,2)(3,16,15,9,7,19,8,6)(14,17)', '(2,4)(6,9)(8,12)(10,13)(15,18)(16,19)', '(11,17)(14,20)'])

sage_gap:# This uses Sage's interface to GAP, as Sage (currently) has no native support for PC groups G = gap.new('PcGroupCode(29727309218498437082027581886779596488827248641415259081989795200570909623097363789108595848626321662267209454257825968463238486223287752683534,8192)'); a = G.1; b = G.2; c = G.4; d = G.6; e = G.7; f = G.8; g = G.9; h = G.10; i = G.11; j = G.12; k = G.13;

Group information

Description:	$C_2^{10}.D_4$
Order:	$8192$$\medspace = 2^{13} $	comment:Order of the group magma:Order(G); gap:Order(G); sage:G.order() sage_gap:G.Order()
Exponent:	$8$$\medspace = 2^{3} $	comment:Exponent of the group magma:Exponent(G); gap:Exponent(G); sage:G.exponent() sage_gap:G.Exponent()
Automorphism group:	Group of order $6442450944$$\medspace = 2^{31} \cdot 3 $	comment:Automorphism group gap:AutomorphismGroup(G); magma:AutomorphismGroup(G); sage_gap:G.AutomorphismGroup()
Composition factors:	$C_2$ x 13	comment:Composition factors of the group magma:CompositionFactors(G); gap:CompositionSeries(G); sage:G.composition_series() sage_gap:G.CompositionSeries()
Nilpotency class:	$4$	comment:Nilpotency class of the group magma:NilpotencyClass(G); gap:NilpotencyClassOfGroup(G); sage_gap:G.NilpotencyClassOfGroup()
Derived length:	$3$	comment:Derived length of the group magma:DerivedLength(G); gap:DerivedLength(G); sage_gap:G.DerivedLength()

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

comment:Determine if the group G is abelian

magma:IsAbelian(G);

gap:IsAbelian(G);

sage:G.is_abelian()

sage_gap:G.IsAbelian()

comment:Determine if the group G is cyclic

magma:IsCyclic(G);

gap:IsCyclic(G);

sage:G.is_cyclic()

sage_gap:G.IsCyclic()

comment:Determine if the group G is nilpotent

magma:IsNilpotent(G);

gap:IsNilpotentGroup(G);

sage:G.is_nilpotent()

sage_gap:G.IsNilpotentGroup()

comment:Determine if the group G is solvable

magma:IsSolvable(G);

gap:IsSolvableGroup(G);

sage:G.is_solvable()

sage_gap:G.IsSolvableGroup()

comment:Determine if the group G is supersolvable

gap:IsSupersolvableGroup(G);

sage:G.is_supersolvable()

sage_gap:G.IsSupersolvableGroup()

comment:Determine if the group G is simple

magma:IsSimple(G);

gap:IsSimpleGroup(G);

sage_gap:G.IsSimpleGroup()

Group statistics

comment:Compute statistics for the group G

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;

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

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	1663	4992	1536	8192
Conjugacy classes	1	253	174	6	434
Divisions	1	253	174	6	434
Autjugacy classes	1	16	11	1	29

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, h, i, j, k \mid a^{2}=c^{4}=d^{2}=e^{2}=f^{2}= \!\cdots\! \rangle}$ < a, b, c, d, e, f, g, h, i, j, k \| a^2,c^4,d^2,e^2,f^2,g^2,h^2,i^2,j^2,k^2,[a,e],[a,i],[a,k],[b,i],[b,k],[c,e],[c,i],[c,k],[d,e],[d,f],[d,g],[d,h],[d,i],[d,j],[d,k],[e,f],[e,g],[e,h],[e,i],[e,j],[e,k],[f,g],[f,h],[f,i],[f,j],[f,k],[g,h],[g,i],[g,j],[g,k],[h,i],[h,j],[h,k],[i,j],[i,k],[j,k], ib^-4, b^3c^2defgja^-1b^-1a, c^3a^-1c^-1a, c^2eja^-1d^-1a, defja^-1f^-1a, c^2ga^-1g^-1a, c^2dehja^-1h^-1a, c^2dea^-1j^-1a, cdegjb^-1c^-1b, c^2efijb^-1d^-1b, ekb^-1e^-1b, efhjb^-1f^-1b, c^2dghib^-1g^-1b, c^2defhijb^-1h^-1b, c^2efhikb^-1j^-1b, dehijc^-1d^-1c, dfhc^-1f^-1c, dghic^-1g^-1c, eijc^-1h^-1c, ehic^-1j^-1c >
comment:Define the group with the given generators and relations magma:G := PCGroup([13, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 66301, 66, 84398, 10012, 1251, 62624, 13653, 146, 51497, 165989, 127938, 71791, 35924, 189299, 236295, 143124, 17505, 8782, 31832, 107661, 53386, 26723, 347369, 248582, 101955, 51008, 17483, 455544, 62437, 31250]); a,b,c,d,e,f,g,h,i,j,k := Explode([G.1, G.2, G.4, G.6, G.7, G.8, G.9, G.10, G.11, G.12, G.13]); AssignNames(~G, ["a", "b", "b2", "c", "c2", "d", "e", "f", "g", "h", "i", "j", "k"]); gap:G := PcGroupCode(29727309218498437082027581886779596488827248641415259081989795200570909623097363789108595848626321662267209454257825968463238486223287752683534,8192); a := G.1; b := G.2; c := G.4; d := G.6; e := G.7; f := G.8; g := G.9; h := G.10; i := G.11; j := G.12; k := G.13; sage:# This uses Sage's interface to GAP, as Sage (currently) has no native support for PC groups G = gap.new('PcGroupCode(29727309218498437082027581886779596488827248641415259081989795200570909623097363789108595848626321662267209454257825968463238486223287752683534,8192)'); a = G.1; b = G.2; c = G.4; d = G.6; e = G.7; f = G.8; g = G.9; h = G.10; i = G.11; j = G.12; k = G.13; sage_gap:# This uses Sage's interface to GAP, as Sage (currently) has no native support for PC groups G = gap.new('PcGroupCode(29727309218498437082027581886779596488827248641415259081989795200570909623097363789108595848626321662267209454257825968463238486223287752683534,8192)'); a = G.1; b = G.2; c = G.4; d = G.6; e = G.7; f = G.8; g = G.9; h = G.10; i = G.11; j = G.12; k = G.13;
Permutation group:	Degree $20$ $\langle(8,15)(10,16)(12,18)(13,19), (1,12)(2,6)(3,8)(4,9)(5,18)(7,15)(10,16)(13,19) \!\cdots\! \rangle$ (8,15)(10,16)(12,18)(13,19), (1,12)(2,6)(3,8)(4,9)(5,18)(7,15)(10,16)(13,19), (1,3)(2,4)(5,7)(6,9)(10,13)(16,19), (1,3)(2,6)(4,9)(5,7)(8,18)(10,19)(12,15)(13,16), (11,14)(17,20), (1,5)(3,7)(8,15)(10,16)(12,18)(13,19), (1,3)(2,4)(5,7)(6,9)(8,12)(15,18), (1,5)(2,6)(3,7)(4,9)(10,16)(13,19), (1,3)(5,7)(8,12)(10,13)(15,18)(16,19), (1,10,18,4,5,13,12,2)(3,16,15,9,7,19,8,6)(14,17), (2,4)(6,9)(8,12)(10,13)(15,18)(16,19), (11,17)(14,20)
comment:Define the group as a permutation group magma:G := PermutationGroup< 20 \| (8,15)(10,16)(12,18)(13,19), (1,12)(2,6)(3,8)(4,9)(5,18)(7,15)(10,16)(13,19), (1,3)(2,4)(5,7)(6,9)(10,13)(16,19), (1,3)(2,6)(4,9)(5,7)(8,18)(10,19)(12,15)(13,16), (11,14)(17,20), (1,5)(3,7)(8,15)(10,16)(12,18)(13,19), (1,3)(2,4)(5,7)(6,9)(8,12)(15,18), (1,5)(2,6)(3,7)(4,9)(10,16)(13,19), (1,3)(5,7)(8,12)(10,13)(15,18)(16,19), (1,10,18,4,5,13,12,2)(3,16,15,9,7,19,8,6)(14,17), (2,4)(6,9)(8,12)(10,13)(15,18)(16,19), (11,17)(14,20) >; gap:G := Group( (8,15)(10,16)(12,18)(13,19), (1,12)(2,6)(3,8)(4,9)(5,18)(7,15)(10,16)(13,19), (1,3)(2,4)(5,7)(6,9)(10,13)(16,19), (1,3)(2,6)(4,9)(5,7)(8,18)(10,19)(12,15)(13,16), (11,14)(17,20), (1,5)(3,7)(8,15)(10,16)(12,18)(13,19), (1,3)(2,4)(5,7)(6,9)(8,12)(15,18), (1,5)(2,6)(3,7)(4,9)(10,16)(13,19), (1,3)(5,7)(8,12)(10,13)(15,18)(16,19), (1,10,18,4,5,13,12,2)(3,16,15,9,7,19,8,6)(14,17), (2,4)(6,9)(8,12)(10,13)(15,18)(16,19), (11,17)(14,20) ); sage:G = PermutationGroup(['(8,15)(10,16)(12,18)(13,19)', '(1,12)(2,6)(3,8)(4,9)(5,18)(7,15)(10,16)(13,19)', '(1,3)(2,4)(5,7)(6,9)(10,13)(16,19)', '(1,3)(2,6)(4,9)(5,7)(8,18)(10,19)(12,15)(13,16)', '(11,14)(17,20)', '(1,5)(3,7)(8,15)(10,16)(12,18)(13,19)', '(1,3)(2,4)(5,7)(6,9)(8,12)(15,18)', '(1,5)(2,6)(3,7)(4,9)(10,16)(13,19)', '(1,3)(5,7)(8,12)(10,13)(15,18)(16,19)', '(1,10,18,4,5,13,12,2)(3,16,15,9,7,19,8,6)(14,17)', '(2,4)(6,9)(8,12)(10,13)(15,18)(16,19)', '(11,17)(14,20)'])
Direct product:	not computed
Semidirect product:	not computed
Trans. wreath product:	not computed
Possibly split product:	$C_2^{10}$ . $D_4$	$(C_2^9.D_4)$ . $C_2$ (8)	$(C_2^9.D_4)$ . $C_2$ (8)	$(C_2^9.C_2)$ . $D_4$ (4)	all 127
Aut. group:	$\Aut(D_4^2:C_2)$	$\Aut(D_4^2:C_2)$	$\Aut(Q_8^2:C_2)$

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

Homology

Abelianization:	$C_{2}^{5} $	comment:The abelianization of the group magma:quo< G \| CommutatorSubgroup(G) >; gap:FactorGroup(G, DerivedSubgroup(G)); sage:G.quotient(G.commutator())
Schur multiplier:	$C_{2}^{17}$	comment:The Schur multiplier of the group gap:AbelianInvariantsMultiplier(G); sage:G.homology(2) sage_gap:G.AbelianInvariantsMultiplier()
Commutator length:	$1$	comment:The commutator length of the group gap:CommutatorLength(G); sage_gap:G.CommutatorLength()

Subgroups

comment:List of subgroups of the group

magma:Subgroups(G);

gap:AllSubgroups(G);

sage:G.subgroups()

sage_gap:G.AllSubgroups()

There are 2722 normal subgroups (27 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^3$	comment:Center of the group magma:Center(G); gap:Center(G); sage:G.center() sage_gap:G.Center()
Commutator:	a subgroup isomorphic to $C_2^5:D_4$	comment:Commutator subgroup of the group G magma:CommutatorSubgroup(G); gap:DerivedSubgroup(G); sage:G.commutator() sage_gap:G.DerivedSubgroup()
Frattini:	a subgroup isomorphic to $C_2^5:D_4$	comment:Frattini subgroup of the group G magma:FrattiniSubgroup(G); gap:FrattiniSubgroup(G); sage:G.frattini_subgroup() sage_gap:G.FrattiniSubgroup()
Fitting:	not computed	comment:Fitting subgroup of the group G magma:FittingSubgroup(G); gap:FittingSubgroup(G); sage:G.fitting_subgroup() sage_gap:G.FittingSubgroup()
Radical:	not computed	comment:Radical of the group G magma:Radical(G); gap:SolvableRadical(G); sage_gap:G.SolvableRadical()
Socle:	not computed	comment:Socle of the group G magma:Socle(G); gap:Socle(G); sage:G.socle() sage_gap:G.Socle()
2-Sylow subgroup:	$P_{ 2 } \simeq$ $C_2^{10}.D_4$

Subgroup diagram and profile

Series

Derived series

not computed

comment:Derived series of the group GF

magma:DerivedSeries(G);

gap:DerivedSeriesOfGroup(G);

sage:G.derived_series()

sage_gap:G.DerivedSeriesOfGroup()

Chief series

not computed

comment:Chief series of the group G

magma:ChiefSeries(G);

gap:ChiefSeries(G);

sage_gap:G.ChiefSeries()

Lower central series

not computed

comment:The lower central series of the group G

magma:LowerCentralSeries(G);

gap:LowerCentralSeriesOfGroup(G);

sage:G.lower_central_series()

sage_gap:G.LowerCentralSeriesOfGroup()

Upper central series

not computed

comment:The upper central series of the group G

magma:UpperCentralSeries(G);

gap:UpperCentralSeriesOfGroup(G);

sage:G.upper_central_series()

sage_gap:G.UpperCentralSeriesOfGroup()

Supergroups

This group is a maximal subgroup of 6 larger groups in the database.

This group is a maximal quotient of 0 larger groups in the database.

Character theory

comment:Character table

magma:CharacterTable(G); // Output not guaranteed to exactly match the LMFDB table

gap:CharacterTable(G); # Output not guaranteed to exactly match the LMFDB table

sage:G.character_table() # Output not guaranteed to exactly match the LMFDB table

sage_gap:G.CharacterTable() # 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

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

Overview	Random
Universe	Knowledge

Classical	Maass
Hilbert	Bianchi

Elliptic curves over $\Q$
Elliptic curves over $\Q(\alpha)$
Genus 2 curves over $\Q$
Higher genus families
Abelian varieties over $\F_{q}$
Belyi maps

Label	8192.wy
Order	\( 2^{13} \)
Exponent	\( 2^{3} \)

Nilpotent	yes
Solvable	yes
$\card{G^{\mathrm{ab}}}$	\( 2^{5} \)
$\card{Z(G)}$	8
$\card{\Aut(G)}$	\( 2^{31} \cdot 3 \)
$\card{\mathrm{Out}(G)}$	\( 2^{21} \cdot 3 \)
Perm deg.	not computed
Trans deg.	not computed
Rank	$5$

Introduction

L-functions

Modular forms

Varieties

Fields

Representations

Groups

Database

Properties

Related objects

Downloads

Learn more

Group information

Group statistics

Minimal presentations

Minimal degrees of faithful linear representations

Constructions

Homology

Subgroups

Special subgroups

Subgroup diagram and profile

Classes of subgroups up to conjugation

Classes of subgroups up to automorphism

Normal subgroups

Normal subgroups up to automorphism

Classes of subgroups up to conjugation

Classes of subgroups up to automorphism

Normal subgroups (quotient in parentheses)

Normal subgroups up to automorphism (quotient in parentheses)

Series

Supergroups

Character theory

Complex character table

Rational character table

This project is supported by grants from the US National Science Foundation, the UK Engineering and Physical Sciences Research Council, and the Simons Foundation.