| order | 1536 |
| automorphism | ? |
| homology | Abelianization (H1) = C24 · Schur multiplier (H2) = C27 |
No aliases for this group.
| Fitting | C2×C3×#2120 ⋊ C2 |
| Sylow | C3 ⋊ #498885 |
4652 conjugacy classes of subgroups.
| minimal degree | μ(G) = 23 |
| transitive degree | μt(G) = 192 |
A minimal faithful permutation representation — 4 generators on 23 points:
(5,7,9,15)(6,12,13,20)(8,16,10,14)(11,18,17,19)(21,22,23);(2,4)(6,11)(12,19)(13,17)(18,20)(22,23);(5,6,10,17)(7,12,16,18)(8,11,9,13)(14,19,15,20);(1,2)(3,4)(8,10)(14,16)Polycyclic presentation:
2^9,3|b^2=fgi,d^2=i,g^2=i,b^a=bf,c^a=ce,c^b=cfg,d^b=dh,d^c=dhi,f^b=fh,f^c=fhi,g^a=gh,g^b=gh,g^c=ghi,g^d=gi,g^f=gi,h^b=hi,j^c=j^2114 conjugacy classes — view the full character table.
| maximal subgroup of | #72248142, D3×#498885, #72253930, … |
| maximal normal subgroup of | #72248142, D3×#498885, #72253930, … |
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, 2, F.6*F.7*F.9);;
gap> SetPower(coll, 4, F.9);;
gap> SetPower(coll, 7, F.9);;
gap> SetConjugate(coll, 2, 1, F.2*F.6);;
gap> SetConjugate(coll, 3, 1, F.3*F.5);;
gap> SetConjugate(coll, 3, 2, F.3*F.6*F.7);;
gap> SetConjugate(coll, 4, 2, F.4*F.8);;
gap> SetConjugate(coll, 4, 3, F.4*F.8*F.9);;
gap> SetConjugate(coll, 6, 2, F.6*F.8);;
gap> SetConjugate(coll, 6, 3, F.6*F.8*F.9);;
gap> SetConjugate(coll, 7, 1, F.7*F.8);;
gap> SetConjugate(coll, 7, 2, F.7*F.8);;
gap> SetConjugate(coll, 7, 3, F.7*F.8*F.9);;
gap> SetConjugate(coll, 7, 4, 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, 3, F.10^2);;
gap> UpdatePolycyclicCollector(coll);;
gap> G := GroupByRws(coll);