Finite Group Databasebeta

?

← Prev (#72227358) Next (#72227360) →

#72227359

• supersolvable
• metabelian
• solvable
• monomial

Aliases

No aliases for this group.

Splittings

Subgroups

1556 conjugacy classes of subgroups.

Full subgroup data →

Presentation

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

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

Polycyclic presentation:

2^8,3^2|a^2=e,b^2=eg,e^2=h,f^2=g,g^2=h,b^a=bf,c^a=ch,c^b=ch,e^b=eh,f^a=fg,f^b=fg,g^a=gh,g^b=gh,i^b=i^2,i^d=i^2,j^b=i^2j,j^d=j^2

Conjugacy classes & character table

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