Finite Group Databasebeta

?

← Prev (#72319030) Next (#72319032) →

#72319031

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

Aliases

No aliases for this group.

Subgroups

5546 conjugacy classes of subgroups.

Full subgroup data →

Presentation

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

(1,2)(3,4);(5,6,10,13,11,14,9,15)(7,12,16,19,17,18,20,8)(22,26,28,35)(23,29)(24,32)(27,30,33,36)(31,34);(5,7)(6,12)(8,15)(9,20)(10,16)(11,17)(13,19)(14,18)(21,22)(23,30)(24,33)(25,28)(26,34)(27,32)(29,35)(31,36);(5,8,9,18,11,19,10,12)(6,7,15,20,14,17,13,16)(22,27,28,33)(23,31)(26,30,35,36)(29,34);(2,4)(5,9,11,10)(6,13,14,15)(7,16,17,20)(8,18,19,12)(22,28)(26,35)(27,33)(30,36)

Polycyclic presentation:

2^11|b^2=f,d^2=fi,e^2=i,f^2=i,g^2=j,j^2=k,c^b=cg,d^c=djk,e^a=eh,e^b=ei,e^c=eik,f^c=fk,g^b=gj,g^c=gjk,g^d=gk,j^b=jk,j^c=jk

Conjugacy classes & character table

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