Finite Group Databasebeta

#72226443

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

Aliases

No aliases for this group.

Splittings

SylowC52 ⋊ C2×#1891

Subgroups

subgroupG/H
centerC4#13104917
commutatorC23×C52C23×C4
FrattiniC23C23×#1044
FittingC52×#525C4
socleC2×C52C2×#386
prime radicalC5⋊D5×#525C2
cosocleC22×#1039C24
hypercenter#525#1044
hypocenterC52C2×#1891
LCSG ▷ C23×C52 ▷ C2×C52 ▷ C52
UCSC1 ◁ C4 ◁ C22×C4 ◁ #525

5620 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:

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

Polycyclic presentation:

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

Conjugacy classes & character table

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