Finite Group Databasebeta

#72284853

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

Aliases

No aliases for this group.

Subgroups

subgroupG/H
center, socleC22#46996
commutator, Frattini, cosocleC25C25
LCSG ▷ C25 ▷ C22 ▷ C1
UCSC1 ◁ C22 ◁ C25 ◁ G
LECSG ▷ C25 ▷ C22 ▷ C1

3514 conjugacy classes of subgroups.

Full subgroup data →

Presentation

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

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

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

Polycyclic presentation:

2^10|b^2=f,c^2=fgi,d^2=gj,e^2=gh,b^a=bg,c^a=ch,c^b=chi,d^a=dgj,d^b=dfgi,d^c=dh,e^a=egh,e^b=efgi,e^c=efhj,e^d=ehj,f^a=fi,f^c=fj,f^d=fi,f^e=fi,g^b=gi,g^c=gj,g^e=gj,h^b=hj,h^c=hi,h^d=hj,h^e=hj

Conjugacy classes & character table

61 conjugacy classes — view the full character table.

Relationships

maximal subgroup of#72285163, #72285526, #72310975, …
maximal normal subgroup of#72285163, #72285526, #72310975, …

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