#72309588

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

Aliases

No aliases for this group.

Subgroups

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

4487 conjugacy classes of subgroups.

Full subgroup data →

Presentation

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

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

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

Polycyclic presentation:

2^10|a^2=h,b^2=f,c^2=f,g^2=i,h^2=j,b^a=bh,c^a=cj,c^b=cj,d^a=dg,d^c=dg,e^b=ej,e^d=ei,g^a=gi,g^c=gi,g^d=gi,h^b=hj

Conjugacy classes & character table

130 conjugacy classes — view the full character table.

Relationships

maximal subgroup of	#72309619
maximal normal subgroup of	#72309619

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