#72242823

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

Aliases

No aliases for this group.

Splittings

Fitting	C₅×#1783 ⋊ C₄
Sylow	C₅ ⋊ #107130

Subgroups

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

5764 conjugacy classes of subgroups.

Full subgroup data →

Presentation

minimal degree	μ(G) = 21
transitive degree	μ_t(G) = 80

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

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

Polycyclic presentation:

2^9,5|a^2=e,b^2=d,e^2=i,b^a=bef,c^a=cg,c^b=chi,e^b=eh,e^c=ei,f^a=fhi,f^b=fhi,g^a=gi,g^b=gi,j^b=j^3,j^d=j^4

Conjugacy classes & character table

112 conjugacy classes — view the full character table.

Relationships

maximal subgroup of	#72242830, AGL(1,𝔽₅)×#8453
maximal normal subgroup of	#72242830, AGL(1,𝔽₅)×#8453

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