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