Finite Group Databasebeta

#72227632

order3200
automorphism?
homologyAbelianization (H1) = C23×C4 · Schur multiplier (H2) = C25

Aliases

No aliases for this group.

Splittings

FittingC52×#121 ⋊ C4
SylowC52 ⋊ #2325

Subgroups

subgroupG/H
center, FrattiniC22C23×#1043
commutator, socleC22×C52C23×C4
FittingC52×#121C4
prime radical#121×C5⋊D5C2
cosocleC22×C5⋊D5C24
hypercenter#121#1043
hypocenterC52#2325
LCSG ▷ C22×C52 ▷ C52
UCSC1 ◁ C22 ◁ #121

2784 conjugacy classes of subgroups.

Full subgroup data →

Presentation

minimal degreeμ(G) = 22
transitive degreeμt(G) = 400

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

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

Polycyclic presentation:

2^7,5^2|b^2=g,d^2=e,b^a=bf,c^a=cg,c^b=cg,d^a=dg,h^d=h^3,h^e=h^4,i^d=i^3,i^e=i^4

Conjugacy classes & character table

128 conjugacy classes — view the full character table.

Relationships

maximal subgroup of#534×#1043
maximal normal subgroup of#534×#1043

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