Finite Group Databasebeta

?

← Prev (#72248352) Next (#72248354) →

#72248353

• supersolvable
• metabelian
• solvable
• monomial
• stem

Aliases

No aliases for this group.

Splittings

Subgroups

5826 conjugacy classes of subgroups.

Full subgroup data →

Presentation

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

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

Polycyclic presentation:

2^9,3|a^2=h,b^2=g,e^2=i,g^2=i,h^2=i,b^a=be,c^a=cf,c^b=cghi,d^a=dfh,d^b=defgi,e^a=ei,e^d=ei,f^b=fi,g^a=gi,g^d=gi,h^d=hi,j^a=j^2

Conjugacy classes & character table

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