Finite Group Databasebeta

?

← Prev (#72258164) Next (#72258166) →

#72258165

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

Aliases

No aliases for this group.

Subgroups

418 conjugacy classes of subgroups.

Full subgroup data →

Presentation

A minimal faithful permutation representation — 3 generators on 32 points:

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

Polycyclic presentation:

2^10|b^2=d,c^2=e,e^2=g,f^2=h,g^2=i,h^2=j,b^a=bf,c^a=cf,c^b=cfgj,d^a=dj,d^c=di,e^a=eh,e^b=ehi,f^a=fhj,f^b=fh,g^a=gj,g^b=gj,h^a=hj,h^b=hj

Conjugacy classes & character table

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