LMFDB - Abstract group 52488.nl: $\He

Show commands: Gap / Magma / Oscar / SageMath

comment:Construction of abstract group

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

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

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

sage_gap:G = gap.new('Group( (1,2,3,5,9,14)(4,7,12,16,17,18)(6,11,15,13,8,10)(19,20,21,23)(22,24), (1,2,4,8,13,7)(3,6)(5,10)(9,15,11,14,17,18)(12,16)(20,22,23)(21,24) )')

oscar:G = @permutation_group(24, (1,2,3,5,9,14)(4,7,12,16,17,18)(6,11,15,13,8,10)(19,20,21,23)(22,24), (1,2,4,8,13,7)(3,6)(5,10)(9,15,11,14,17,18)(12,16)(20,22,23)(21,24))

Group information

Description:	$\He_3^2.\SOPlus(4,2)$
Order:	$52488$$\medspace = 2^{3} \cdot 3^{8} $	comment:Order of the group magma:Order(G); gap:Order(G); sage:G.order() sage_gap:G.Order() oscar:order(G)
Exponent:	$12$$\medspace = 2^{2} \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^5.C_3^4.C_2^5.C_2$, of order $1259712$$\medspace = 2^{6} \cdot 3^{9} $	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 3, $C_3$ x 8	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:	$3$	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 and solvable. Whether it is monomial has not been computed.

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	12
Elements	1	657	6560	486	32148	12636	52488
Conjugacy classes	1	3	168	1	75	10	258
Divisions	1	3	99	1	44	4	152
Autjugacy classes	1	3	62	1	36	4	107

Minimal presentations

Permutation degree:	$24$
Transitive degree:	$36$
Rank:	$2$
Inequivalent generating pairs:	not computed

Minimal degrees of faithful linear representations

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

Constructions

Show commands: Gap / Magma / Oscar / SageMath

Presentation:	${\langle a, b, c, d, e, f, g, h \mid a^{6}=b^{12}=c^{3}=d^{3}=e^{3}=f^{3}= \!\cdots\! \rangle}$ < a, b, c, d, e, f, g, h \| a^6,b^12,c^3,d^3,e^3,f^3,g^3,h^3,[b,h],[c,e],[c,f],[c,h],[d,e],[d,h],[e,f],[e,g],[e,h],[f,h],[g,h], b^11e^2fg^2h^2a^-1b^-1a, d^2e^2fg^2a^-1c^-1a, c^2def^2ha^-1d^-1a, dfga^-1e^-1a, cfh^2a^-1f^-1a, d^2h^2a^-1g^-1a, h^2a^-1h^-1a, c^2hb^-1c^-1b, ceghb^-1d^-1b, c^2efb^-1e^-1b, cd^2g^2b^-1f^-1b, cdb^-1g^-1b, dhc^-1d^-1c, gh^2c^-1g^-1c, fh^2d^-1f^-1d, ghd^-1g^-1d, gh^2f^-1g^-1*f >
comment:Define the group with the given generators and relations magma:G := PCGroup([11, -2, -3, -2, -2, -3, -3, 3, 3, 3, 3, -3, 22, 1648748, 50008, 90, 271923, 236294, 124, 850084, 424395, 1012181, 510856, 194067, 1724190, 1250189, 308644, 131247, 91295, 19003, 703303, 40157, 108280, 3663800, 1724995, 200802, 110525, 17003, 3896649, 205940, 5311, 380202, 97403, 62434, 11955, 2407, 4234042]); a,b,c,d,e,f,g,h := Explode([G.1, G.3, G.6, G.7, G.8, G.9, G.10, G.11]); AssignNames(~G, ["a", "a2", "b", "b2", "b4", "c", "d", "e", "f", "g", "h"]); gap:G := PcGroupCode(4585161581189563350628226086999415377174004632419727216652929577806371883132761761966459287811283414356835141472320803274380387091384871706319187000131930686732216332428936212864068223,52488); a := G.1; b := G.3; c := G.6; d := G.7; e := G.8; f := G.9; g := G.10; h := G.11; sage:# This uses Sage's interface to GAP, as Sage (currently) has no native support for PC groups G = gap.new('PcGroupCode(4585161581189563350628226086999415377174004632419727216652929577806371883132761761966459287811283414356835141472320803274380387091384871706319187000131930686732216332428936212864068223,52488)'); a = G.1; b = G.3; c = G.6; d = G.7; e = G.8; f = G.9; g = G.10; h = G.11; sage_gap:# This uses Sage's interface to GAP, as Sage (currently) has no native support for PC groups G = gap.new('PcGroupCode(4585161581189563350628226086999415377174004632419727216652929577806371883132761761966459287811283414356835141472320803274380387091384871706319187000131930686732216332428936212864068223,52488)'); a = G.1; b = G.3; c = G.6; d = G.7; e = G.8; f = G.9; g = G.10; h = G.11;
Permutation group:	Degree $24$ $\langle(1,2,3,5,9,14)(4,7,12,16,17,18)(6,11,15,13,8,10)(19,20,21,23)(22,24), (1,2,4,8,13,7)(3,6)(5,10)(9,15,11,14,17,18)(12,16)(20,22,23)(21,24)\rangle$ (1,2,3,5,9,14)(4,7,12,16,17,18)(6,11,15,13,8,10)(19,20,21,23)(22,24), (1,2,4,8,13,7)(3,6)(5,10)(9,15,11,14,17,18)(12,16)(20,22,23)(21,24)
comment:Define the group as a permutation group magma:G := PermutationGroup< 24 \| (1,2,3,5,9,14)(4,7,12,16,17,18)(6,11,15,13,8,10)(19,20,21,23)(22,24), (1,2,4,8,13,7)(3,6)(5,10)(9,15,11,14,17,18)(12,16)(20,22,23)(21,24) >; gap:G := Group( (1,2,3,5,9,14)(4,7,12,16,17,18)(6,11,15,13,8,10)(19,20,21,23)(22,24), (1,2,4,8,13,7)(3,6)(5,10)(9,15,11,14,17,18)(12,16)(20,22,23)(21,24) ); sage:G = PermutationGroup(['(1,2,3,5,9,14)(4,7,12,16,17,18)(6,11,15,13,8,10)(19,20,21,23)(22,24)', '(1,2,4,8,13,7)(3,6)(5,10)(9,15,11,14,17,18)(12,16)(20,22,23)(21,24)']) sage_gap:G = gap.new('Group( (1,2,3,5,9,14)(4,7,12,16,17,18)(6,11,15,13,8,10)(19,20,21,23)(22,24), (1,2,4,8,13,7)(3,6)(5,10)(9,15,11,14,17,18)(12,16)(20,22,23)(21,24) )') oscar:G = @permutation_group(24, (1,2,3,5,9,14)(4,7,12,16,17,18)(6,11,15,13,8,10)(19,20,21,23)(22,24), (1,2,4,8,13,7)(3,6)(5,10)(9,15,11,14,17,18)(12,16)(20,22,23)(21,24))
Transitive group:	36T16575	36T16634			more information
magma:G := TransitiveGroup(36, 16575); gap:G := TransitiveGroup(36, 16575); sage:G = TransitiveGroup(36, 16575) sage_gap:G = libgap.TransitiveGroup(36, 16575) oscar:G = transitive_group(36, 16575) magma:G := TransitiveGroup(36, 16634); gap:G := TransitiveGroup(36, 16634); sage:G = TransitiveGroup(36, 16634) sage_gap:G = libgap.TransitiveGroup(36, 16634) oscar:G = transitive_group(36, 16634)
Direct product:	not isomorphic to a non-trivial direct product
Semidirect product:	not computed
Trans. wreath product:	not computed
Possibly split product:	$(C_3^6:D_6)$ . $S_3$	$(C_3^6:D_6)$ . $C_6$	$C_3^6$ . $(C_3:D_{12})$	$(C_3^5:C_6)$ . $S_3^2$	all 56

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

Homology

Abelianization:	$C_{2} \times C_{6} \simeq C_{2}^{2} \times C_{3}$	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:	not computed	comment:The Schur multiplier of the group gap:AbelianInvariantsMultiplier(G); sage:G.homology(2) sage_gap:G.AbelianInvariantsMultiplier()
Commutator length:	$2$	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 71 normal subgroups, and all normal subgroups are characteristic.

Characteristic subgroups are shown in this color.

Special subgroups

Center:	$Z \simeq$ $C_1$	$G/Z \simeq$ $\He_3^2.\SOPlus(4,2)$	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_3^6.C_6$	$G/G' \simeq$ $C_2\times C_6$	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_3^2$	$G/\Phi \simeq$ $C_3^5:D_{12}$	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_3^2\times C_3^4.C_3^2$	$G/\operatorname{Fit} \simeq$ $D_4$	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$ $\He_3^2.\SOPlus(4,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_3^4$	$G/\operatorname{soc} \simeq$ $C_3^3:D_{12}$	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$ $D_4$
3-Sylow subgroup:	$P_{ 3 } \simeq$ $C_3^2\times C_3^4.C_3^2$

Subgroup diagram and profile

Series

Derived series

$\He_3^2.\SOPlus(4,2)$

$\rhd$

$C_3^6.C_6$

$\rhd$

$C_3^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

$\He_3^2.\SOPlus(4,2)$

$\rhd$

$\He_3^2.S_3^2$

$\rhd$

$C_3^6.C_3.C_6$

$\rhd$

$C_3^6.C_6$

$\rhd$

$C_3^2\times C_3^4:C_3$

$\rhd$

$C_3^6$

$\rhd$

$C_3^5$

$\rhd$

$C_3^4$

$\rhd$

$C_3^3$

$\rhd$

$C_3^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

$\He_3^2.\SOPlus(4,2)$

$\rhd$

$C_3^6.C_6$

$\rhd$

$C_3^2\times C_3^4: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$

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 10 larger groups in the database.

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

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

Rational character table

The $152 \times 152$ 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	52488.nl
Order	\( 2^{3} \cdot 3^{8} \)
Exponent	\( 2^{2} \cdot 3 \)

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

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.