Finite Group Databasebeta

#72279486

order1024
nilpotency class3
automorphism?
homologyAbelianization (H1) = C2×C42 · Schur multiplier (H2) = C25×C4

Aliases

No aliases for this group.

Subgroups

subgroupG/H
centerC2×C4#1436
commutatorC2×C42C2×C42
Frattini, cosocleC23×C42C23
socleC22#7557
prime radicalC25#120
LCSG ▷ C2×C42 ▷ C2 ▷ C1
UCSC1 ◁ C2×C4 ◁ C23×C42 ◁ G
LECSG ▷ C23×C42 ▷ C22 ▷ C1

2615 conjugacy classes of subgroups.

Full subgroup data →

Presentation

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

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

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

Polycyclic presentation:

2^10|a^2=f,b^2=h,c^2=de,d^2=i,g^2=j,b^a=bh,c^a=cd,c^b=cg,e^a=ei,e^b=ej,f^c=fi,g^a=gj,h^c=hj

Conjugacy classes & character table

112 conjugacy classes — view the full character table.

Relationships

maximal subgroup of#72279541, #72279799, #72280069
maximal normal subgroup of#72279541, #72279799, #72280069

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