Finite Group Databasebeta

#72321759

order1024
nilpotency class4
automorphism?
homologyAbelianization (H1) = C23×C4 · Schur multiplier (H2) = C25

Aliases

No aliases for this group.

Subgroups

subgroupG/H
center, socleC22C2×#1807
commutatorC4×C8C23×C4
Frattini, cosocleC2×C4×C8C24
prime radicalC22×#41SD16
LCSG ▷ C4×C8 ▷ C2×C4 ▷ C2 ▷ C1
UCSC1 ◁ C22 ◁ C22×C42 ◁ C2×C8×#41 ◁ G
LECSG ▷ C2×C4×C8 ▷ C2×C4 ▷ C2 ▷ C1

1314 conjugacy classes of subgroups.

Full subgroup data →

Presentation

minimal degreeμ(G) = 32
transitive degreeμt(G) = 256

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

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

Polycyclic presentation:

2^10|b^2=f,c^2=e,e^2=j,f^2=h,g^2=i,h^2=j,c^a=cg,c^b=cfhj,d^c=di,e^a=ei,e^b=ej,f^c=fh,g^a=gi,h^c=hj

Conjugacy classes & character table

124 conjugacy classes — view the full character table.

Relationships

maximal subgroup of#72321818
maximal normal subgroup of#72321818

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