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