Finite Group Databasebeta

?

← Prev (#72308757) Next (#72308759) →

#72308758

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

Aliases

No aliases for this group.

Subgroups

4841 conjugacy classes of subgroups.

Full subgroup data →

Presentation

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

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

Polycyclic presentation:

2^10|a^2=f,c^2=ghj,d^2=ghj,e^2=i,i^2=j,b^a=bfg,c^a=cgh,d^a=dfh,d^b=df,d^c=dghj,e^a=ehij,e^c=ej,e^d=ehj,i^a=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.6);;
gap> SetPower(coll, 3, F.7*F.8*F.10);;
gap> SetPower(coll, 4, F.7*F.8*F.10);;
gap> SetPower(coll, 5, F.9);;
gap> SetPower(coll, 9, F.10);;
gap> SetConjugate(coll, 2, 1, F.2*F.6*F.7);;
gap> SetConjugate(coll, 3, 1, F.3*F.7*F.8);;
gap> SetConjugate(coll, 4, 1, F.4*F.6*F.8);;
gap> SetConjugate(coll, 4, 2, F.4*F.6);;
gap> SetConjugate(coll, 4, 3, F.4*F.7*F.8*F.10);;
gap> SetConjugate(coll, 5, 1, F.5*F.8*F.9*F.10);;
gap> SetConjugate(coll, 5, 3, F.5*F.10);;
gap> SetConjugate(coll, 5, 4, F.5*F.8*F.10);;
gap> SetConjugate(coll, 9, 1, F.9*F.10);;
gap> UpdatePolycyclicCollector(coll);;
gap> G := GroupByRws(coll);