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