Finite Group Databasebeta

#72255012

order1536
automorphism?
homologyAbelianization (H1) = C2×C8 · Schur multiplier (H2) = C1

Aliases

No aliases for this group.

Splittings

SylowC3 ⋊ #94754

Subgroups

subgroupG/H
centerC2#10682869
commutatorC3×C32C2×C8
Frattini#1397C2×D3
FittingC3×#7464C2
socleC2×C3#7463
prime radicalC22×C3#1426
cosocleC3×#1397C22
hypercenter#7464D3
hypocenterC3#94754
LCSG ▷ C3×C32 ▷ C3×C16 ▷ C3×C8 ▷ C3×C4 ▷ C2×C3 ▷ C3
UCSC1 ◁ C2 ◁ C2×C4 ◁ C4×C8 ◁ C4×C16 ◁ #1397 ◁ #7464

92 conjugacy classes of subgroups.

Full subgroup data →

Presentation

transitive degreeμt(G) = 192

Polycyclic presentation:

2^9,3|a^2=c,b^2=d,c^2=egh,d^2=f,e^2=ghi,g^2=hi,h^2=i,b^a=bcgh,c^b=ce,d^a=dhi,d^c=di,e^b=eg,f^a=fi,g^b=gh,h^b=hi,j^a=j^2,j^b=j^2

Conjugacy classes & character table

108 conjugacy classes — view the full character table.

Relationships

maximal subgroup of#72255016, D3×#94754, #72255032
maximal normal subgroup of#72255016, D3×#94754, #72255032

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.3);;
gap> SetPower(coll, 2, F.4);;
gap> SetPower(coll, 3, F.5*F.7*F.8);;
gap> SetPower(coll, 4, F.6);;
gap> SetPower(coll, 5, F.7*F.8*F.9);;
gap> SetPower(coll, 7, F.8*F.9);;
gap> SetPower(coll, 8, F.9);;
gap> SetConjugate(coll, 2, 1, F.2*F.3*F.7*F.8);;
gap> SetConjugate(coll, 3, 2, F.3*F.5);;
gap> SetConjugate(coll, 4, 1, F.4*F.8*F.9);;
gap> SetConjugate(coll, 4, 3, F.4*F.9);;
gap> SetConjugate(coll, 5, 2, F.5*F.7);;
gap> SetConjugate(coll, 6, 1, F.6*F.9);;
gap> SetConjugate(coll, 7, 2, F.7*F.8);;
gap> SetConjugate(coll, 8, 2, F.8*F.9);;
gap> SetConjugate(coll, 10, 1, F.10^2);;
gap> SetConjugate(coll, 10, 2, F.10^2);;
gap> UpdatePolycyclicCollector(coll);;
gap> G := GroupByRws(coll);