Finite Group Databasebeta

?

← Prev (#72309920) Next (#72309922) →

#72309921

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

Aliases

No aliases for this group.

Subgroups

1442 conjugacy classes of subgroups.

Full subgroup data →

Presentation

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

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

Polycyclic presentation:

2^10|a^2=e,b^2=gj,c^2=h,d^2=ej,f^2=h,g^2=i,i^2=j,b^a=bg,c^a=cf,c^b=cfhj,d^a=dj,d^b=dij,d^c=dh,e^b=ej,f^a=fh,f^b=fh,f^c=fh,g^a=gi,g^d=gj,i^a=ij

Conjugacy classes & character table

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