| order | 1536 |
| automorphism | ? |
| homology | Abelianization (H1) = C22×C4×C8 · Schur multiplier (H2) = C24×C4 |
No aliases for this group.
| Fitting | C3×#11404 ⋊ C2 |
| Sylow | C3 ⋊ #479908 |
1268 conjugacy classes of subgroups.
| minimal degree | μ(G) = 43 |
| transitive degree | μt(G) = 768 |
A minimal faithful permutation representation — 4 generators on 43 points:
(1,2)(12,14,15,24,16,22,26,35,17,23,25,36,27,34,38,37)(13,19,20,32,21,31,33,42,18,28,29,40,30,39,41,43);(2,3)(13,18)(19,28)(20,29)(21,30)(31,39)(32,40)(33,41)(42,43);(4,5,6,8,7,9,10,11)(14,22,23,34)(15,25)(19,31,28,39)(20,29)(24,37,36,35)(26,38)(32,43,40,42)(33,41);(2,3)(12,13)(14,19)(15,20)(16,21)(17,18)(22,31)(23,28)(24,32)(25,29)(26,33)(27,30)(34,39)(35,42)(36,40)(37,43)(38,41)Polycyclic presentation:
2^9,3|b^2=e,d^2=f,e^2=g,f^2=h,h^2=i,c^a=ci,d^b=dh,e^d=ei,f^b=fi,j^a=j^2,j^c=j^2,j^d=j^2252 conjugacy classes — view the full character table.
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.5);;
gap> SetPower(coll, 4, F.6);;
gap> SetPower(coll, 5, F.7);;
gap> SetPower(coll, 6, F.8);;
gap> SetPower(coll, 8, F.9);;
gap> SetConjugate(coll, 3, 1, F.3*F.9);;
gap> SetConjugate(coll, 4, 2, F.4*F.8);;
gap> SetConjugate(coll, 5, 4, F.5*F.9);;
gap> SetConjugate(coll, 6, 2, F.6*F.9);;
gap> SetConjugate(coll, 10, 1, F.10^2);;
gap> SetConjugate(coll, 10, 3, F.10^2);;
gap> SetConjugate(coll, 10, 4, F.10^2);;
gap> UpdatePolycyclicCollector(coll);;
gap> G := GroupByRws(coll);