#72279404

order	1024
nilpotency class	5
automorphism	?
homology	Abelianization (H₁) = C₂×C₄² · Schur multiplier (H₂) = C₂⁵×C₄

Aliases

No aliases for this group.

Subgroups

	subgroup	G/H
center, socle	C₂²	#13082
commutator	C₂²×D₄	C₂×C₄²
Frattini, cosocle	C₂²×#127	C₂³
prime radical	C₂²×#453	C₂²
LCS	G ▷ C₂²×D₄ ▷ C₂×C₄ ▷ C₂² ▷ C₂ ▷ C₁
UCS	C₁ ◁ C₂² ◁ C₂⁴ ◁ C₂²×C₄² ◁ C₂×C₄×#127 ◁ G
LECS	G ▷ C₂²×#127 ▷ C₂×C₄ ▷ C₂² ▷ C₂ ▷ C₁

2117 conjugacy classes of subgroups.

Full subgroup data →

Presentation

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

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

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

Polycyclic presentation:

2^10|a^2=g,b^2=d,g^2=ij,h^2=j,b^a=bi,c^a=cf,c^b=ce,e^a=ej,f^a=fh,g^c=ghj,g^f=gij,h^a=hi,h^c=hj,h^f=hj,i^c=ij

Conjugacy classes & character table

82 conjugacy classes — view the full character table.

Relationships

maximal subgroup of	#72279473
maximal normal subgroup of	#72279473

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