#72336487

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 8880 conjugacy classes of subgroups; only the 3077 normal subgroups are shown.

Full subgroup data →

Presentation

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

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

(2,5)(3,7)(10,13)(11,15)(17,18)(19,22)(20,21)(23,24)(26,29)(27,31);(10,13)(11,15)(18,21)(19,23)(25,26,28,29)(27,32,31,30);(3,7)(6,8)(10,13)(11,15)(19,23)(22,24)(27,31)(30,32);(2,5)(3,7)(10,13)(14,16);(1,2,4,5)(3,6,7,8)(9,10)(11,14)(12,13)(15,16)(17,18)(19,22)(20,21)(23,24)(25,26)(27,30)(28,29)(31,32);(1,3)(2,6)(4,7)(5,8)(9,11,12,15)(10,14,13,16)(17,19,20,23)(18,22,21,24)(25,27,28,31)(26,30,29,32)

Polycyclic presentation:

2^10|b^2=i,e^2=hij,f^2=gh,b^a=bg,e^a=ej,e^b=egh,e^c=eh,e^d=eij,f^a=fj,f^b=fgh,f^c=fgij,f^d=fhij

Conjugacy classes & character table

130 conjugacy classes — view the full character table.

Relationships

maximal subgroup of	#72336494
maximal normal subgroup of	#72336494

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