| order | 1536 |
| automorphism | ? |
| homology | Abelianization (H1) = C22×C4 · Schur multiplier (H2) = C26 |
No aliases for this group.
| Fitting | C3×#10989 ⋊ C2 |
| Sylow | C3 ⋊ #133356 |
2332 conjugacy classes of subgroups.
| minimal degree | μ(G) = 27 |
| transitive degree | μt(G) = 96 |
A minimal faithful permutation representation — 3 generators on 27 points:
(1,3)(2,5)(4,8)(6,7)(12,20)(16,22)(26,27);(1,2)(3,7,8,5)(4,6)(9,11)(10,14,15,21)(12,18)(13,19)(16,17,22,23)(20,24)(25,26,27);(9,10)(11,17,19,23)(12,16)(13,15)(14,18,21,24)(20,22)Polycyclic presentation:
2^9,3|a^2=hi,b^2=d,f^2=i,b^a=bf,c^b=cde,d^a=di,d^c=dg,e^a=eh,e^b=eg,e^c=eg,f^c=fh,f^e=fi,h^b=hi,j^c=j^290 conjugacy classes — view the full character table.
| maximal subgroup of | D3×#133356, #72254946, #72254983 |
| maximal normal subgroup of | D3×#133356, #72254946, #72254983 |
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*F.9);;
gap> SetPower(coll, 2, F.4);;
gap> SetPower(coll, 6, F.9);;
gap> SetConjugate(coll, 2, 1, F.2*F.6);;
gap> SetConjugate(coll, 3, 2, F.3*F.4*F.5);;
gap> SetConjugate(coll, 4, 1, F.4*F.9);;
gap> SetConjugate(coll, 4, 3, F.4*F.7);;
gap> SetConjugate(coll, 5, 1, F.5*F.8);;
gap> SetConjugate(coll, 5, 2, F.5*F.7);;
gap> SetConjugate(coll, 5, 3, F.5*F.7);;
gap> SetConjugate(coll, 6, 3, F.6*F.8);;
gap> SetConjugate(coll, 6, 5, F.6*F.9);;
gap> SetConjugate(coll, 8, 2, F.8*F.9);;
gap> SetConjugate(coll, 10, 3, F.10^2);;
gap> UpdatePolycyclicCollector(coll);;
gap> G := GroupByRws(coll);