| order | 1536 |
| automorphism | ? |
| homology | Abelianization (H1) = C24 · Schur multiplier (H2) = C25 |
No aliases for this group.
| Fitting | C3×#13400 ⋊ 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)(6,17,20,34)(7,16)(8,24)(10,28,27,35)(11,31)(12,13)(15,33,30,29)(18,19,23,21)(22,32)(25,26);(2,3)(10,27)(15,30)(28,35)(29,33);(4,6,16,17,8,21,7,23,9,20,25,34,24,19,26,18)(5,10,22,35,13,29,32,15,14,27,31,28,12,33,11,30);(4,5)(6,15)(7,22)(8,12)(9,14)(10,18)(11,25)(13,24)(16,32)(17,33)(19,28)(20,30)(21,35)(23,27)(26,31)(29,34)Polycyclic presentation:
2^9,3|b^2=efi,d^2=g,e^2=hi,f^2=i,h^2=i,b^a=be,c^a=cg,c^b=cfghi,d^b=degi,e^a=eh,e^b=ei,e^d=ehi,f^b=fi,f^d=fi,g^b=gi,h^a=hi,h^d=hi,j^c=j^2,j^d=j^284 conjugacy classes — view the full character table.
| maximal subgroup of | #72271782 |
| maximal normal subgroup of | #72271782 |
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.6*F.9);;
gap> SetPower(coll, 4, F.7);;
gap> SetPower(coll, 5, F.8*F.9);;
gap> SetPower(coll, 6, 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.6*F.7*F.8*F.9);;
gap> SetConjugate(coll, 4, 2, F.4*F.5*F.7*F.9);;
gap> SetConjugate(coll, 5, 1, F.5*F.8);;
gap> SetConjugate(coll, 5, 2, F.5*F.9);;
gap> SetConjugate(coll, 5, 4, F.5*F.8*F.9);;
gap> SetConjugate(coll, 6, 2, F.6*F.9);;
gap> SetConjugate(coll, 6, 4, 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, 4, F.8*F.9);;
gap> SetConjugate(coll, 10, 3, F.10^2);;
gap> SetConjugate(coll, 10, 4, F.10^2);;
gap> UpdatePolycyclicCollector(coll);;
gap> G := GroupByRws(coll);