| order | 1536 |
| automorphism | ? |
| homology | Abelianization (H1) = C24 · Schur multiplier (H2) = C28 |
No aliases for this group.
| Fitting | C3×#36702 ⋊ 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,9,18)(6,11,12,17)(7,14,16,15)(10,13,19,20)(21,22,23);(2,4)(10,19)(11,17);(1,2,3,4)(5,7)(6,10)(8,15)(9,16)(11,13)(12,19)(14,18)(17,20);(5,6)(7,13)(8,17,18,11)(9,12)(10,15,19,14)(16,20)(22,23)Polycyclic presentation:
2^9,3|a^2=e,b^2=ef,d^2=i,b^a=bg,c^a=ce,c^b=cefh,d^a=dh,d^b=dhi,d^c=dh,e^b=eh,e^d=ei,f^b=fh,f^d=fi,g^a=gh,g^c=gh,g^d=gi,g^e=gi,g^f=gi,h^a=hi,j^a=j^2108 conjugacy classes — view the full character table.
| maximal subgroup of | #72248556, #72248578, D3×#498927 |
| maximal normal subgroup of | #72248556, #72248578, D3×#498927 |
| maximal quotient of | #72255074 |
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);;
gap> SetPower(coll, 4, F.9);;
gap> SetConjugate(coll, 2, 1, F.2*F.7);;
gap> SetConjugate(coll, 3, 1, F.3*F.5);;
gap> SetConjugate(coll, 3, 2, F.3*F.5*F.6*F.8);;
gap> SetConjugate(coll, 4, 1, F.4*F.8);;
gap> SetConjugate(coll, 4, 2, F.4*F.8*F.9);;
gap> SetConjugate(coll, 4, 3, F.4*F.8);;
gap> SetConjugate(coll, 5, 2, F.5*F.8);;
gap> SetConjugate(coll, 5, 4, F.5*F.9);;
gap> SetConjugate(coll, 6, 2, F.6*F.8);;
gap> SetConjugate(coll, 6, 4, F.6*F.9);;
gap> SetConjugate(coll, 7, 1, F.7*F.8);;
gap> SetConjugate(coll, 7, 3, F.7*F.8);;
gap> SetConjugate(coll, 7, 4, F.7*F.9);;
gap> SetConjugate(coll, 7, 5, F.7*F.9);;
gap> SetConjugate(coll, 7, 6, F.7*F.9);;
gap> SetConjugate(coll, 8, 1, F.8*F.9);;
gap> SetConjugate(coll, 10, 1, F.10^2);;
gap> UpdatePolycyclicCollector(coll);;
gap> G := GroupByRws(coll);