#72282465

order	1024
nilpotency class	4
automorphism	?
homology	Abelianization (H₁) = C₂⁴ · Schur multiplier (H₂) = C₂⁷

Aliases

No aliases for this group.

Subgroups

	subgroup	G/H
center, socle	C₂²	C₂×#2021
commutator, Frattini, cosocle	C₂×C₄×D₄	C₂⁴
LCS	G ▷ C₂×C₄×D₄ ▷ C₂³ ▷ C₂ ▷ C₁
UCS	C₁ ◁ C₂² ◁ C₂³×C₄ ◁ C₂²×C₄×D₄ ◁ G
LECS	G ▷ C₂×C₄×D₄ ▷ C₂³ ▷ C₂ ▷ C₁

4974 conjugacy classes of subgroups.

Full subgroup data →

Presentation

minimal degree	μ(G) = 24
transitive degree	μ_t(G) = 64

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

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

Polycyclic presentation:

2^10|a^2=e,b^2=g,c^2=j,e^2=ij,f^2=j,b^a=bf,c^a=cef,c^b=cgj,d^a=dj,e^b=ej,e^c=ei,f^b=fh,g^a=ghj,g^f=gj,h^b=hj,h^c=hj

Conjugacy classes & character table

79 conjugacy classes — view the full character table.

Relationships

maximal subgroup of	#72282500, #72282619, #72282848
maximal normal subgroup of	#72282500, #72282619, #72282848

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