Finite Group Databasebeta

#72279477

order1024
nilpotency class4
automorphism?
homologyAbelianization (H1) = C2×C42 · Schur multiplier (H2) = C26

Aliases

No aliases for this group.

Subgroups

subgroupG/H
center, socleC22#10788
commutatorC22×C8C2×C42
Frattini, cosocleC24×C8C23
prime radicalC24×D8C22
LCSG ▷ C22×C8 ▷ C2×C4 ▷ C2 ▷ C1
UCSC1 ◁ C22 ◁ C24×C4 ◁ C2×C8×C22⋊C4 ◁ G
LECSG ▷ C24×C8 ▷ C2×C4 ▷ C2 ▷ C1

3725 conjugacy classes of subgroups.

Full subgroup data →

Presentation

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

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

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

Polycyclic presentation:

2^10|a^2=g,c^2=d,d^2=j,e^2=ij,i^2=j,c^a=cf,c^b=ce,d^b=dj,e^b=ei,e^c=eij,f^a=fh,g^c=gh,i^b=ij,i^c=ij

Conjugacy classes & character table

106 conjugacy classes — view the full character table.

Relationships

maximal subgroup of#72279884, #72280109
maximal normal subgroup of#72279884, #72280109

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