| order | 15552 |
| automorphism | ? |
| homology | Abelianization (H1) = C2×C4 · Schur multiplier (H2) = C2×C3 |
No aliases for this group.
| derived | C32×PSU(3,𝔽2)⋊C3 ⋊ C2×C4 |
2351 conjugacy classes of subgroups; only the 72 normal subgroups are shown.
This group has 2351 conjugacy classes of subgroups — too many to draw. Only its 72 normal subgroups are shown.
Dotted edges: containments with no intermediate normal subgroup — omitted non-normal subgroups may lie between.
| minimal degree | μ(G) = 19 |
| transitive degree | μt(G) = 96 |
A minimal faithful permutation representation — 3 generators on 19 points:
(2,3)(4,5)(11,16,19,14,12,18,17,13);(5,6)(7,8,9,10)(12,13,17)(15,18,16);(1,2,3)Polycyclic presentation:
2^3,3^3,2^3,3^2|a^2=c,g^2=i,h^2=i,d^a=d^2,d^b=d^2,e^a=d^2e,e^b=e^2,f^b=f^2,g^b=gi,g^f=h,h^b=gh,h^f=ghi,h^g=hi,j^b=k,j^f=k,j^g=k,j^h=jk^2,j^i=j^2,k^b=j,k^f=j^2k^2,k^g=j^2,k^h=j^2k^2,k^i=k^2126 conjugacy classes — view the full character table.
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", "k");;
gap> coll := SingleCollector(F, [2, 2, 2, 3, 3, 3, 2, 2, 2, 3, 3]);;
gap> SetPower(coll, 1, F.3);;
gap> SetPower(coll, 7, F.9);;
gap> SetPower(coll, 8, F.9);;
gap> SetConjugate(coll, 4, 1, F.4^2);;
gap> SetConjugate(coll, 4, 2, F.4^2);;
gap> SetConjugate(coll, 5, 1, F.4^2*F.5);;
gap> SetConjugate(coll, 5, 2, F.5^2);;
gap> SetConjugate(coll, 6, 2, F.6^2);;
gap> SetConjugate(coll, 7, 2, F.7*F.9);;
gap> SetConjugate(coll, 7, 6, F.8);;
gap> SetConjugate(coll, 8, 2, F.7*F.8);;
gap> SetConjugate(coll, 8, 6, F.7*F.8*F.9);;
gap> SetConjugate(coll, 8, 7, F.8*F.9);;
gap> SetConjugate(coll, 10, 2, F.11);;
gap> SetConjugate(coll, 10, 6, F.11);;
gap> SetConjugate(coll, 10, 7, F.11);;
gap> SetConjugate(coll, 10, 8, F.10*F.11^2);;
gap> SetConjugate(coll, 10, 9, F.10^2);;
gap> SetConjugate(coll, 11, 2, F.10);;
gap> SetConjugate(coll, 11, 6, F.10^2*F.11^2);;
gap> SetConjugate(coll, 11, 7, F.10^2);;
gap> SetConjugate(coll, 11, 8, F.10^2*F.11^2);;
gap> SetConjugate(coll, 11, 9, F.11^2);;
gap> UpdatePolycyclicCollector(coll);;
gap> G := GroupByRws(coll);