#72336181

order	1024
nilpotency class	2
automorphism	?
homology	Abelianization (H₁) = C₂⁷ · Schur multiplier (H₂) = C₂¹⁸

Aliases

No aliases for this group.

Subgroups

	subgroup	G/H
center, commutator, Frattini, socle, cosocle	C₂³	C₂⁷
LCS	G ▷ C₂³ ▷ C₁
UCS	C₁ ◁ C₂³ ◁ G
LECS	G ▷ C₂³ ▷ C₁

At least 39850 conjugacy classes of subgroups; only the 29385 normal subgroups are shown.

Full subgroup data →

Presentation

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

A minimal faithful permutation representation — 7 generators on 24 points:

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

Polycyclic presentation:

2^10|f^2=j,g^2=hi,b^a=bh,c^b=ci,f^a=fj,f^c=fhi,f^d=fi,f^e=fij,g^a=gj,g^c=ghi,g^d=ghij,g^e=gj

Conjugacy classes & character table

160 conjugacy classes — view the full character table.

Relationships

maximal quotient of

#72336494

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