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