| order | 1536 |
| automorphism | ? |
| homology | Abelianization (H1) = C24 · Schur multiplier (H2) = C28 |
No aliases for this group.
| Fitting | C3×#12755 ⋊ C2 |
| Sylow | C3 ⋊ #511819 |
5520 conjugacy classes of subgroups.
| minimal degree | μ(G) = 19 |
| transitive degree | μt(G) = 48 |
A minimal faithful permutation representation — 4 generators on 19 points:
(1,3)(2,7)(4,11)(5,12)(6,8)(9,15)(10,13)(14,16)(18,19);(1,3)(2,7,9,15)(4,11)(5,12)(6,14,16,8)(10,13)(17,18,19);(1,2,4,8,5,9,13,14)(3,6,10,7,12,16,11,15);(2,6)(7,8)(9,16)(14,15)Polycyclic presentation:
2^9,3|b^2=f,c^2=h,f^2=i,g^2=i,b^a=be,c^a=ch,c^b=cg,d^b=dfi,d^c=dh,e^c=eh,f^c=fi,f^d=fi,g^a=gh,g^e=gi,h^b=hi,j^d=j^287 conjugacy classes — view the full character table.
| maximal subgroup of | D3×#511819 |
| maximal normal subgroup of | D3×#511819 |
| maximal quotient of | #72253930, #72254320, #72270026 |
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.6);;
gap> SetPower(coll, 3, F.8);;
gap> SetPower(coll, 6, F.9);;
gap> SetPower(coll, 7, F.9);;
gap> SetConjugate(coll, 2, 1, F.2*F.5);;
gap> SetConjugate(coll, 3, 1, F.3*F.8);;
gap> SetConjugate(coll, 3, 2, F.3*F.7);;
gap> SetConjugate(coll, 4, 2, F.4*F.6*F.9);;
gap> SetConjugate(coll, 4, 3, F.4*F.8);;
gap> SetConjugate(coll, 5, 3, F.5*F.8);;
gap> SetConjugate(coll, 6, 3, F.6*F.9);;
gap> SetConjugate(coll, 6, 4, F.6*F.9);;
gap> SetConjugate(coll, 7, 1, F.7*F.8);;
gap> SetConjugate(coll, 7, 5, F.7*F.9);;
gap> SetConjugate(coll, 8, 2, F.8*F.9);;
gap> SetConjugate(coll, 10, 4, F.10^2);;
gap> UpdatePolycyclicCollector(coll);;
gap> G := GroupByRws(coll);