Finite Group Databasebeta

#72265669

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

Aliases

No aliases for this group.

Subgroups

subgroupG/H
centerC2×C4C2×#390
commutatorC2×C42C23×C4
Frattini, cosocleC22×C42C24
socleC22C2×#1438
prime radical#10575323C2
LCSG ▷ C2×C42 ▷ C22 ▷ C1
UCSC1 ◁ C2×C4 ◁ C23×C42 ◁ G
LECSG ▷ C22×C42 ▷ C22 ▷ C1

5695 conjugacy classes of subgroups.

Full subgroup data →

Presentation

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

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

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

Polycyclic presentation:

2^10|b^2=f,c^2=gij,e^2=i,g^2=j,h^2=j,b^a=be,c^a=cg,c^b=cghj,d^b=di,d^c=dj,e^a=ei,e^c=ej,f^a=fi,g^a=gj

Conjugacy classes & character table

124 conjugacy classes — view the full character table.

Relationships

maximal subgroup of#72265698
maximal normal subgroup of#72265698

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