Finite Group Databasebeta

#72226469

order6400
automorphism?
homologyAbelianization (H1) = C2×C42 · Schur multiplier (H2) = C26×C5

Aliases

No aliases for this group.

Splittings

FittingC52×#518 ⋊ C4
SylowC52 ⋊ #10785

Subgroups

subgroupG/H
centerC2#72226468
commutatorC2×C4×C52C2×C42
FrattiniC22×C4C22×#1044
FittingC52×#518C4
socleC2×C52C22⋊#95
prime radicalC22×D4×C5⋊D5C22
cosocleC22×C4×C5⋊D5C23
hypercenter#518#1044
hypocenterC52#10785
LCSG ▷ C2×C4×C52 ▷ C2×C52 ▷ C52
UCSC1 ◁ C2 ◁ C22×C4 ◁ #518

4708 conjugacy classes of subgroups.

Full subgroup data →

Presentation

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

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

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

Polycyclic presentation:

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

Conjugacy classes & character table

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