| order | 1536 |
| automorphism | ? |
| homology | Abelianization (H1) = C22×C4 · Schur multiplier (H2) = C26 |
No aliases for this group.
| Fitting | C3×#10745 ⋊ C2 |
| Sylow | C3 ⋊ #147819 |
2582 conjugacy classes of subgroups.
| minimal degree | μ(G) = 23 |
| transitive degree | μt(G) = 192 |
A minimal faithful permutation representation — 3 generators on 23 points:
(1,2,3,4)(7,16)(15,19)(21,22,23);(5,7)(6,11,14,20)(8,18)(9,17)(10,16)(12,19,13,15);(2,4)(5,6)(7,15,16,19)(8,13)(9,12)(10,14)(11,17,20,18)(22,23)Polycyclic presentation:
2^9,3|a^2=h,b^2=ef,c^2=d,g^2=i,b^a=be,c^a=cd,c^b=cfgi,e^a=ei,e^b=ei,e^c=eh,f^b=fi,f^c=fh,g^a=ghi,g^b=gi,g^c=gh,g^e=gi,g^f=gi,h^b=hi,j^a=j^2120 conjugacy classes — view the full character table.
| maximal subgroup of | D3×#147819, #72248514, #72248542 |
| maximal normal subgroup of | D3×#147819, #72248514, #72248542 |
| maximal quotient of | #72269990 |
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, 2, F.5*F.6);;
gap> SetPower(coll, 3, F.4);;
gap> SetPower(coll, 7, F.9);;
gap> SetConjugate(coll, 2, 1, F.2*F.5);;
gap> SetConjugate(coll, 3, 1, F.3*F.4);;
gap> SetConjugate(coll, 3, 2, F.3*F.6*F.7*F.9);;
gap> SetConjugate(coll, 5, 1, F.5*F.9);;
gap> SetConjugate(coll, 5, 2, F.5*F.9);;
gap> SetConjugate(coll, 5, 3, F.5*F.8);;
gap> SetConjugate(coll, 6, 2, F.6*F.9);;
gap> SetConjugate(coll, 6, 3, F.6*F.8);;
gap> SetConjugate(coll, 7, 1, F.7*F.8*F.9);;
gap> SetConjugate(coll, 7, 2, F.7*F.9);;
gap> SetConjugate(coll, 7, 3, F.7*F.8);;
gap> SetConjugate(coll, 7, 5, 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, 1, F.10^2);;
gap> UpdatePolycyclicCollector(coll);;
gap> G := GroupByRws(coll);