Finite Group Databasebeta

?

← Prev (#72338726) Next (#72338728) →

#72338727

• p-group
• nilpotent
• supersolvable
• metabelian
• solvable
• monomial
• stem

Aliases

No aliases for this group.

Subgroups

5241 conjugacy classes of subgroups.

Full subgroup data →

Presentation

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

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

Polycyclic presentation:

2^10|c^2=g,e^2=j,b^a=bh,c^a=cf,c^b=ce,d^a=di,d^b=dij,d^c=dhj,e^a=eh,e^b=ej,e^c=ei,e^d=ej,f^b=fh,f^d=fj,g^b=gij,g^e=gj,i^c=ij

Conjugacy classes & character table

76 conjugacy classes — view the full character table.

Relationships

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