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