Finite Group Databasebeta

#72226413

order6400
automorphism?
homologyAbelianization (H1) = C23×C4 · Schur multiplier (H2) = C27

Aliases

No aliases for this group.

Splittings

FittingC52×#518 ⋊ C22
SylowC52 ⋊ C2×#1904

Subgroups

subgroupG/H
centerC2#72223419
commutatorC2×C4×C52C23×C4
FrattiniC22×C4C22×D52
FittingC52×#518C22
socleC2×C52C2×#386
prime radicalC2×#13106298C2
cosocleC22×C4×C52C24
hypercenter#518D52
hypocenterC52C2×#1904
LCSG ▷ C2×C4×C52 ▷ C2×C52 ▷ C52
UCSC1 ◁ C2 ◁ C22×C4 ◁ #518

5708 conjugacy classes of subgroups.

Full subgroup data →

Presentation

minimal degreeμ(G) = 26
transitive degreeμt(G) = 80

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

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

Polycyclic presentation:

2^8,5^2|a^2=f,b^2=e,f^2=h,b^a=bg,c^a=cfh,e^a=eh,f^c=fh,g^b=gh,i^a=i^4,i^d=i^4,j^a=i^3j,j^d=j^4

Conjugacy classes & character table

310 conjugacy classes — view the full character table.

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