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