| order | 3312 |
| automorphism | Aut(G) order 874368 |
| homology | Abelianization (H1) = C22 · Schur multiplier (H2) = C2 |
| dihedral | D1656 |
| Fitting | C8×C9×C23 ⋊ C2 |
| Hall | C9×C23 ⋊ D8 |
| Sylow | C23 ⋊ D72 |
| Sylow | C9 ⋊ D184 |
66 conjugacy classes of subgroups.
| minimal degree | μ(G) = 40 |
| transitive degree | μt(G) = 1656 |
A minimal faithful permutation representation — 2 generators on 40 points:
(1,2,3,4,5,6,7,8)(9,10,11,12,13,14,15,16,17)(18,19,20,21,22,23,24,25,26,27,28,29,30,31,32,33,34,35,36,37,38,39,40);(2,8)(3,7)(4,6)(10,17)(11,16)(12,15)(13,14)(19,40)(20,39)(21,38)(22,37)(23,36)(24,35)(25,34)(26,33)(27,32)(28,31)(29,30)Polycyclic presentation:
2^4,3,23,3|b^2=cd,c^2=d,e^3=g,b^a=bc,c^a=cd,e^a=e^2g^2,f^a=f^22,g^a=g^2831 conjugacy classes — view the full character table.
| maximal subgroup of | D3312, D4968, D8280, … |
| maximal normal subgroup of | D3312 |
| maximal quotient of | D3312, D4968, Dic1656, … |
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");;
gap> coll := SingleCollector(F, [2, 2, 2, 2, 3, 23, 3]);;
gap> SetPower(coll, 2, F.3*F.4);;
gap> SetPower(coll, 3, F.4);;
gap> SetPower(coll, 5, F.7);;
gap> SetConjugate(coll, 2, 1, F.2*F.3);;
gap> SetConjugate(coll, 3, 1, F.3*F.4);;
gap> SetConjugate(coll, 5, 1, F.5^2*F.7^2);;
gap> SetConjugate(coll, 6, 1, F.6^22);;
gap> SetConjugate(coll, 7, 1, F.7^2);;
gap> UpdatePolycyclicCollector(coll);;
gap> G := GroupByRws(coll);