#72332413

order	1024
nilpotency class	2
automorphism	?
homology	Abelianization (H₁) = C₂⁶ · Schur multiplier (H₂) = C₂¹¹×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 6474 conjugacy classes of subgroups; only the 3333 normal subgroups are shown.

Full subgroup data →

Presentation

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

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

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

Polycyclic presentation:

2^10|c^2=i,d^2=ij,b^a=bj,c^a=ci,c^b=cg,d^a=di,d^b=dij,d^c=dj,f^a=fi,f^b=fgh,f^d=fhij,f^e=fgij

Conjugacy classes & character table

124 conjugacy classes — view the full character table.

Relationships

maximal subgroup of	#72332443
maximal normal subgroup of	#72332443
maximal quotient of	#72333254

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