Finite Group Databasebeta

#72306590

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

Aliases

No aliases for this group.

Subgroups

subgroupG/H
center, socleC2C2×#13561
commutatorC4⋊Q8C23×C4
Frattini, cosocle#492C24
prime radical#6348454C2
LCSG ▷ C4⋊Q8 ▷ C42 ▷ C2×C4 ▷ C22 ▷ C2 ▷ C1
UCSC1 ◁ C2 ◁ C2×C4 ◁ C23×C4 ◁ C22×C42 ◁ #60639 ◁ G
LECSG ▷ #492 ▷ C42 ▷ C2×C4 ▷ C22 ▷ C2 ▷ C1

1877 conjugacy classes of subgroups.

Full subgroup data →

Presentation

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

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

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

Polycyclic presentation:

2^10|c^2=ef,e^2=j,g^2=i,h^2=j,b^a=bij,c^a=cj,c^b=ce,d^a=dj,d^b=dgi,d^c=dgij,e^a=ej,e^b=ej,e^c=eg,e^d=ehi,f^a=fj,f^b=fgi,f^c=fg,f^d=fj,f^e=fhij,g^b=gi,g^c=gh,g^d=gi,g^e=gi,g^f=gi,h^b=hi,h^c=hj,h^d=hj,h^e=hj,h^f=hj,i^c=ij

Conjugacy classes & character table

58 conjugacy classes — view the full character table.

Relationships

maximal subgroup of#72306595, #72306606, #72306638, …
maximal normal subgroup of#72306595, #72306606, #72306638, …

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