Finite Group Databasebeta

#72308128

order1024
nilpotency class4
automorphism?
homologyAbelianization (H1) = C23 · Schur multiplier (H2) = C25

Aliases

No aliases for this group.

Subgroups

subgroupG/H
center, socleC22#9914
commutator, Frattini, cosocleC23×M16C23
LCSG ▷ C23×M16 ▷ C22×C4 ▷ C2 ▷ C1
UCSC1 ◁ C22 ◁ C23×C4 ◁ C23×M16 ◁ G
LECSG ▷ C23×M16 ▷ C22×C4 ▷ C2 ▷ C1

2903 conjugacy classes of subgroups; only the 95 normal subgroups are shown.

normal subgroups only

This group has 2903 conjugacy classes of subgroups — too many to draw. Only its 95 normal subgroups are shown.

Dotted edges: containments with no intermediate normal subgroup — omitted non-normal subgroups may lie between.

Full subgroup data →

Presentation

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

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

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

Polycyclic presentation:

2^10|c^2=di,d^2=ij,i^2=j,b^a=bf,c^a=cd,c^b=ce,d^a=di,d^b=dg,e^a=eh,e^c=eg,e^d=ej,f^c=fghj,g^c=gj,h^c=hj,i^a=ij

Conjugacy classes & character table

64 conjugacy classes — view the full character table.

Relationships

maximal subgroup of#72308136
maximal normal subgroup of#72308136

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