| order | 1536 |
| automorphism | ? |
| homology | Abelianization (H1) = C22×C4 · Schur multiplier (H2) = C23 |
No aliases for this group.
| Fitting | C3×#7179 ⋊ C2 |
| Sylow | C3 ⋊ #136361 |
742 conjugacy classes of subgroups.
| minimal degree | μ(G) = 23 |
| transitive degree | μt(G) = 192 |
A minimal faithful permutation representation — 3 generators on 23 points:
(1,2)(4,6,7,5)(9,13,16,22)(10,18)(11,20)(14,15,17,21)(19,23);(2,3)(4,5,7,6)(10,18)(11,20)(13,21)(14,17)(15,22)(19,23);(2,3)(8,9)(10,13)(11,14)(12,16)(15,23)(17,20)(18,21)(19,22)Polycyclic presentation:
2^9,3|b^2=d,c^2=dg,e^2=g,f^2=h,h^2=i,c^a=cf,c^b=ce,e^a=eh,e^b=eg,e^c=eg,f^a=fhi,f^b=fh,f^c=fh,g^a=gi,h^a=hi,h^b=hi,h^c=hi,j^a=j^2,j^b=j^2,j^c=j^2156 conjugacy classes — view the full character table.
| maximal subgroup of | D3×#136361 |
| maximal normal subgroup of | D3×#136361 |
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, 3]);;
gap> SetPower(coll, 2, F.4);;
gap> SetPower(coll, 3, F.4*F.7);;
gap> SetPower(coll, 5, F.7);;
gap> SetPower(coll, 6, F.8);;
gap> SetPower(coll, 8, F.9);;
gap> SetConjugate(coll, 3, 1, F.3*F.6);;
gap> SetConjugate(coll, 3, 2, F.3*F.5);;
gap> SetConjugate(coll, 5, 1, F.5*F.8);;
gap> SetConjugate(coll, 5, 2, F.5*F.7);;
gap> SetConjugate(coll, 5, 3, F.5*F.7);;
gap> SetConjugate(coll, 6, 1, F.6*F.8*F.9);;
gap> SetConjugate(coll, 6, 2, F.6*F.8);;
gap> SetConjugate(coll, 6, 3, F.6*F.8);;
gap> SetConjugate(coll, 7, 1, F.7*F.9);;
gap> SetConjugate(coll, 8, 1, F.8*F.9);;
gap> SetConjugate(coll, 8, 2, F.8*F.9);;
gap> SetConjugate(coll, 8, 3, F.8*F.9);;
gap> SetConjugate(coll, 10, 1, F.10^2);;
gap> SetConjugate(coll, 10, 2, F.10^2);;
gap> SetConjugate(coll, 10, 3, F.10^2);;
gap> UpdatePolycyclicCollector(coll);;
gap> G := GroupByRws(coll);