#72309751

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

Aliases

No aliases for this group.

Subgroups

	subgroup	G/H
center, socle	C₂³	C₂×#442
commutator	C₂²×C₈	C₂³×C₄
Frattini, cosocle	C₂³×C₈	C₂⁴
prime radical	C₂²×#466	C₂²
LCS	G ▷ C₂²×C₈ ▷ C₄ ▷ C₂ ▷ C₁
UCS	C₁ ◁ C₂³ ◁ C₂⁴×C₄ ◁ C₂³×#97 ◁ G
LECS	G ▷ C₂³×C₈ ▷ C₄ ▷ C₂ ▷ C₁

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

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

Polycyclic presentation:

2^10|a^2=e,b^2=fj,d^2=e,f^2=i,h^2=ij,i^2=j,b^a=bf,c^a=cg,c^b=cg,d^b=dfhi,e^b=ej,f^a=fi,f^d=fj,h^a=hij,h^d=hj,i^a=ij

Conjugacy classes & character table

112 conjugacy classes — view the full character table.

Relationships

maximal subgroup of	#72309762, D₄×#12956, #72309946
maximal normal subgroup of	#72309762, D₄×#12956, #72309946

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