| order | 8064 |
| automorphism | ? |
| homology | Abelianization (H1) = C22×C3 · Schur multiplier (H2) = C23 |
No aliases for this group.
| Fitting | C2×C7×#120 ⋊ C3×D3 |
| Sylow | C7 ⋊ C3×#73081 |
1026 conjugacy classes of subgroups; only the 39 normal subgroups are shown.
This group has 1026 conjugacy classes of subgroups — too many to draw. Only its 39 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) = 84 |
A minimal faithful permutation representation — 2 generators on 19 points:
(2,4)(6,12,10,9)(7,11)(14,17,18,15,16,19);(1,2)(3,4)(5,6)(7,10,11,9,8,12)(13,14,16,19,18,17,15)Polycyclic presentation:
2^2,3,2,3,7,2^4|b^a=bd,e^b=e^2,f^b=f^6,f^c=f^2,g^a=gi,g^b=gh,g^e=h,h^a=hj,h^e=gh,i^b=ij,i^e=j,j^e=ij86 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");;
gap> coll := SingleCollector(F, [2, 2, 3, 2, 3, 7, 2, 2, 2, 2]);;
gap> SetConjugate(coll, 2, 1, F.2*F.4);;
gap> SetConjugate(coll, 5, 2, F.5^2);;
gap> SetConjugate(coll, 6, 2, F.6^6);;
gap> SetConjugate(coll, 6, 3, F.6^2);;
gap> SetConjugate(coll, 7, 1, F.7*F.9);;
gap> SetConjugate(coll, 7, 2, F.7*F.8);;
gap> SetConjugate(coll, 7, 5, F.8);;
gap> SetConjugate(coll, 8, 1, F.8*F.10);;
gap> SetConjugate(coll, 8, 5, F.7*F.8);;
gap> SetConjugate(coll, 9, 2, F.9*F.10);;
gap> SetConjugate(coll, 9, 5, F.10);;
gap> SetConjugate(coll, 10, 5, F.9*F.10);;
gap> UpdatePolycyclicCollector(coll);;
gap> G := GroupByRws(coll);