| order | 4374 |
| automorphism | ? |
| homology | Abelianization (H1) = C2×C3 · Schur multiplier (H2) = C35 |
No aliases for this group.
| Fitting, Sylow | C3×H(3,𝔽3)×3−1+2 ⋊ C2 |
| derived | C3×C9×H(3,𝔽3) ⋊ C2×C3 |
6211 conjugacy classes of subgroups; only the 638 normal subgroups are shown.
This group has 6211 conjugacy classes of subgroups — too many to draw. Only its 638 normal subgroups are shown.
Dotted edges: containments with no intermediate normal subgroup — omitted non-normal subgroups may lie between.
| minimal degree | μ(G) = 21 |
| transitive degree | μt(G) = 162 |
A minimal faithful permutation representation — 5 generators on 21 points:
(2,3)(5,11,12,7,8,9)(6,10)(14,16)(17,21)(18,20);(4,8,7,6,12,9,10,5,11);(14,17,18)(16,20,21);(1,2,3);(13,14,16)(15,18,20)(17,21,19)Polycyclic presentation:
2,3^7|f^3=g,c^a=c^2,d^a=d^2,e^a=e^2,e^c=eh,f^a=f^2g^2,f^b=fg,g^a=g^2195 conjugacy classes — view the full character table.
| maximal subgroup of | #72253773, #72253826 |
| maximal normal subgroup of | #72253773, #72253826 |
| maximal quotient of | #72243459 |
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");;
gap> coll := SingleCollector(F, [2, 3, 3, 3, 3, 3, 3, 3]);;
gap> SetPower(coll, 6, F.7);;
gap> SetConjugate(coll, 3, 1, F.3^2);;
gap> SetConjugate(coll, 4, 1, F.4^2);;
gap> SetConjugate(coll, 5, 1, F.5^2);;
gap> SetConjugate(coll, 5, 3, F.5*F.8);;
gap> SetConjugate(coll, 6, 1, F.6^2*F.7^2);;
gap> SetConjugate(coll, 6, 2, F.6*F.7);;
gap> SetConjugate(coll, 7, 1, F.7^2);;
gap> UpdatePolycyclicCollector(coll);;
gap> G := GroupByRws(coll);