| order | 1536 |
| automorphism | ? |
| homology | Abelianization (H1) = C24 · Schur multiplier (H2) = C27 |
No aliases for this group.
| Fitting | C3×#13074 ⋊ C2 |
| Sylow | C3 ⋊ #499742 |
2716 conjugacy classes of subgroups.
| minimal degree | μ(G) = 35 |
| transitive degree | μt(G) = 96 |
A minimal faithful permutation representation — 4 generators on 35 points:
(2,3)(6,15)(7,19)(9,20)(10,22)(11,26)(12,27)(14,17)(16,18)(21,32)(23,25)(24,29)(28,35)(30,31)(33,34);(1,2,3)(6,14)(7,19)(9,20)(10,22)(11,26)(12,27)(15,17)(16,31)(18,30)(21,32)(23,25)(24,29)(28,35)(33,34);(4,6,7,16,20,31,32,14,8,17,21,30,9,18,19,15)(5,10,11,23,27,34,35,29,13,24,28,33,12,25,26,22);(4,5)(6,10)(7,11)(8,13)(9,12)(14,29)(15,22)(16,23)(17,24)(18,25)(19,26)(20,27)(21,28)(30,33)(31,34)(32,35)Polycyclic presentation:
2^9,3|b^2=e,e^2=hi,h^2=i,c^a=cg,c^b=cef,d^b=de,e^c=eh,e^d=eh,f^a=fi,g^b=gi,h^c=hi,h^d=hi,j^d=j^2102 conjugacy classes — view the full character table.
| maximal subgroup of | #72270277 |
| maximal normal subgroup of | #72270277 |
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, 5, F.8*F.9);;
gap> SetPower(coll, 8, F.9);;
gap> SetConjugate(coll, 3, 1, F.3*F.7);;
gap> SetConjugate(coll, 3, 2, F.3*F.5*F.6);;
gap> SetConjugate(coll, 4, 2, F.4*F.5);;
gap> SetConjugate(coll, 5, 3, F.5*F.8);;
gap> SetConjugate(coll, 5, 4, F.5*F.8);;
gap> SetConjugate(coll, 6, 1, F.6*F.9);;
gap> SetConjugate(coll, 7, 2, F.7*F.9);;
gap> SetConjugate(coll, 8, 3, F.8*F.9);;
gap> SetConjugate(coll, 8, 4, F.8*F.9);;
gap> SetConjugate(coll, 10, 4, F.10^2);;
gap> UpdatePolycyclicCollector(coll);;
gap> G := GroupByRws(coll);