Finite Group Databasebeta

?

← Prev (#72302172) Next (#72302174) →

#72302173

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

Aliases

No aliases for this group.

Subgroups

3921 conjugacy classes of subgroups.

Full subgroup data →

Presentation

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

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

Polycyclic presentation:

2^10|a^2=h,b^2=f,c^2=i,g^2=j,b^a=bg,c^a=cj,c^b=cfj,d^a=dj,d^b=de,d^c=dei,e^b=ei,f^d=fi,g^b=gj,h^b=hj

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