LMFDB - Abstract group 384.4615: $(C_6\times D_8):C

Show commands: Gap / Magma / Oscar / SageMath

comment:Construction of abstract group

magma:G := SmallGroup(384, 4615);

gap:G := SmallGroup(384, 4615);

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

sage_gap:G = libgap.SmallGroup(384, 4615)

oscar:G = small_group(384, 4615)

Group information

Description:	$(C_6\times D_8):C_4$
Order:	$384$$\medspace = 2^{7} \cdot 3 $	comment:Order of the group magma:Order(G); gap:Order(G); sage:G.order() sage_gap:G.Order() oscar:order(G)
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() oscar:exponent(G)
Automorphism group:	$C_3:((C_2^6\times C_4).C_2^6)$, of order $49152$$\medspace = 2^{14} \cdot 3 $	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 7, $C_3$	comment:Composition factors of the group magma:CompositionFactors(G); gap:CompositionSeries(G); sage:G.composition_series() sage_gap:G.CompositionSeries() oscar:composition_series(G)
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, supersolvable (hence solvable and monomial), hyperelementary for $p = 2$, 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	3	4	6	8	12	24
Elements	1	39	2	152	78	64	16	32	384
Conjugacy classes	1	11	1	12	15	8	4	8	60
Divisions	1	11	1	8	11	6	4	4	46
Autjugacy classes	1	5	1	6	5	2	4	1	25

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	8
Irr. complex chars.	16	28	16	0	60
Irr. rational chars.	8	20	14	4	46

Minimal presentations

Permutation degree:	$19$
Transitive degree:	$192$
Rank:	$3$
Inequivalent generating triples:	$336$

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 \mid b^{2}=c^{4}=d^{24}=[a,b]=[b,c]=[b,d]=1, a^{2}=b, c^{a}=bc^{3}, d^{a}=d^{11}, d^{c}=d^{5} \rangle$ < a, b, c, d \| b^2,c^4,d^24,[a,b],[b,c],[b,d], ba^-2, bc^3a^-1c^-1a, d^11a^-1d^-1a, d^5c^-1d^-1*c >
comment:Define the group with the given generators and relations magma:G := PCGroup([8, -2, -2, 2, -2, -2, -2, -2, -3, 16, 338, 66, 7044, 820, 116, 16901, 1941, 141, 17926, 4502, 166, 16391, 4119]); a,b,c,d := Explode([G.1, G.2, G.3, G.5]); AssignNames(~G, ["a", "b", "c", "c2", "d", "d2", "d4", "d8"]); gap:G := PcGroupCode(34902357572210916977014266903813962564915524865,384); a := G.1; b := G.2; c := G.3; d := G.5; sage:# This uses Sage's interface to GAP, as Sage (currently) has no native support for PC groups G = gap.new('PcGroupCode(34902357572210916977014266903813962564915524865,384)'); a = G.1; b = G.2; c = G.3; d = G.5; sage_gap:# This uses Sage's interface to GAP, as Sage (currently) has no native support for PC groups G = gap.new('PcGroupCode(34902357572210916977014266903813962564915524865,384)'); a = G.1; b = G.2; c = G.3; d = G.5;
Permutation group:	Degree $19$ $\langle(1,2)(4,5,7,6)(8,9)(10,11)(13,14)(15,16)(18,19), (1,2)(4,6,7,5)(8,10,11,9) \!\cdots\! \rangle$ (1,2)(4,5,7,6)(8,9)(10,11)(13,14)(15,16)(18,19), (1,2)(4,6,7,5)(8,10,11,9)(12,13,16,18,17,19,15,14), (4,7)(5,6)(8,11)(9,10)(12,14,16,13,17,18,15,19), (8,11)(9,10)(12,15,17,16)(13,14,19,18), (12,16,17,15)(13,18,19,14), (4,7)(5,6), (12,17)(13,19)(14,18)(15,16), (1,2,3)
comment:Define the group as a permutation group magma:G := PermutationGroup< 19 \| (1,2)(4,5,7,6)(8,9)(10,11)(13,14)(15,16)(18,19), (1,2)(4,6,7,5)(8,10,11,9)(12,13,16,18,17,19,15,14), (4,7)(5,6)(8,11)(9,10)(12,14,16,13,17,18,15,19), (8,11)(9,10)(12,15,17,16)(13,14,19,18), (12,16,17,15)(13,18,19,14), (4,7)(5,6), (12,17)(13,19)(14,18)(15,16), (1,2,3) >; gap:G := Group( (1,2)(4,5,7,6)(8,9)(10,11)(13,14)(15,16)(18,19), (1,2)(4,6,7,5)(8,10,11,9)(12,13,16,18,17,19,15,14), (4,7)(5,6)(8,11)(9,10)(12,14,16,13,17,18,15,19), (8,11)(9,10)(12,15,17,16)(13,14,19,18), (12,16,17,15)(13,18,19,14), (4,7)(5,6), (12,17)(13,19)(14,18)(15,16), (1,2,3) ); sage:G = PermutationGroup(['(1,2)(4,5,7,6)(8,9)(10,11)(13,14)(15,16)(18,19)', '(1,2)(4,6,7,5)(8,10,11,9)(12,13,16,18,17,19,15,14)', '(4,7)(5,6)(8,11)(9,10)(12,14,16,13,17,18,15,19)', '(8,11)(9,10)(12,15,17,16)(13,14,19,18)', '(12,16,17,15)(13,18,19,14)', '(4,7)(5,6)', '(12,17)(13,19)(14,18)(15,16)', '(1,2,3)']) sage_gap:G = gap.new('Group( (1,2)(4,5,7,6)(8,9)(10,11)(13,14)(15,16)(18,19), (1,2)(4,6,7,5)(8,10,11,9)(12,13,16,18,17,19,15,14), (4,7)(5,6)(8,11)(9,10)(12,14,16,13,17,18,15,19), (8,11)(9,10)(12,15,17,16)(13,14,19,18), (12,16,17,15)(13,18,19,14), (4,7)(5,6), (12,17)(13,19)(14,18)(15,16), (1,2,3) )') oscar:G = @permutation_group(19, (1,2)(4,5,7,6)(8,9)(10,11)(13,14)(15,16)(18,19), (1,2)(4,6,7,5)(8,10,11,9)(12,13,16,18,17,19,15,14), (4,7)(5,6)(8,11)(9,10)(12,14,16,13,17,18,15,19), (8,11)(9,10)(12,15,17,16)(13,14,19,18), (12,16,17,15)(13,18,19,14), (4,7)(5,6), (12,17)(13,19)(14,18)(15,16), (1,2,3))

Direct product:	not isomorphic to a non-trivial direct product
Semidirect product:	$(C_6\times D_8)$ $\,\rtimes\,$ $C_4$	$C_8$ $\,\rtimes\,$ $(C_6.D_4)$	$(C_2^4.D_6)$ $\,\rtimes\,$ $C_2$	$(C_2^3.D_{12})$ $\,\rtimes\,$ $C_2$	all 8
Trans. wreath product:	not isomorphic to a non-trivial transitive wreath product
Non-split product:	$(C_6:C_8)$ . $D_4$	$C_6$ . $(C_8:D_4)$	$C_6$ . $(C_8:D_4)$	$C_6$ . $(D_8:C_4)$	all 53

Elements of the group are displayed as words in the presentation generators from the presentation above.

Homology

Abelianization:	$C_{2}^{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}^{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()

oscar:subgroups(G)

There are 1278 subgroups in 376 conjugacy classes, 113 normal (43 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$ $S_3\times 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_2\times C_{12}$	$G/G' \simeq$ $C_2^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^2\times C_4$	$G/\Phi \simeq$ $C_2\times D_6$	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_{24}:C_2^3$	$G/\operatorname{Fit} \simeq$ $C_2$	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_6\times D_8):C_4$	$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^2\times C_6$	$G/\operatorname{soc} \simeq$ $C_2\times D_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_2\times D_8):C_4$
3-Sylow subgroup:	$P_{ 3 } \simeq$ $C_3$

Subgroup diagram and profile

Series

Derived series

$(C_6\times D_8):C_4$

$\rhd$

$C_2\times C_{12}$

$\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_6\times D_8):C_4$

$\rhd$

$C_2^4.D_6$

$\rhd$

$C_2^2.D_{12}$

$\rhd$

$C_2^2\times C_{12}$

$\rhd$

$C_2^2\times C_6$

$\rhd$

$C_2\times C_6$

$\rhd$

$C_6$

$\rhd$

$C_3$

$\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_6\times D_8):C_4$

$\rhd$

$C_2\times C_{12}$

$\rhd$

$C_6$

$\rhd$

$C_3$

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_2^3$

$\lhd$

$C_2^2\times C_4$

$\lhd$

$C_2^2\times D_8$

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)

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

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

Rational character table

See the $46 \times 46$ rational character table.

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

Nilpotent	no
Solvable	yes
$\card{G^{\mathrm{ab}}}$	\( 2^{4} \)
$\card{Z(G)}$	\( 2^{3} \)
$\card{\Aut(G)}$	\( 2^{14} \cdot 3 \)
$\card{\mathrm{Out}(G)}$	\( 2^{10} \)
Perm deg.	$19$
Trans deg.	$192$
Rank	$3$

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

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.