| order | 1536 |
| automorphism | ? |
| homology | Abelianization (H1) = C24 · Schur multiplier (H2) = C28 |
No aliases for this group.
| Fitting | C2×C3×#3019 ⋊ C2 |
| Sylow | C3 ⋊ #498927 |
5570 conjugacy classes of subgroups.
| minimal degree | μ(G) = 23 |
| transitive degree | μt(G) = 96 |
A minimal faithful permutation representation — 4 generators on 23 points:
(5,8,10,9)(6,12,13,18)(7,15,17,16)(11,14,19,20)(21,22,23);(2,4)(7,15)(11,14)(16,17)(19,20)(22,23);(5,7)(6,11)(8,16)(9,15)(10,17)(12,20)(13,19)(14,18);(1,2)(3,4)(5,6,10,13)(7,14)(8,18,9,12)(11,15)(16,19)(17,20)Polycyclic presentation:
2^9,3|a^2=hi,d^2=i,f^2=i,b^a=bf,c^a=ce,c^b=cefg,d^a=di,d^b=di,d^c=dh,f^b=fi,f^c=fh,g^a=ghi,g^b=gi,g^c=gh,g^d=gi,g^f=gi,h^b=hi,j^c=j^2114 conjugacy classes — view the full character table.
| maximal subgroup of | #72248347, #72248475, D3×#498927 |
| maximal normal subgroup of | #72248347, #72248475, D3×#498927 |
| maximal quotient of | #72270439 |
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.8*F.9);;
gap> SetPower(coll, 4, F.9);;
gap> SetPower(coll, 6, F.9);;
gap> SetConjugate(coll, 2, 1, F.2*F.6);;
gap> SetConjugate(coll, 3, 1, F.3*F.5);;
gap> SetConjugate(coll, 3, 2, F.3*F.5*F.6*F.7);;
gap> SetConjugate(coll, 4, 1, F.4*F.9);;
gap> SetConjugate(coll, 4, 2, F.4*F.9);;
gap> SetConjugate(coll, 4, 3, F.4*F.8);;
gap> SetConjugate(coll, 6, 2, F.6*F.9);;
gap> SetConjugate(coll, 6, 3, F.6*F.8);;
gap> SetConjugate(coll, 7, 1, F.7*F.8*F.9);;
gap> SetConjugate(coll, 7, 2, F.7*F.9);;
gap> SetConjugate(coll, 7, 3, F.7*F.8);;
gap> SetConjugate(coll, 7, 4, F.7*F.9);;
gap> SetConjugate(coll, 7, 6, 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);