LMFDB - Abstract group 32.11: $C_4\wr C

Show commands: Gap / Magma / Oscar / SageMath

comment:Construction of abstract group

magma:G := COPlus(2,5);

gap:G := SmallGroup(32, 11);

sage:G = PermutationGroup(['(1,6,4,7,2,5,3,8)', '(1,5)(2,6)(3,7)(4,8)', '(1,4,2,3)(5,7,6,8)', '(1,4,2,3)(5,8,6,7)', '(1,2)(3,4)(5,6)(7,8)'])

sage_gap:G = libgap.SmallGroup(32, 11)

oscar:G = small_group(32, 11)

Group information

Description:	$C_4\wr C_2$
Order:	$32$$\medspace = 2^{5} $	comment:Order of the group magma:Order(G); gap:Order(G); sage:G.order() sage_gap:G.Order() oscar:order(G)
Exponent:	$8$$\medspace = 2^{3} $	comment:Exponent of the group magma:Exponent(G); gap:Exponent(G); sage:G.exponent() sage_gap:G.Exponent() oscar:exponent(G)
Automorphism group:	$C_2^2\times D_4$, of order $32$$\medspace = 2^{5} $	comment:Automorphism group gap:AutomorphismGroup(G); magma:AutomorphismGroup(G); sage:libgap(G).AutomorphismGroup() sage_gap:G.AutomorphismGroup() oscar:automorphism_group(G)
Composition factors:	$C_2$ x 5	comment:Composition factors of the group magma:CompositionFactors(G); gap:CompositionSeries(G); sage:G.composition_series() sage_gap:G.CompositionSeries() oscar:composition_series(G)
Nilpotency class:	$3$	comment:Nilpotency class of the group magma:NilpotencyClass(G); gap:if IsNilpotentGroup(G) then NilpotencyClassOfGroup(G); fi; sage:libgap(G).NilpotencyClassOfGroup() if G.is_nilpotent() else -1 sage_gap:G.NilpotencyClassOfGroup() if G.IsNilpotentGroup() else -1 oscar:if is_nilpotent(G) nilpotency_class(G) end
Derived length:	$2$	comment:Derived length of the group magma:DerivedLength(G); gap:DerivedLength(G); sage:libgap(G).DerivedLength() sage_gap:G.DerivedLength() oscar:derived_length(G)

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

comment:Determine if the group G is abelian

magma:IsAbelian(G);

gap:IsAbelian(G);

sage:G.is_abelian()

sage_gap:G.IsAbelian()

oscar:is_abelian(G)

comment:Determine if the group G is cyclic

magma:IsCyclic(G);

gap:IsCyclic(G);

sage:G.is_cyclic()

sage_gap:G.IsCyclic()

oscar:is_cyclic(G)

comment:Determine if the group G is nilpotent

magma:IsNilpotent(G);

gap:IsNilpotentGroup(G);

sage:G.is_nilpotent()

sage_gap:G.IsNilpotentGroup()

oscar:is_nilpotent(G)

comment:Determine if the group G is solvable

magma:IsSolvable(G);

gap:IsSolvableGroup(G);

sage:G.is_solvable()

sage_gap:G.IsSolvableGroup()

oscar:is_solvable(G)

comment:Determine if the group G is supersolvable

gap:IsSupersolvableGroup(G);

sage:G.is_supersolvable()

sage_gap:G.IsSupersolvableGroup()

oscar:is_supersolvable(G)

comment:Determine if the group G is simple

magma:IsSimple(G);

gap:IsSimpleGroup(G);

sage:G.is_simple()

sage_gap:G.IsSimpleGroup()

oscar:is_simple(G)

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

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

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	8
Elements	1	7	16	8	32
Conjugacy classes	1	3	8	2	14
Divisions	1	3	5	1	10
Autjugacy classes	1	3	4	1	9

comment:Compute statistics about the characters of G

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

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

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

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

oscar:# Outputs an MSet containing the absolutely irreducible degrees of G and their multiplicities. character_degrees(G)

Dimension	1	2	4
Irr. complex chars.	8	6	0	14
Irr. rational chars.	4	4	2	10

Minimal presentations

Permutation degree:	$8$
Transitive degree:	$8$
Rank:	$2$
Inequivalent generating pairs:	$12$

Minimal degrees of faithful linear representations

	Over $\mathbb{C}$	Over $\mathbb{R}$	Over $\mathbb{Q}$
Irreducible	2	4	4
Arbitrary	2	4	4

Constructions

Show commands: Gap / Magma / Oscar / SageMath

Groups of Lie type:	$\GOrthPlus(2,5)$
magma:G := COPlus(2,5); gap:G := Group([[[ Z(5), 0Z(5) ], [ 0Z(5), Z(5)^3 ]], [[ 0Z(5), Z(5)^2 ], [ Z(5)^2, 0Z(5) ]], [[ Z(5), 0Z(5) ], [ 0Z(5), Z(5)^0 ]]]); sage:MS = MatrixSpace(GF(5), 2, 2) G = MatrixGroup([MS([[2, 0], [0, 3]]), MS([[0, 4], [4, 0]]), MS([[2, 0], [0, 1]])]) oscar:G = matrix_group([matrix(GF(5), [[2, 0], [0, 3]]), matrix(GF(5), [[0, 4], [4, 0]]), matrix(GF(5), [[2, 0], [0, 1]])])
Presentation:	$\langle a, b, c \mid a^{2}=b^{4}=c^{4}=[a,b]=[b,c]=1, c^{a}=b^{3}c^{3} \rangle$ < a, b, c \| a^2,b^4,c^4,[a,b],[b,c], b^3c^3a^-1c^-1a >
comment:Define the group with the given generators and relations magma:G := PCGroup([5, 2, 2, 2, 2, 2, 26, 603, 58, 504]); a,b,c := Explode([G.1, G.2, G.4]); AssignNames(~G, ["a", "b", "b2", "c", "c2"]); gap:G := PcGroupCode(2366177482,32); a := G.1; b := G.2; c := G.4; sage:# This uses Sage's interface to GAP, as Sage (currently) has no native support for PC groups G = gap.new('PcGroupCode(2366177482,32)'); a = G.1; b = G.2; c = G.4; sage_gap:# This uses Sage's interface to GAP, as Sage (currently) has no native support for PC groups G = gap.new('PcGroupCode(2366177482,32)'); a = G.1; b = G.2; c = G.4;
Permutation group:	$\langle(1,6,4,7,2,5,3,8), (1,5)(2,6)(3,7)(4,8), (1,4,2,3)(5,7,6,8), (1,4,2,3)(5,8,6,7), (1,2)(3,4)(5,6)(7,8)\rangle$ (1,6,4,7,2,5,3,8), (1,5)(2,6)(3,7)(4,8), (1,4,2,3)(5,7,6,8), (1,4,2,3)(5,8,6,7), (1,2)(3,4)(5,6)(7,8)
comment:Define the group as a permutation group magma:G := PermutationGroup< 8 \| (1,6,4,7,2,5,3,8), (1,5)(2,6)(3,7)(4,8), (1,4,2,3)(5,7,6,8), (1,4,2,3)(5,8,6,7), (1,2)(3,4)(5,6)(7,8) >; gap:G := Group( (1,6,4,7,2,5,3,8), (1,5)(2,6)(3,7)(4,8), (1,4,2,3)(5,7,6,8), (1,4,2,3)(5,8,6,7), (1,2)(3,4)(5,6)(7,8) ); sage:G = PermutationGroup(['(1,6,4,7,2,5,3,8)', '(1,5)(2,6)(3,7)(4,8)', '(1,4,2,3)(5,7,6,8)', '(1,4,2,3)(5,8,6,7)', '(1,2)(3,4)(5,6)(7,8)']) sage_gap:G = gap.new('Group( (1,6,4,7,2,5,3,8), (1,5)(2,6)(3,7)(4,8), (1,4,2,3)(5,7,6,8), (1,4,2,3)(5,8,6,7), (1,2)(3,4)(5,6)(7,8) )') oscar:G = @permutation_group(8, (1,6,4,7,2,5,3,8), (1,5)(2,6)(3,7)(4,8), (1,4,2,3)(5,7,6,8), (1,4,2,3)(5,8,6,7), (1,2)(3,4)(5,6)(7,8))
Matrix group:	$\left\langle \left(\begin{array}{rrrr} 0 & 1 & 0 & 1 \\ 0 & 0 & -1 & 0 \\ 0 & 1 & 0 & 0 \\ -1 & 0 & 1 & 0 \end{array}\right), \left(\begin{array}{rrrr} 1 & 0 & 0 & 0 \\ 0 & 0 & 0 & -1 \\ 0 & 1 & 1 & 1 \\ 0 & 0 & -1 & 0 \end{array}\right) \right\rangle \subseteq \GL_{4}(\Z)$
comment:Define the group as a matrix group with coefficients in Z magma:G := MatrixGroup< 4, Integers() \| [[0, 1, 0, 1, 0, 0, -1, 0, 0, 1, 0, 0, -1, 0, 1, 0], [1, 0, 0, 0, 0, 0, 0, -1, 0, 1, 1, 1, 0, 0, -1, 0]] >; gap:G := Group([[[0, 1, 0, 1], [0, 0, -1, 0], [0, 1, 0, 0], [-1, 0, 1, 0]], [[1, 0, 0, 0], [0, 0, 0, -1], [0, 1, 1, 1], [0, 0, -1, 0]]]); sage:MS = MatrixSpace(Integers(), 4, 4) G = MatrixGroup([MS([[0, 1, 0, 1], [0, 0, -1, 0], [0, 1, 0, 0], [-1, 0, 1, 0]]), MS([[1, 0, 0, 0], [0, 0, 0, -1], [0, 1, 1, 1], [0, 0, -1, 0]])]) sage_gap:G = gap.new('Group([[[0, 1, 0, 1], [0, 0, -1, 0], [0, 1, 0, 0], [-1, 0, 1, 0]], [[1, 0, 0, 0], [0, 0, 0, -1], [0, 1, 1, 1], [0, 0, -1, 0]]])') oscar:G = matrix_group([matrix(ZZ, [[0, 1, 0, 1], [0, 0, -1, 0], [0, 1, 0, 0], [-1, 0, 1, 0]]), matrix(ZZ, [[1, 0, 0, 0], [0, 0, 0, -1], [0, 1, 1, 1], [0, 0, -1, 0]])])
	$\left\langle \left(\begin{array}{rr} 0 & 1 \\ 1 & 0 \end{array}\right), \left(\begin{array}{rr} 1 & 0 \\ 0 & 2 \end{array}\right), \left(\begin{array}{rr} 2 & 0 \\ 0 & 3 \end{array}\right) \right\rangle \subseteq \GL_{2}(\F_{5})$
comment:Define the group as a matrix group with coefficients in GLFp magma:G := MatrixGroup< 2, GF(5) \| [[0, 1, 1, 0], [1, 0, 0, 2], [2, 0, 0, 3]] >; gap:G := Group([[[ 0Z(5), Z(5)^0 ], [ Z(5)^0, 0Z(5) ]], [[ Z(5)^0, 0Z(5) ], [ 0Z(5), Z(5) ]], [[ Z(5), 0Z(5) ], [ 0Z(5), Z(5)^3 ]]]); sage:MS = MatrixSpace(GF(5), 2, 2) G = MatrixGroup([MS([[0, 1], [1, 0]]), MS([[1, 0], [0, 2]]), MS([[2, 0], [0, 3]])]) sage_gap:G = gap.new('Group([[[ 0Z(5), Z(5)^0 ], [ Z(5)^0, 0Z(5) ]], [[ Z(5)^0, 0Z(5) ], [ 0Z(5), Z(5) ]], [[ Z(5), 0Z(5) ], [ 0Z(5), Z(5)^3 ]]])') oscar:G = matrix_group([matrix(GF(5), [[0, 1], [1, 0]]), matrix(GF(5), [[1, 0], [0, 2]]), matrix(GF(5), [[2, 0], [0, 3]])])
Transitive group:	8T17	16T28	16T42	32T14	more information
magma:G := TransitiveGroup(8, 17); gap:G := TransitiveGroup(8, 17); sage:G = TransitiveGroup(8, 17) sage_gap:G = libgap.TransitiveGroup(8, 17) oscar:G = transitive_group(8, 17) magma:G := TransitiveGroup(16, 28); gap:G := TransitiveGroup(16, 28); sage:G = TransitiveGroup(16, 28) sage_gap:G = libgap.TransitiveGroup(16, 28) oscar:G = transitive_group(16, 28) magma:G := TransitiveGroup(16, 42); gap:G := TransitiveGroup(16, 42); sage:G = TransitiveGroup(16, 42) sage_gap:G = libgap.TransitiveGroup(16, 42) oscar:G = transitive_group(16, 42) magma:G := TransitiveGroup(32, 14); gap:G := TransitiveGroup(32, 14); sage:G = TransitiveGroup(32, 14) sage_gap:G = libgap.TransitiveGroup(32, 14) oscar:G = transitive_group(32, 14)
Direct product:	not isomorphic to a non-trivial direct product
Semidirect product:	$Q_8$ $\,\rtimes\,$ $C_4$	$D_4$ $\,\rtimes\,$ $C_4$	$C_4^2$ $\,\rtimes\,$ $C_2$	$\OD_{16}$ $\,\rtimes\,$ $C_2$	more information
Trans. wreath product:	$C_4$$\ \wr\ $$C_2$
Non-split product:	$C_4$ . $D_4$	$C_2^2$ . $D_4$	$(D_4:C_2)$ . $C_2$	$C_4$ . $(C_2\times C_4)$	all 6

Elements of the group are displayed as matrices in $\GOrthPlus(2,5)$.

Homology

Abelianization:	$C_{2} \times C_{4} $	comment:The abelianization of the group magma:quo< G \| CommutatorSubgroup(G) >; gap:FactorGroup(G, DerivedSubgroup(G)); sage:G.quotient(G.commutator()) sage_gap:G.FactorGroup(G.DerivedSubgroup()) oscar:quo(G, derived_subgroup(G)[1])
Schur multiplier:	$C_{2}$	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()

oscar:subgroups(G)

There are 34 subgroups in 22 conjugacy classes, 12 normal, and all normal subgroups are characteristic.

Characteristic subgroups are shown in this color.

Special subgroups

Center:	$Z \simeq$ $C_4$	$G/Z \simeq$ $D_4$	comment:Center of the group magma:Center(G); gap:Center(G); sage:G.center() sage_gap:G.Center() oscar:center(G)
Commutator:	$G' \simeq$ $C_4$	$G/G' \simeq$ $C_2\times C_4$	comment:Commutator subgroup of the group G magma:CommutatorSubgroup(G); gap:DerivedSubgroup(G); sage:G.commutator() sage_gap:G.DerivedSubgroup() oscar:derived_subgroup(G)
Frattini:	$\Phi \simeq$ $C_2\times C_4$	$G/\Phi \simeq$ $C_2^2$	comment:Frattini subgroup of the group G magma:FrattiniSubgroup(G); gap:FrattiniSubgroup(G); sage:G.frattini_subgroup() sage_gap:G.FrattiniSubgroup() oscar:frattini_subgroup(G)
Fitting:	$\operatorname{Fit} \simeq$ $C_4\wr C_2$	$G/\operatorname{Fit} \simeq$ $C_1$	comment:Fitting subgroup of the group G magma:FittingSubgroup(G); gap:FittingSubgroup(G); sage:G.fitting_subgroup() sage_gap:G.FittingSubgroup() oscar:fitting_subgroup(G)
Radical:	$R \simeq$ $C_4\wr C_2$	$G/R \simeq$ $C_1$	comment:Radical of the group G magma:Radical(G); gap:SolvableRadical(G); sage_gap:G.SolvableRadical() oscar:solvable_radical(G)
Socle:	$\operatorname{soc} \simeq$ $C_2$	$G/\operatorname{soc} \simeq$ $C_2^2:C_4$	comment:Socle of the group G magma:Socle(G); gap:Socle(G); sage:G.socle() sage_gap:G.Socle() oscar:socle(G)
2-Sylow subgroup:	$P_{ 2 } \simeq$ $C_4\wr C_2$

Subgroup diagram and profile

For the default diagram, subgroups are sorted vertically by the number of prime divisors (counted with multiplicity) in their orders.
To see subgroups sorted vertically by order instead, check this box.

Subgroup information

Click on a subgroup in the diagram to see information about it.

See a full page version of the diagram

Series

Derived series

$C_4\wr C_2$

$\rhd$

$C_4$

$\rhd$

$C_1$

comment:Derived series of the group G

magma:DerivedSeries(G);

gap:DerivedSeriesOfGroup(G);

sage:G.derived_series()

sage_gap:G.DerivedSeriesOfGroup()

oscar:derived_series(G)

Chief series

$C_4\wr C_2$

$\rhd$

$C_4^2$

$\rhd$

$C_2\times C_4$

$\rhd$

$C_4$

$\rhd$

$C_2$

$\rhd$

$C_1$

comment:Chief series of the group G

magma:ChiefSeries(G);

gap:ChiefSeries(G);

sage:libgap(G).ChiefSeries()

sage_gap:G.ChiefSeries()

oscar:chief_series(G)

Lower central series

$C_4\wr C_2$

$\rhd$

$C_4$

$\rhd$

$C_2$

$\rhd$

$C_1$

comment:The lower central series of the group G

magma:LowerCentralSeries(G);

gap:LowerCentralSeriesOfGroup(G);

sage:G.lower_central_series()

sage_gap:G.LowerCentralSeriesOfGroup()

oscar:lower_central_series(G)

Upper central series

$C_1$

$\lhd$

$C_4$

$\lhd$

$C_2\times C_4$

$\lhd$

$C_4\wr C_2$

comment:The upper central series of the group G

magma:UpperCentralSeries(G);

gap:UpperCentralSeriesOfGroup(G);

sage:G.upper_central_series()

sage_gap:G.UpperCentralSeriesOfGroup()

oscar:upper_central_series(G)

Supergroups

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

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

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

Complex character table

		1A	2A	2B	2C	4A1	4A-1	4B	4C1	4C-1	4D1	4D-1	4E	8A1	8A-1
	Size	1	1	2	4	1	1	2	2	2	2	2	4	4	4
	2 P	1A	1A	1A	1A	2A	2A	2A	2B	2B	2B	2B	2A	4A1	4A-1
	Type
32.11.1a	R	$1$	$1$	$1$	$1$	$1$	$1$	$1$	$1$	$1$	$1$	$1$	$1$	$1$	$1$
32.11.1b	R	$1$	$1$	$1$	$- 1$	$1$	$1$	$1$	$- 1$	$- 1$	$- 1$	$- 1$	$- 1$	$1$	$1$
32.11.1c	R	$1$	$1$	$1$	$- 1$	$1$	$1$	$1$	$1$	$1$	$1$	$1$	$- 1$	$- 1$	$- 1$
32.11.1d	R	$1$	$1$	$1$	$1$	$1$	$1$	$1$	$- 1$	$- 1$	$- 1$	$- 1$	$1$	$- 1$	$- 1$
32.11.1e1	C	$1$	$1$	$- 1$	$- 1$	$- 1$	$- 1$	$1$	$- i$	$i$	$i$	$- i$	$1$	$i$	$- i$
32.11.1e2	C	$1$	$1$	$- 1$	$- 1$	$- 1$	$- 1$	$1$	$i$	$- i$	$- i$	$i$	$1$	$- i$	$i$
32.11.1f1	C	$1$	$1$	$- 1$	$1$	$- 1$	$- 1$	$1$	$- i$	$i$	$i$	$- i$	$- 1$	$- i$	$i$
32.11.1f2	C	$1$	$1$	$- 1$	$1$	$- 1$	$- 1$	$1$	$i$	$- i$	$- i$	$i$	$- 1$	$i$	$- i$
32.11.2a	R	$2$	$2$	$- 2$	$0$	$2$	$2$	$- 2$	$0$	$0$	$0$	$0$	$0$	$0$	$0$
32.11.2b	R	$2$	$2$	$2$	$0$	$- 2$	$- 2$	$- 2$	$0$	$0$	$0$	$0$	$0$	$0$	$0$
32.11.2c1	C	$2$	$- 2$	$0$	$0$	$- 2 i$	$2 i$	$0$	$- 1 + i$	$- 1 - i$	$1 + i$	$1 - i$	$0$	$0$	$0$
32.11.2c2	C	$2$	$- 2$	$0$	$0$	$2 i$	$- 2 i$	$0$	$- 1 - i$	$- 1 + i$	$1 - i$	$1 + i$	$0$	$0$	$0$
32.11.2d1	C	$2$	$- 2$	$0$	$0$	$- 2 i$	$2 i$	$0$	$1 - i$	$1 + i$	$- 1 - i$	$- 1 + i$	$0$	$0$	$0$
32.11.2d2	C	$2$	$- 2$	$0$	$0$	$2 i$	$- 2 i$	$0$	$1 + i$	$1 - i$	$- 1 + i$	$- 1 - i$	$0$	$0$	$0$

Rational character table

		1A	2A	2B	2C	4A	4B	4C	4D	4E	8A
	Size	1	1	2	4	2	2	4	4	4	8
	2 P	1A	1A	1A	1A	2A	2A	2B	2B	2A	4A
32.11.1a		$1$	$1$	$1$	$1$	$1$	$1$	$1$	$1$	$1$	$1$
32.11.1b		$1$	$1$	$1$	$- 1$	$1$	$1$	$- 1$	$- 1$	$- 1$	$1$
32.11.1c		$1$	$1$	$1$	$- 1$	$1$	$1$	$1$	$1$	$- 1$	$- 1$
32.11.1d		$1$	$1$	$1$	$1$	$1$	$1$	$- 1$	$- 1$	$1$	$- 1$
32.11.1e		$2$	$2$	$- 2$	$- 2$	$- 2$	$2$	$0$	$0$	$2$	$0$
32.11.1f		$2$	$2$	$- 2$	$2$	$- 2$	$2$	$0$	$0$	$- 2$	$0$
32.11.2a		$2$	$2$	$- 2$	$0$	$2$	$- 2$	$0$	$0$	$0$	$0$
32.11.2b		$2$	$2$	$2$	$0$	$- 2$	$- 2$	$0$	$0$	$0$	$0$
32.11.2c		$4$	$- 4$	$0$	$0$	$0$	$0$	$- 2$	$2$	$0$	$0$
32.11.2d		$4$	$- 4$	$0$	$0$	$0$	$0$	$2$	$- 2$	$0$	$0$

Overview	Random
Universe	Knowledge

Classical	Maass
Hilbert	Bianchi

Elliptic curves over $\Q$ over number fields
Genus 2 curves
Higher genus families
Abelian varieties over $\F_{q}$
Belyi maps

Label	32.11
Order	\( 2^{5} \)
Exponent	\( 2^{3} \)

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

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

Subgroup information

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.