Finite Group Databasebeta

?

← Prev (#72257440) Next (#72257442) →

#72257441

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

Aliases

No aliases for this group.

Subgroups

2159 conjugacy classes of subgroups.

Full subgroup data →

Presentation

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

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

Polycyclic presentation:

2^10|b^2=h,c^2=g,d^2=egh,e^2=i,g^2=j,i^2=j,c^a=cf,c^b=ch,d^a=dfgi,d^b=dgh,d^c=de,e^b=ej,e^c=ei,f^d=fj,g^d=gj,h^d=hj,i^c=ij

Conjugacy classes & character table

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