| order | 1536 |
| automorphism | ? |
| homology | Abelianization (H1) = C24 · Schur multiplier (H2) = C27 |
No aliases for this group.
| Fitting | C2×C3×#3021 ⋊ C2 |
| Sylow | C3 ⋊ #498909 |
4618 conjugacy classes of subgroups.
| minimal degree | μ(G) = 23 |
| transitive degree | μt(G) = 192 |
A minimal faithful permutation representation — 4 generators on 23 points:
(6,12)(7,13)(8,15)(18,19)(21,22,23);(2,4)(6,11)(7,13)(10,18)(12,20)(14,17)(16,19);(5,6,7,11,9,12,13,20)(8,16,17,19,15,10,14,18);(1,2,3,4)(6,10)(7,13)(8,15)(11,18)(12,16)(19,20)(22,23)Polycyclic presentation:
2^9,3|a^2=g,b^2=e,e^2=i,f^2=i,b^a=bf,c^a=cg,c^b=cei,d^a=dhi,d^b=dhi,d^c=dhi,e^a=eh,e^c=ei,e^d=ei,f^a=fi,f^b=fhi,f^c=fhi,f^d=fi,f^e=fi,h^b=hi,j^a=j^2114 conjugacy classes — view the full character table.
| maximal subgroup of | D3×#498909, #72270902, #72270922 |
| maximal normal subgroup of | D3×#498909, #72270902, #72270922 |
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, 5, 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.7);;
gap> SetConjugate(coll, 3, 2, F.3*F.5*F.9);;
gap> SetConjugate(coll, 4, 1, F.4*F.8*F.9);;
gap> SetConjugate(coll, 4, 2, F.4*F.8*F.9);;
gap> SetConjugate(coll, 4, 3, F.4*F.8*F.9);;
gap> SetConjugate(coll, 5, 1, F.5*F.8);;
gap> SetConjugate(coll, 5, 3, 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, 6, 2, F.6*F.8*F.9);;
gap> SetConjugate(coll, 6, 3, F.6*F.8*F.9);;
gap> SetConjugate(coll, 6, 4, F.6*F.9);;
gap> SetConjugate(coll, 6, 5, F.6*F.9);;
gap> SetConjugate(coll, 8, 2, F.8*F.9);;
gap> SetConjugate(coll, 10, 1, F.10^2);;
gap> UpdatePolycyclicCollector(coll);;
gap> G := GroupByRws(coll);