#72269846

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

Aliases

No aliases for this group.

Splittings

Fitting	C₅×#1913 ⋊ C₄
Sylow	C₅ ⋊ #368246

Subgroups

	subgroup	G/H
center	C₂	#13028243
commutator	C₂⁴×C₅	C₂³×C₄
Frattini	C₂⁴	C₂³×AGL(1,𝔽₅)
Fitting	C₅×#1913	C₄
socle	C₂×C₅	#14016
prime radical	D₅×#534	C₂²
cosocle	C₂⁴×D₅	C₂⁴
hypercenter	#1913	AGL(1,𝔽₅)
hypocenter	C₅	#368246
LCS	G ▷ C₂⁴×C₅ ▷ C₂×C₅ ▷ C₅
UCS	C₁ ◁ C₂ ◁ C₂⁴ ◁ #1913

3422 conjugacy classes of subgroups.

Full subgroup data →

Presentation

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

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

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

Polycyclic presentation:

2^9,5|a^2=g,b^2=e,c^2=h,b^a=bgi,c^a=cf,d^a=dfh,d^b=dh,d^c=dh,f^c=fi,g^d=gi,h^a=hi,j^b=j^3,j^e=j^4

Conjugacy classes & character table

109 conjugacy classes — view the full character table.

Relationships

maximal subgroup of	AGL(1,𝔽₅)×#23996, #72269861, #72269866
maximal normal subgroup of	AGL(1,𝔽₅)×#23996, #72269861, #72269866

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