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