#72258156

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

Aliases

No aliases for this group.

Subgroups

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

5773 conjugacy classes of subgroups.

Full subgroup data →

Presentation

minimal degree	μ(G) = 16
transitive degree	μ_t(G) = 64

A minimal faithful permutation representation — 4 generators on 16 points:

(9,10)(11,13,16,15)(12,14);(5,7)(9,11,12,16)(10,13)(14,15);(1,2)(3,7)(4,6)(5,8)(9,10)(11,15)(12,14)(13,16);(1,3)(2,5)(4,8)(6,7)(9,11)(10,13)(12,16)(14,15)

Polycyclic presentation:

2^10|a^2=h,b^2=ghj,b^a=bg,c^a=ch,c^b=cf,d^a=dghj,d^b=de,d^c=di,e^a=ej,e^c=ei,f^b=fj,f^d=fi,g^a=gj,g^b=gj,g^c=gj,g^d=gj,h^b=hj,h^d=hj

Conjugacy classes & character table

79 conjugacy classes — view the full character table.

Relationships

maximal subgroup of	#72258179
maximal normal subgroup of	#72258179

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