Finite Group DatabasebetaFinite Group Databasebeta| order | 2688 |
| automorphism | ? |
| homology | Abelianization (H1) = C23×C3 · Schur multiplier (H2) = C25 |
No aliases for this group.
| Fitting | C7×#342 ⋊ C2×C3 |
| Hall | #11726719 ⋊ C3 |
| Hall | ΓL(1,𝔽8) ⋊ #2021 |
| Sylow | C7 ⋊ C3×#2021 |
1276 conjugacy classes of subgroups; only the 121 normal subgroups are shown.
This group has 1276 conjugacy classes of subgroups — too many to draw. Only its 121 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) = 112 |
A minimal faithful permutation representation — 3 generators on 19 points:
(5,6,11)(8,9,10)(12,14)(13,16,17,19)(15,18);(1,2,3,4)(12,13)(14,16,18,19)(15,17);(2,4)(6,7)(8,9)(10,11)(16,19)Polycyclic presentation:
2^3,3,2^4,7|b^2=f,c^2=e,b^a=bf,c^a=ce,c^b=cg,e^b=eh,f^c=fh,g^b=gh,g^c=gh,i^a=i^6,i^d=i^2100 conjugacy classes — view the full character table.
| maximal subgroup of | AGL(1,𝔽7)×#2021, #72276664, #72276679 |
| maximal normal subgroup of | AGL(1,𝔽7)×#2021, #72276664, #72276679 |
| maximal quotient of | #72277290, #72278080 |
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");;
gap> coll := SingleCollector(F, [2, 2, 2, 3, 2, 2, 2, 2, 7]);;
gap> SetPower(coll, 2, F.6);;
gap> SetPower(coll, 3, F.5);;
gap> SetConjugate(coll, 2, 1, F.2*F.6);;
gap> SetConjugate(coll, 3, 1, F.3*F.5);;
gap> SetConjugate(coll, 3, 2, F.3*F.7);;
gap> SetConjugate(coll, 5, 2, F.5*F.8);;
gap> SetConjugate(coll, 6, 3, F.6*F.8);;
gap> SetConjugate(coll, 7, 2, F.7*F.8);;
gap> SetConjugate(coll, 7, 3, F.7*F.8);;
gap> SetConjugate(coll, 9, 1, F.9^6);;
gap> SetConjugate(coll, 9, 4, F.9^2);;
gap> UpdatePolycyclicCollector(coll);;
gap> G := GroupByRws(coll);