Finite Group Databasebeta

#72303625

order1024
nilpotency class4
automorphism?
homologyAbelianization (H1) = C22×C4 · Schur multiplier (H2) = C27

Aliases

No aliases for this group.

Subgroups

subgroupG/H
centerC2×C4#2021
commutatorC23×D4C22×C4
Frattini, cosocleC23×#41C23
socleC22#10995
prime radical#608791C2
LCSG ▷ C23×D4 ▷ C23 ▷ C2 ▷ C1
UCSC1 ◁ C2×C4 ◁ C23×C4 ◁ C23×#41 ◁ G
LECSG ▷ C23×#41 ▷ C23 ▷ C2 ▷ C1

5079 conjugacy classes of subgroups.

Full subgroup data →

Presentation

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

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

(1,2)(3,7,8,5)(4,6)(10,14,16,20)(12,19)(15,21,22,24)(17,23);(1,2)(3,5)(4,6)(7,8)(14,20)(21,24);(1,3)(2,5)(4,8)(6,7)(9,10,11,15,13,16,18,22)(12,14,17,21,19,20,23,24)

Polycyclic presentation:

2^10|a^2=g,c^2=d,d^2=j,b^a=bg,c^a=ce,c^b=cf,e^a=eh,e^b=ehi,f^a=fij,f^e=fj,g^c=gh,i^c=ij

Conjugacy classes & character table

88 conjugacy classes — view the full character table.

Relationships

maximal subgroup of#72303627, #72304164
maximal normal subgroup of#72303627, #72304164

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