#72297955

order	1024
nilpotency class	2
automorphism	?
homology	Abelianization (H₁) = C₂⁶ · Schur multiplier (H₂) = C₂¹⁴

Aliases

No aliases for this group.

Subgroups

	subgroup	G/H
center, commutator, Frattini, socle, cosocle	C₂⁴	C₂⁶
LCS	G ▷ C₂⁴ ▷ C₁
UCS	C₁ ◁ C₂⁴ ◁ G
LECS	G ▷ C₂⁴ ▷ C₁

At least 11582 conjugacy classes of subgroups; only the 4089 normal subgroups are shown.

Full subgroup data →

Presentation

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

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

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

Polycyclic presentation:

2^10|d^2=ghj,b^a=bg,c^b=ch,d^a=dhi,d^b=dghj,d^c=dh,e^c=ei,e^d=eghj,f^a=fg,f^b=fh,f^d=fgh,f^e=fh

Conjugacy classes & character table

142 conjugacy classes — view the full character table.

Relationships

maximal subgroup of	#72297989
maximal normal subgroup of	#72297989
maximal quotient of	#72298575

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