#72303496

order	1024
nilpotency class	4
automorphism	?
homology	Abelianization (H₁) = C₂³×C₄ · Schur multiplier (H₂) = C₂⁶×C₄

Aliases

No aliases for this group.

Subgroups

	subgroup	G/H
center	C₂×C₄	C₂×B(4,𝔽₂)
commutator	C₂²×D₄	C₂³×C₄
Frattini, cosocle	C₂²×#41	C₂⁴
socle	C₂²	C₂×#1790
prime radical	#7633633	C₂
LCS	G ▷ C₂²×D₄ ▷ C₂² ▷ C₂ ▷ C₁
UCS	C₁ ◁ C₂×C₄ ◁ C₂×C₄² ◁ C₂×C₄×#41 ◁ G
LECS	G ▷ C₂²×#41 ▷ C₂² ▷ C₂ ▷ C₁

4009 conjugacy classes of subgroups.

Full subgroup data →

Presentation

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

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

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

Polycyclic presentation:

2^10|a^2=h,d^2=e,e^2=j,c^b=ch,d^a=dh,d^b=dg,d^c=df,f^b=fi,g^c=gij,g^f=gj,i^d=ij

Conjugacy classes & character table

94 conjugacy classes — view the full character table.

Relationships

maximal quotient of

#72303532

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