Finite Group Databasebeta

#72243240

order4374
automorphism?
homologyAbelianization (H1) = C2×C33 · Schur multiplier (H2) = C33

Aliases

No aliases for this group.

Splittings

Fitting, Sylow#14552206 ⋊ C2

Subgroups

subgroupG/H
centerC32C32×AGL(1,ℤ/9)
commutator, cosocleC32×C9C2×C33
Frattini, socleC33C33×D3
Fitting#14552206C2
prime radicalC33×AGL(1,ℤ/9)C3
hypercenterC32⋊C9AGL(1,ℤ/9)
hypocenterC9C2×#6891
LCSG ▷ C32×C9 ▷ C9
UCSC1 ◁ C32 ◁ C32⋊C9

1615 conjugacy classes of subgroups; only the 149 normal subgroups are shown.

normal subgroups only

This group has 1615 conjugacy classes of subgroups — too many to draw. Only its 149 normal subgroups are shown.

Dotted edges: containments with no intermediate normal subgroup — omitted non-normal subgroups may lie between.

Full subgroup data →

Presentation

minimal degreeμ(G) = 27
transitive degreeμt(G) = 162

A minimal faithful permutation representation — 3 generators on 27 points:

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

Polycyclic presentation:

2,3^7|d^3=ef,g^3=h,d^a=dh^2,d^b=df,d^c=de,g^a=g^2h^2,g^c=gh,h^a=h^2

Conjugacy classes & character table

186 conjugacy classes — view the full character table.

Relationships

maximal subgroup of3−1+2×#92265, #72243361, #72243574, …
maximal normal subgroup of3−1+2×#92265, #72243361, #72243574, …

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