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