Finite Group Databasebeta

#72321241

order1024
nilpotency class4
automorphism?
homologyAbelianization (H1) = C22×C42 · Schur multiplier (H2) = C24×C4

Aliases

No aliases for this group.

Subgroups

subgroupG/H
centerC2×C4C22×#102
commutatorC2×C8C22×C42
Frattini, cosocleC2×C4×C8C24
socleC22C2×C4×#102
prime radicalC22×#135C2×C4
LCSG ▷ C2×C8 ▷ C4 ▷ C2 ▷ C1
UCSC1 ◁ C2×C4 ◁ C2×C4×M16 ◁ C2×C8×M16 ◁ G
LECSG ▷ C2×C4×C8 ▷ C2×C4 ▷ C2 ▷ C1

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

Polycyclic presentation:

2^10|a^2=e,d^2=g,e^2=i,f^2=h,g^2=i,h^2=j,b^a=bf,d^c=di,e^b=ej,f^a=fh,f^b=fhj,h^a=hj,h^b=hj

Conjugacy classes & character table

160 conjugacy classes — view the full character table.

Relationships

maximal subgroup of#72321349
maximal normal subgroup of#72321349

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