| order | 1536 |
| automorphism | ? |
| homology | Abelianization (H1) = C23×C4 · Schur multiplier (H2) = C22×C43 |
No aliases for this group.
| Fitting | C3×#10951 ⋊ C2 |
| Sylow | C3 ⋊ #375718 |
2234 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)(4,7,9,20)(5,12,13,30)(6,15,17,33)(8,24,23,21)(10,25,26,35)(11,18,28,31)(14,32,27,29)(16,19,22,34);(2,3)(5,11)(8,23)(10,14)(12,18)(13,28)(15,33)(16,22)(21,24)(25,29)(26,27)(30,31)(32,35);(4,6)(5,10,13,26)(7,19,20,34)(8,22)(9,17)(11,27,28,14)(12,29)(15,21,33,24)(16,23)(18,35)(25,31)(30,32);(4,5,8,11,9,13,23,28)(6,14,16,26,17,27,22,10)(7,18,21,12,20,31,24,30)(15,25,34,29,33,35,19,32)Polycyclic presentation:
2^9,3|a^2=g,b^2=e,d^2=i,g^2=i,b^a=bgh,c^a=cgh,c^b=cf,d^a=dgh,d^b=dfghi,d^c=dhi,e^a=ei,e^d=ei,f^a=fi,g^b=gi,g^c=gi,g^d=gi,h^b=hi,j^c=j^2135 conjugacy classes — view the full character table.
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.7);;
gap> SetPower(coll, 2, F.5);;
gap> SetPower(coll, 4, F.9);;
gap> SetPower(coll, 7, F.9);;
gap> SetConjugate(coll, 2, 1, F.2*F.7*F.8);;
gap> SetConjugate(coll, 3, 1, F.3*F.7*F.8);;
gap> SetConjugate(coll, 3, 2, F.3*F.6);;
gap> SetConjugate(coll, 4, 1, F.4*F.7*F.8);;
gap> SetConjugate(coll, 4, 2, F.4*F.6*F.7*F.8*F.9);;
gap> SetConjugate(coll, 4, 3, F.4*F.8*F.9);;
gap> SetConjugate(coll, 5, 1, F.5*F.9);;
gap> SetConjugate(coll, 5, 4, F.5*F.9);;
gap> SetConjugate(coll, 6, 1, F.6*F.9);;
gap> SetConjugate(coll, 7, 2, F.7*F.9);;
gap> SetConjugate(coll, 7, 3, F.7*F.9);;
gap> SetConjugate(coll, 7, 4, F.7*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);