Finite Group Databasebeta

?

← Prev (#72308450) Next (#72308452) →

#72308451

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

Aliases

No aliases for this group.

Subgroups

4313 conjugacy classes of subgroups.

Full subgroup data →

Presentation

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

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

Polycyclic presentation:

2^10|a^2=g,c^2=g,d^2=g,e^2=i,i^2=j,c^a=cf,c^b=cfh,d^a=df,d^b=dfg,d^c=dghj,e^a=ei,e^c=egh,e^d=egh,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.7);;
gap> SetPower(coll, 3, F.7);;
gap> SetPower(coll, 4, F.7);;
gap> SetPower(coll, 5, F.9);;
gap> SetPower(coll, 9, F.10);;
gap> SetConjugate(coll, 3, 1, F.3*F.6);;
gap> SetConjugate(coll, 3, 2, F.3*F.6*F.8);;
gap> SetConjugate(coll, 4, 1, F.4*F.6);;
gap> SetConjugate(coll, 4, 2, F.4*F.6*F.7);;
gap> SetConjugate(coll, 4, 3, F.4*F.7*F.8*F.10);;
gap> SetConjugate(coll, 5, 1, F.5*F.9);;
gap> SetConjugate(coll, 5, 3, F.5*F.7*F.8);;
gap> SetConjugate(coll, 5, 4, F.5*F.7*F.8);;
gap> SetConjugate(coll, 9, 1, F.9*F.10);;
gap> UpdatePolycyclicCollector(coll);;
gap> G := GroupByRws(coll);