#72227682

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

Aliases

No aliases for this group.

Subgroups

	subgroup	G/H
center, socle	C₂³	C₂×B(4,𝔽₂)
commutator, Frattini, cosocle	C₂²×C₂²⋊C₄	C₂⁴
prime radical	C₂⁷	D₄
LCS	G ▷ C₂²×C₂²⋊C₄ ▷ C₂³ ▷ C₂ ▷ C₁
UCS	C₁ ◁ C₂³ ◁ C₂⁵ ◁ C₂³×C₂²⋊C₄ ◁ G
LECS	G ▷ C₂²×C₂²⋊C₄ ▷ C₂³ ▷ C₂ ▷ C₁

6622 conjugacy classes of subgroups.

Full subgroup data →

Presentation

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

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

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

Polycyclic presentation:

2^10|a^2=g,b^2=h,e^2=h,b^a=be,c^a=cf,c^b=chij,d^b=dgh,e^a=eh,e^b=eh,e^c=ehi,f^b=fhi,f^e=fj,i^a=ij

Conjugacy classes & character table

76 conjugacy classes — view the full character table.

Relationships

maximal subgroup of	#72227689
maximal normal subgroup of	#72227689

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