Finite Group Databasebeta

?

← Prev (#72313214) Next (#72313216) →

#72313215

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

Aliases

No aliases for this group.

Subgroups

3164 conjugacy classes of subgroups.

Full subgroup data →

Presentation

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

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

Polycyclic presentation:

2^10|a^2=g,b^2=f,c^2=fg,d^2=fg,e^2=fhi,h^2=i,i^2=j,b^a=bg,c^a=cg,d^b=dg,e^b=eh,e^c=eh,e^d=eij,f^e=fj,h^b=hi,h^c=hi,h^d=hj,h^e=hj,i^b=ij,i^c=ij

Conjugacy classes & character table

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