| order | 8064 |
| automorphism | ? |
| homology | Abelianization (H1) = C22×C3 · Schur multiplier (H2) = C24 |
No aliases for this group.
| Fitting | C26×C7 ⋊ C3×D3 |
| Sylow | C7 ⋊ C3×#87524 |
3374 conjugacy classes of subgroups; only the 60 normal subgroups are shown.
This group has 3374 conjugacy classes of subgroups — too many to draw. Only its 60 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,3,4)(5,8,7)(10,12)(13,14,19)(15,16,18);(1,2,4,3)(6,8)(9,10,11,12)(14,15)(16,18)(17,19)Polycyclic presentation:
2^2,3,2,3,7,2^4|a^2=d,b^a=bd,e^a=e^2,f^a=f^6,f^c=f^4,g^a=h,g^e=h,h^a=g,h^e=gh,i^a=ij,i^e=j,j^e=ij116 conjugacy classes — view the full character table.
| maximal subgroup of | AGL(1,𝔽7)×#87524 |
| maximal normal subgroup of | AGL(1,𝔽7)×#87524 |
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> SetPower(coll, 1, F.4);;
gap> SetConjugate(coll, 2, 1, F.2*F.4);;
gap> SetConjugate(coll, 5, 1, F.5^2);;
gap> SetConjugate(coll, 6, 1, F.6^6);;
gap> SetConjugate(coll, 6, 3, F.6^4);;
gap> SetConjugate(coll, 7, 1, F.8);;
gap> SetConjugate(coll, 7, 5, F.8);;
gap> SetConjugate(coll, 8, 1, F.7);;
gap> SetConjugate(coll, 8, 5, F.7*F.8);;
gap> SetConjugate(coll, 9, 1, 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);