| order | 1536 |
| automorphism | ? |
| homology | Abelianization (H1) = C23 · Schur multiplier (H2) = C24 |
No aliases for this group.
| Fitting | #32929 ⋊ D3 |
1146 conjugacy classes of subgroups; only the 40 normal subgroups are shown.
This group has 1146 conjugacy classes of subgroups — too many to draw. Only its 40 normal subgroups are shown.
Dotted edges: containments with no intermediate normal subgroup — omitted non-normal subgroups may lie between.
| minimal degree | μ(G) = 16 |
| transitive degree | μt(G) = 48 |
A minimal faithful permutation representation — 3 generators on 16 points:
(1,2,4,6)(3,8,7,5)(9,16,12,13,11,10)(14,15);(2,5)(3,7)(6,8)(9,10)(11,14)(12,13)(15,16);(12,15)(13,16)Polycyclic presentation:
2^5,3,2^4|c^2=e,d^2=e,c^b=cd,d^b=de,d^c=de,f^a=f^2,g^a=gh,g^b=gj,g^c=gj,g^f=h,h^b=hi,h^c=hi,h^f=gh,i^f=ij,j^a=ij,j^f=i58 conjugacy classes — view the full character table.
| maximal subgroup of | SD16×#1020⋊C2 |
| maximal normal subgroup of | SD16×#1020⋊C2 |
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, 3, 2, 2, 2, 2]);;
gap> SetPower(coll, 3, F.5);;
gap> SetPower(coll, 4, F.5);;
gap> SetConjugate(coll, 3, 2, F.3*F.4);;
gap> SetConjugate(coll, 4, 2, F.4*F.5);;
gap> SetConjugate(coll, 4, 3, F.4*F.5);;
gap> SetConjugate(coll, 6, 1, F.6^2);;
gap> SetConjugate(coll, 7, 1, F.7*F.8);;
gap> SetConjugate(coll, 7, 2, F.7*F.10);;
gap> SetConjugate(coll, 7, 3, F.7*F.10);;
gap> SetConjugate(coll, 7, 6, F.8);;
gap> SetConjugate(coll, 8, 2, F.8*F.9);;
gap> SetConjugate(coll, 8, 3, F.8*F.9);;
gap> SetConjugate(coll, 8, 6, F.7*F.8);;
gap> SetConjugate(coll, 9, 6, F.9*F.10);;
gap> SetConjugate(coll, 10, 1, F.9*F.10);;
gap> SetConjugate(coll, 10, 6, F.9);;
gap> UpdatePolycyclicCollector(coll);;
gap> G := GroupByRws(coll);