| order | 1536 |
| automorphism | ? |
| homology | Abelianization (H1) = C2×C42 · Schur multiplier (H2) = C25×C4 |
No aliases for this group.
| Fitting | C3×#10742 ⋊ C2 |
| Sylow | C3 ⋊ #146656 |
2256 conjugacy classes of subgroups.
| minimal degree | μ(G) = 23 |
| transitive degree | μt(G) = 192 |
A minimal faithful permutation representation — 3 generators on 23 points:
(1,2,3,4)(5,8,9,17)(6,12)(7,16)(10,20,11,18)(13,19)(14,15)(21,22,23);(5,7,18,16)(6,9,12,20)(8,15,11,19)(10,14,17,13)(22,23);(5,6,10,13,9,16,11,15)(7,17,19,20,12,8,14,18)Polycyclic presentation:
2^9,3|a^2=e,b^2=efh,c^2=d,e^2=i,f^2=i,g^2=i,b^a=bf,c^a=cg,c^b=cgh,d^a=di,d^b=di,e^b=ei,e^c=ei,f^c=fh,g^b=ghi,g^f=gi,h^a=hi,h^b=hi,j^b=j^2126 conjugacy classes — view the full character table.
| maximal subgroup of | D3×#146656, #72254153, #72270026 |
| maximal normal subgroup of | D3×#146656, #72254153, #72270026 |
| maximal quotient of | #72271413 |
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.5);;
gap> SetPower(coll, 2, F.5*F.6*F.8);;
gap> SetPower(coll, 3, F.4);;
gap> SetPower(coll, 5, F.9);;
gap> SetPower(coll, 6, F.9);;
gap> SetPower(coll, 7, F.9);;
gap> SetConjugate(coll, 2, 1, F.2*F.6);;
gap> SetConjugate(coll, 3, 1, F.3*F.7);;
gap> SetConjugate(coll, 3, 2, F.3*F.7*F.8);;
gap> SetConjugate(coll, 4, 1, F.4*F.9);;
gap> SetConjugate(coll, 4, 2, F.4*F.9);;
gap> SetConjugate(coll, 5, 2, F.5*F.9);;
gap> SetConjugate(coll, 5, 3, F.5*F.9);;
gap> SetConjugate(coll, 6, 3, F.6*F.8);;
gap> SetConjugate(coll, 7, 2, F.7*F.8*F.9);;
gap> SetConjugate(coll, 7, 6, F.7*F.9);;
gap> SetConjugate(coll, 8, 1, F.8*F.9);;
gap> SetConjugate(coll, 8, 2, F.8*F.9);;
gap> SetConjugate(coll, 10, 2, F.10^2);;
gap> UpdatePolycyclicCollector(coll);;
gap> G := GroupByRws(coll);