| order | 1536 |
| automorphism | ? |
| homology | Abelianization (H1) = C24 · Schur multiplier (H2) = C27 |
No aliases for this group.
| Fitting | C2×C3×#3025 ⋊ C2 |
| Sylow | C3 ⋊ #498929 |
4612 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,3)(8,10)(9,14)(11,17)(12,18)(13,20)(15,22)(16,21)(19,23);(2,3)(5,7)(9,13)(11,19)(14,20)(15,16)(17,23)(21,22);(8,9,12,16)(10,14,18,21)(11,13,19,15)(17,20,23,22);(4,5)(6,7)(13,15)(14,21)Polycyclic presentation:
2^9,3|b^2=i,e^2=i,b^a=bg,c^a=cf,c^b=ce,d^a=dh,e^a=eh,e^b=ei,e^c=ei,f^b=fi,g^c=gh,g^d=gi,g^e=gi,h^b=hi,j^c=j^2120 conjugacy classes — view the full character table.
| maximal subgroup of | D3×#498929, #72270922, #72270962 |
| maximal normal subgroup of | D3×#498929, #72270922, #72270962 |
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.9);;
gap> SetPower(coll, 5, F.9);;
gap> SetConjugate(coll, 2, 1, F.2*F.7);;
gap> SetConjugate(coll, 3, 1, F.3*F.6);;
gap> SetConjugate(coll, 3, 2, F.3*F.5);;
gap> SetConjugate(coll, 4, 1, F.4*F.8);;
gap> SetConjugate(coll, 5, 1, F.5*F.8);;
gap> SetConjugate(coll, 5, 2, F.5*F.9);;
gap> SetConjugate(coll, 5, 3, F.5*F.9);;
gap> SetConjugate(coll, 6, 2, F.6*F.9);;
gap> SetConjugate(coll, 7, 3, F.7*F.8);;
gap> SetConjugate(coll, 7, 4, F.7*F.9);;
gap> SetConjugate(coll, 7, 5, F.7*F.9);;
gap> SetConjugate(coll, 8, 2, F.8*F.9);;
gap> SetConjugate(coll, 10, 3, F.10^2);;
gap> UpdatePolycyclicCollector(coll);;
gap> G := GroupByRws(coll);