| order | 1536 |
| automorphism | ? |
| homology | Abelianization (H1) = C24 · Schur multiplier (H2) = C26 |
No aliases for this group.
| 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)(5,9)(6,10);(2,3)(4,6)(5,8)(7,10)(9,11)(12,14)(13,18)(15,22,25,24)(16,23)(17,20)(19,26,27,21);(4,5,7,9)(6,8,10,11)(12,14)(13,17)(15,24)(16,23)(18,20)(19,26)(21,27)(22,25);(12,13)(14,21,23,26)(15,19)(16,20)(17,22,18,24)(25,27)Polycyclic presentation:
2^9,3|a^2=h,b^2=g,c^2=e,f^2=i,b^a=bf,c^a=cfi,c^b=ce,d^b=dg,d^c=dg,e^a=eh,f^b=fi,f^c=fhi,f^e=fi,h^b=hi,h^c=hi,j^c=j^299 conjugacy classes — view the full character table.
| maximal subgroup of | #72253711, #72270758, D3×#512119, … |
| maximal normal subgroup of | #72253711, #72270758, 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.8);;
gap> SetPower(coll, 2, F.7);;
gap> SetPower(coll, 3, F.5);;
gap> SetPower(coll, 6, F.9);;
gap> SetConjugate(coll, 2, 1, F.2*F.6);;
gap> SetConjugate(coll, 3, 1, F.3*F.6*F.9);;
gap> SetConjugate(coll, 3, 2, F.3*F.5);;
gap> SetConjugate(coll, 4, 2, F.4*F.7);;
gap> SetConjugate(coll, 4, 3, F.4*F.7);;
gap> SetConjugate(coll, 5, 1, F.5*F.8);;
gap> SetConjugate(coll, 6, 2, F.6*F.9);;
gap> SetConjugate(coll, 6, 3, F.6*F.8*F.9);;
gap> SetConjugate(coll, 6, 5, F.6*F.9);;
gap> SetConjugate(coll, 8, 2, F.8*F.9);;
gap> SetConjugate(coll, 8, 3, F.8*F.9);;
gap> SetConjugate(coll, 10, 3, F.10^2);;
gap> UpdatePolycyclicCollector(coll);;
gap> G := GroupByRws(coll);