| order | 1536 |
| automorphism | ? |
| homology | Abelianization (H1) = C23×C4 · Schur multiplier (H2) = C28 |
No aliases for this group.
| Fitting | C3×C22⋊#338 ⋊ C2 |
| Sylow | C3 ⋊ #364468 |
5860 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,19)(11,12)(14,22)(16,17)(18,23);(1,2,3)(5,7);(4,5)(6,7)(8,10,11,21,13,19,12,20)(9,14,16,18,17,23,15,22);(8,9,11,15,13,17,12,16)(10,18,20,23,19,22,21,14)Polycyclic presentation:
2^9,3|a^2=f,b^2=g,f^2=i,g^2=i,h^2=i,b^a=bh,c^b=ce,d^a=dh,d^b=dfgi,f^b=fi,f^d=fi,g^a=gi,g^d=gi,h^d=hi,j^d=j^2144 conjugacy classes — view the full character table.
| maximal subgroup of | D3×#364468, #72270021, #72271505 |
| maximal normal subgroup of | D3×#364468, #72270021, #72271505 |
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.7);;
gap> SetPower(coll, 6, F.9);;
gap> SetPower(coll, 7, F.9);;
gap> SetPower(coll, 8, F.9);;
gap> SetConjugate(coll, 2, 1, F.2*F.8);;
gap> SetConjugate(coll, 3, 2, F.3*F.5);;
gap> SetConjugate(coll, 4, 1, F.4*F.8);;
gap> SetConjugate(coll, 4, 2, F.4*F.6*F.7*F.9);;
gap> SetConjugate(coll, 6, 2, F.6*F.9);;
gap> SetConjugate(coll, 6, 4, F.6*F.9);;
gap> SetConjugate(coll, 7, 1, F.7*F.9);;
gap> SetConjugate(coll, 7, 4, F.7*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);