#72258306

order	1024
nilpotency class	4
automorphism	?
homology	Abelianization (H₁) = C₂³×C₄ · Schur multiplier (H₂) = C₂⁶

Aliases

No aliases for this group.

Subgroups

	subgroup	G/H
center, socle	C₂²	#18524
commutator	C₄×C₈	C₂³×C₄
Frattini, cosocle	C₂×C₄×C₈	C₂⁴
prime radical	C₂×#33688	C₂
LCS	G ▷ C₄×C₈ ▷ C₂×C₄ ▷ C₂ ▷ C₁
UCS	C₁ ◁ C₂² ◁ C₂²×C₄ ◁ C₂×C₄×M₁₆ ◁ G
LECS	G ▷ C₂×C₄×C₈ ▷ C₂×C₄ ▷ C₂ ▷ C₁

2147 conjugacy classes of subgroups.

Full subgroup data →

Presentation

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

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

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

Polycyclic presentation:

2^10|d^2=e,f^2=h,g^2=i,i^2=j,b^a=bg,c^a=cj,c^b=ch,d^b=df,f^a=fi,f^b=fh,f^d=fh,g^a=gij,g^b=gij,g^c=gj,g^d=gij,h^a=hj,i^a=ij,i^b=ij,i^d=ij

Conjugacy classes & character table

88 conjugacy classes — view the full character table.

Relationships

maximal subgroup of	C₄×#489347
maximal normal subgroup of	C₄×#489347

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