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