#72226447

order	6400
automorphism	?
homology	Abelianization (H₁) = C₂×C₄² · Schur multiplier (H₂) = C₂⁶

Aliases

No aliases for this group.

Splittings

Sylow

C₅² ⋊ #10746

Subgroups

	subgroup	G/H
center	C₄	#13104122
commutator	C₂³×C₅²	C₂×C₄²
Frattini	C₂²×C₄	C₂×D₅⋊AGL(1,𝔽₅)
Fitting	C₂×C₅²×#41	C₂×C₄
socle	C₂×C₅²	C₂²⋊#95
prime radical	C₂×#41×C₅⋊D₅	C₂²
cosocle	C₂²×C₄×C₅⋊D₅	C₂³
hypercenter	C₂×#41	D₅⋊AGL(1,𝔽₅)
hypocenter	C₅²	#10746
LCS	G ▷ C₂³×C₅² ▷ C₂×C₅² ▷ C₅²
UCS	C₁ ◁ C₄ ◁ C₂²×C₄ ◁ C₂×#41

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

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

Polycyclic presentation:

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

Conjugacy classes & character table

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