Finite Group Databasebeta

#72268793

order2304
automorphism?
homologyAbelianization (H1) = C24 · Schur multiplier (H2) = C28

Aliases

No aliases for this group.

Splittings

FittingC9×#1781 ⋊ C2
SylowC9 ⋊ #23900

Subgroups

subgroupG/H
centerC22C2×#63444
commutator, cosocleC24×C9C24
FrattiniC24×C3C23×D3
FittingC9×#1781C2
socleC22×C3C2×#882
hypercenter#1781D9
hypocenterC9#23900
LCSG ▷ C24×C9 ▷ C2×C9 ▷ C9
UCSC1 ◁ C22 ◁ C25 ◁ #1781

5280 conjugacy classes of subgroups.

Full subgroup data →

Presentation

minimal degreeμ(G) = 21
transitive degreeμt(G) = 144

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

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

Polycyclic presentation:

2^8,3^2|a^2=e,i^3=j,b^a=bf,c^a=ce,d^a=dg,d^c=dgh,e^d=eh,g^a=gh,i^c=i^2j^2,j^c=j^2

Conjugacy classes & character table

174 conjugacy classes — view the full character table.

Relationships

maximal subgroup ofD9×#23900
maximal normal subgroup ofD9×#23900

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