Finite Group Databasebeta

#72261967

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

Aliases

No aliases for this group.

Subgroups

subgroupG/H
center, socleC22#10980
commutatorC22×C42C22×C4
Frattini, cosocleC22×C4×D4C23
prime radical#4930070C2
LCSG ▷ C22×C42 ▷ C23 ▷ C2 ▷ C1
UCSC1 ◁ C22 ◁ C23×C4 ◁ C2×#2275 ◁ G
LECSG ▷ C22×C4×D4 ▷ C23 ▷ C2 ▷ C1

3131 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,5)(4,7)(6,8)(9,10)(11,18)(12,16,21,14)(13,17)(15,19)(20,22,24,23);(3,8)(5,6)(10,14,17,16)(15,22,18,23);(2,5,7,6)(9,11,13,19)(10,15)(12,20,21,24)(14,22)(16,23)(17,18)

Polycyclic presentation:

2^10|a^2=e,b^2=h,c^2=ghj,d^2=i,f^2=j,b^a=bf,c^a=cd,c^b=cg,d^a=di,d^b=di,d^c=dj,e^b=eh,f^a=fhj,f^e=fj,g^a=gi,h^a=hj

Conjugacy classes & character table

76 conjugacy classes — view the full character table.

Relationships

maximal subgroup of#72261971, #72262041
maximal normal subgroup of#72261971, #72262041

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