#72234032

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

Full subgroup data →

Presentation

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

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

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

Polycyclic presentation:

2^10|a^2=g,e^2=j,f^2=i,c^b=cgh,d^a=dg,d^c=dj,e^a=eh,e^b=ehi,e^c=eh,f^c=fhj,f^d=fi,f^e=fj

Conjugacy classes & character table

124 conjugacy classes — view the full character table.

Relationships

maximal subgroup of	#72234056
maximal normal subgroup of	#72234056

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