LMFDB - Abstract group 768.1090131: $C_2^5:S

Show commands: Gap / Magma / SageMath

magma:G := SmallGroup(768, 1090131);

gap:G := SmallGroup(768, 1090131);

sage_gap:G = libgap.SmallGroup(768, 1090131)

comment:Define the group as a permutation group

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

Group information

Description:	$C_2^5:S_4$
Order:	$768$$\medspace = 2^{8} \cdot 3 $	comment:Order of the group magma:Order(G); gap:Order(G); sage:G.order() sage_gap:G.Order()
Exponent:	$24$$\medspace = 2^{3} \cdot 3 $	comment:Exponent of the group magma:Exponent(G); gap:Exponent(G); sage:G.exponent() sage_gap:G.Exponent()
Automorphism group:	$C_4^3:(C_2^2\times S_4)$, of order $6144$$\medspace = 2^{11} \cdot 3 $	comment:Automorphism group gap:AutomorphismGroup(G); magma:AutomorphismGroup(G); sage_gap:G.AutomorphismGroup()
Composition factors:	$C_2$ x 8, $C_3$	comment:Composition factors of the group magma:CompositionFactors(G); gap:CompositionSeries(G); sage:G.composition_series() sage_gap:G.CompositionSeries()
Derived length:	$4$	comment:Derived length of the group magma:DerivedLength(G); gap:DerivedLength(G); sage_gap:G.DerivedLength()

This group is nonabelian, monomial (hence solvable), 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	3	4	6	8
Elements	1	103	128	312	128	96	768
Conjugacy classes	1	9	1	10	1	2	24
Divisions	1	9	1	10	1	2	24
Autjugacy classes	1	6	1	6	1	1	16

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:G.CharacterDegrees()

Dimension	1	2	3	6	12
Irr. complex chars.	4	2	12	2	4	24
Irr. rational chars.	4	2	12	2	4	24

Minimal presentations

Permutation degree:	$18$
Transitive degree:	$24$
Rank:	$2$
Inequivalent generating pairs:	$9$

Minimal degrees of faithful linear representations

	Over $\mathbb{C}$	Over $\mathbb{R}$	Over $\mathbb{Q}$
Irreducible	12	12	12
Arbitrary	12	12	12

Constructions

Show commands: Gap / Magma / SageMath

Presentation:	${\langle a, b, c, d, e, f \mid a^{2}=b^{6}=c^{2}=d^{2}=e^{4}=f^{4}=[a,d]= \!\cdots\! \rangle}$ < a, b, c, d, e, f \| a^2,b^6,c^2,d^2,e^4,f^4,[a,d],[c,d],[e,f], b^5a^-1b^-1a, cda^-1c^-1a, ce^2f^3a^-1e^-1a, cde^3a^-1f^-1a, db^-1c^-1b, cdb^-1d^-1b, e^2f^3b^-1e^-1b, e^3fb^-1f^-1b, ef^2c^-1e^-1c, e^2fc^-1f^-1c, e^3d^-1e^-1d, e^2f^3d^-1f^-1*d >
comment:Define the group with the given generators and relations magma:G := PCGroup([9, 2, 2, 3, 2, 2, 2, 2, 2, 2, 181, 46, 218, 1299, 444, 345, 823, 157, 36941, 18158, 3263, 1976, 365, 158, 30246, 12111, 7584, 12967, 12112, 7801, 1762, 2059, 214, 19457, 1970]); a,b,c,d,e,f := Explode([G.1, G.2, G.4, G.5, G.6, G.8]); AssignNames(~G, ["a", "b", "b2", "c", "d", "e", "e2", "f", "f2"]); gap:G := PcGroupCode(79924844233235786991899159435981848360229194954850928243109730413695879780301013992512,768); a := G.1; b := G.2; c := G.4; d := G.5; e := G.6; f := G.8; sage:# This uses Sage's interface to GAP, as Sage (currently) has no native support for PC groups G = gap.new('PcGroupCode(79924844233235786991899159435981848360229194954850928243109730413695879780301013992512,768)'); a = G.1; b = G.2; c = G.4; d = G.5; e = G.6; f = G.8; sage_gap:# This uses Sage's interface to GAP, as Sage (currently) has no native support for PC groups G = gap.new('PcGroupCode(79924844233235786991899159435981848360229194954850928243109730413695879780301013992512,768)'); a = G.1; b = G.2; c = G.4; d = G.5; e = G.6; f = G.8;
Permutation group:	Degree $18$ $\langle(2,6)(4,11)(7,14)(8,13)(9,16)(12,15)(17,18), (17,18), (2,3,6)(4,5,11)(7,10,14) \!\cdots\! \rangle$ (2,6)(4,11)(7,14)(8,13)(9,16)(12,15)(17,18), (17,18), (2,3,6)(4,5,11)(7,10,14)(8,16,12)(9,13,15), (1,2)(3,6)(5,10)(8,13)(11,14)(15,16), (1,3)(2,6)(4,7)(9,12)(11,14)(15,16), (1,4)(2,7)(3,9)(5,11)(6,12)(8,15)(10,16)(13,14), (1,5)(2,8)(3,10)(4,11)(6,13)(7,15)(9,16)(12,14), (1,2)(3,6)(4,7)(5,8)(9,12)(10,13)(11,15)(14,16), (1,3)(2,6)(4,9)(5,10)(7,12)(8,13)(11,16)(14,15)
comment:Define the group as a permutation group magma:G := PermutationGroup< 18 \| (2,6)(4,11)(7,14)(8,13)(9,16)(12,15)(17,18), (17,18), (2,3,6)(4,5,11)(7,10,14)(8,16,12)(9,13,15), (1,2)(3,6)(5,10)(8,13)(11,14)(15,16), (1,3)(2,6)(4,7)(9,12)(11,14)(15,16), (1,4)(2,7)(3,9)(5,11)(6,12)(8,15)(10,16)(13,14), (1,5)(2,8)(3,10)(4,11)(6,13)(7,15)(9,16)(12,14), (1,2)(3,6)(4,7)(5,8)(9,12)(10,13)(11,15)(14,16), (1,3)(2,6)(4,9)(5,10)(7,12)(8,13)(11,16)(14,15) >; gap:G := Group( (2,6)(4,11)(7,14)(8,13)(9,16)(12,15)(17,18), (17,18), (2,3,6)(4,5,11)(7,10,14)(8,16,12)(9,13,15), (1,2)(3,6)(5,10)(8,13)(11,14)(15,16), (1,3)(2,6)(4,7)(9,12)(11,14)(15,16), (1,4)(2,7)(3,9)(5,11)(6,12)(8,15)(10,16)(13,14), (1,5)(2,8)(3,10)(4,11)(6,13)(7,15)(9,16)(12,14), (1,2)(3,6)(4,7)(5,8)(9,12)(10,13)(11,15)(14,16), (1,3)(2,6)(4,9)(5,10)(7,12)(8,13)(11,16)(14,15) ); sage:G = PermutationGroup(['(2,6)(4,11)(7,14)(8,13)(9,16)(12,15)(17,18)', '(17,18)', '(2,3,6)(4,5,11)(7,10,14)(8,16,12)(9,13,15)', '(1,2)(3,6)(5,10)(8,13)(11,14)(15,16)', '(1,3)(2,6)(4,7)(9,12)(11,14)(15,16)', '(1,4)(2,7)(3,9)(5,11)(6,12)(8,15)(10,16)(13,14)', '(1,5)(2,8)(3,10)(4,11)(6,13)(7,15)(9,16)(12,14)', '(1,2)(3,6)(4,7)(5,8)(9,12)(10,13)(11,15)(14,16)', '(1,3)(2,6)(4,9)(5,10)(7,12)(8,13)(11,16)(14,15)'])
Transitive group:	24T1724	24T2175	24T2176		more information
Direct product:	$C_2$ $\, \times\, $ $(C_4^2:S_4)$
Semidirect product:	$C_2^5$ $\,\rtimes\,$ $S_4$ (2)	$(C_2\times C_4^2)$ $\,\rtimes\,$ $S_4$	$C_2^4$ $\,\rtimes\,$ $(C_2\times S_4)$ (2)	$C_4^2$ $\,\rtimes\,$ $(C_2\times S_4)$	all 8
Trans. wreath product:	not isomorphic to a non-trivial transitive wreath product
Non-split product:	$C_2^3$ . $(C_2^2:S_4)$	$C_2^2$ . $(C_2^3:S_4)$			more information

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

Homology

Abelianization:	$C_{2}^{2} $	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}^{3} \times C_{4}$	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 5446 subgroups in 528 conjugacy classes, 17 normal (11 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$	$G/Z \simeq$ $C_4^2:S_4$	comment:Center of the group magma:Center(G); gap:Center(G); sage:G.center() sage_gap:G.Center()
Commutator:	$G' \simeq$ $C_4^2:A_4$	$G/G' \simeq$ $C_2^2$	comment:Commutator subgroup of the group G magma:CommutatorSubgroup(G); gap:DerivedSubgroup(G); sage:G.commutator() sage_gap:G.DerivedSubgroup()
Frattini:	$\Phi \simeq$ $C_2^2$	$G/\Phi \simeq$ $C_2^3:S_4$	comment:Frattini subgroup of the group G magma:FrattiniSubgroup(G); gap:FrattiniSubgroup(G); sage:G.frattini_subgroup() sage_gap:G.FrattiniSubgroup()
Fitting:	$\operatorname{Fit} \simeq$ $C_4^2:C_2^3$	$G/\operatorname{Fit} \simeq$ $S_3$	comment:Fitting subgroup of the group G magma:FittingSubgroup(G); gap:FittingSubgroup(G); sage:G.fitting_subgroup() sage_gap:G.FittingSubgroup()
Radical:	$R \simeq$ $C_2^5:S_4$	$G/R \simeq$ $C_1$	comment:Radical of the group G magma:Radical(G); gap:SolvableRadical(G); sage_gap:G.SolvableRadical()
Socle:	$\operatorname{soc} \simeq$ $C_2^3$	$G/\operatorname{soc} \simeq$ $C_2^2:S_4$	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^5:D_4$
3-Sylow subgroup:	$P_{ 3 } \simeq$ $C_3$

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_2^5:S_4$

$\rhd$

$C_4^2:A_4$

$\rhd$

$C_4^2:C_2^2$

$\rhd$

$C_2^2$

$\rhd$

$C_1$

comment:Derived series of the group GF

magma:DerivedSeries(G);

gap:DerivedSeriesOfGroup(G);

sage:G.derived_series()

sage_gap:G.DerivedSeriesOfGroup()

Chief series

$C_2^5:S_4$

$\rhd$

$C_4^2:S_4$

$\rhd$

$C_4^2:A_4$

$\rhd$

$C_4^2:C_2^2$

$\rhd$

$C_2^4$

$\rhd$

$C_2^2$

$\rhd$

$C_1$

comment:Chief series of the group G

magma:ChiefSeries(G);

gap:ChiefSeries(G);

sage_gap:G.ChiefSeries()

Lower central series

$C_2^5:S_4$

$\rhd$

$C_4^2:A_4$

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

$C_1$

$\lhd$

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

Supergroups

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

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

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

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	768.1090131
Order	\( 2^{8} \cdot 3 \)
Exponent	\( 2^{3} \cdot 3 \)

Nilpotent	no
Solvable	yes
$\card{G^{\mathrm{ab}}}$	\( 2^{2} \)
$\card{Z(G)}$	\( 2 \)
$\card{\Aut(G)}$	\( 2^{11} \cdot 3 \)
$\card{\mathrm{Out}(G)}$	\( 2^{4} \)
Perm deg.	$18$
Trans deg.	$24$
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.