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