Finite Group Databasebeta

#72336154

order1024
nilpotency class2
automorphism?
homologyAbelianization (H1) = C26 · Schur multiplier (H2) = C212×C4

Aliases

No aliases for this group.

Subgroups

subgroupG/H
center, commutator, Frattini, socle, cosocleC24C26
LCSG ▷ C24 ▷ C1
UCSC1 ◁ C24 ◁ G
LECSG ▷ C24 ▷ C1

At least 11929 conjugacy classes of subgroups; only the 3677 normal subgroups are shown.

Full subgroup data →

Presentation

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

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

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

Polycyclic presentation:

2^10|b^2=i,f^2=gi,b^a=bj,c^a=cg,c^b=ci,d^b=dj,d^c=dj,e^b=eij,e^c=eij,f^a=fj,f^c=fi,f^d=fh,f^e=fghi

Conjugacy classes & character table

142 conjugacy classes — view the full character table.

Relationships

maximal subgroup of#72336179
maximal normal subgroup of#72336179
maximal quotient of#72336408

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