Finite Group Databasebeta

#72248342

order1536
automorphism?
homologyAbelianization (H1) = C24 · Schur multiplier (H2) = C26

Aliases

No aliases for this group.

Splittings

FittingC2×C3×#2091 ⋊ C2
SylowC3 ⋊ #396483

Subgroups

subgroupG/H
centerC2×C4D3×#127
commutator, cosocleC23×C3×C4C24
FrattiniC23×C4C23×D3
FittingC2×C3×#2091C2
socleC22×C3C2×#399
prime radicalC25×D3Q8
hypercenterC2×#2091D3
hypocenterC3#396483
LCSG ▷ C23×C3×C4 ▷ C2×C3 ▷ C3
UCSC1 ◁ C2×C4 ◁ C23×C4 ◁ C2×#2091

4860 conjugacy classes of subgroups.

Full subgroup data →

Presentation

minimal degreeμ(G) = 23
transitive degreeμt(G) = 96

A minimal faithful permutation representation — 4 generators on 23 points:

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

Polycyclic presentation:

2^9,3|a^2=f,b^2=g,f^2=i,g^2=i,h^2=i,b^a=bh,c^a=cfhi,c^b=cghi,d^a=dfhi,d^b=de,e^a=ei,f^b=fi,g^a=gi,j^d=j^2

Conjugacy classes & character table

132 conjugacy classes — view the full character table.

Relationships

maximal subgroup of#72248368, #72269869, D3×#396483
maximal normal subgroup of#72248368, #72269869, D3×#396483

GAP

Past the SmallGroups library coverage — no SmallGroups id. Construct it from its polycyclic presentation:

gap> F := FreeGroup(IsSyllableWordsFamily, "a", "b", "c", "d", "e", "f", "g", "h", "i", "j");;
gap> coll := SingleCollector(F, [2, 2, 2, 2, 2, 2, 2, 2, 2, 3]);;
gap> SetPower(coll, 1, F.6);;
gap> SetPower(coll, 2, F.7);;
gap> SetPower(coll, 6, F.9);;
gap> SetPower(coll, 7, F.9);;
gap> SetPower(coll, 8, F.9);;
gap> SetConjugate(coll, 2, 1, F.2*F.8);;
gap> SetConjugate(coll, 3, 1, F.3*F.6*F.8*F.9);;
gap> SetConjugate(coll, 3, 2, F.3*F.7*F.8*F.9);;
gap> SetConjugate(coll, 4, 1, F.4*F.6*F.8*F.9);;
gap> SetConjugate(coll, 4, 2, F.4*F.5);;
gap> SetConjugate(coll, 5, 1, F.5*F.9);;
gap> SetConjugate(coll, 6, 2, F.6*F.9);;
gap> SetConjugate(coll, 7, 1, F.7*F.9);;
gap> SetConjugate(coll, 10, 4, F.10^2);;
gap> UpdatePolycyclicCollector(coll);;
gap> G := GroupByRws(coll);