Finite Group Databasebeta

#72251926

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

Aliases

No aliases for this group.

Subgroups

subgroupG/H
center, socleC2#3564175
commutator, Frattini, cosocleC23×C4C25
LCSG ▷ C23×C4 ▷ C2 ▷ C1
UCSC1 ◁ C2 ◁ C23×C4 ◁ G
LECSG ▷ C23×C4 ▷ C2 ▷ C1

4543 conjugacy classes of subgroups.

Full subgroup data →

Presentation

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

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

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

Polycyclic presentation:

2^10|b^2=g,c^2=fgh,d^2=fhij,e^2=j,h^2=j,b^a=bf,c^a=cfi,c^b=cfgh,d^a=dij,d^b=dfgij,d^c=dgij,e^a=eij,e^b=eghj,e^c=ehj,e^d=eh,f^c=fj,f^d=fj,f^e=fj,g^d=gj,h^b=hj,h^c=hj,h^d=hj,h^e=hj,i^b=ij,i^c=ij

Conjugacy classes & character table

76 conjugacy classes — view the full character table.

Relationships

maximal subgroup of#72251931, #72251940, #72251954
maximal normal subgroup of#72251931, #72251940, #72251954

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