Finite Group DatabasebetaFinite Group Databasebeta| order | 2688 |
| automorphism | ? |
| homology | Abelianization (H1) = C22×C3×C4 · Schur multiplier (H2) = C24 |
No aliases for this group.
| Fitting | C7×#407 ⋊ C2×C3 |
| Hall | #11727746 ⋊ C3 |
| Hall | ΓL(1,𝔽8) ⋊ #1891 |
| Sylow | C7 ⋊ C3×#1891 |
684 conjugacy classes of subgroups.
| minimal degree | μ(G) = 23 |
| transitive degree | μt(G) = 112 |
A minimal faithful permutation representation — 3 generators on 23 points:
(1,2,7)(3,4,6)(13,19)(20,23);(8,10,11,16,12,17,18,22)(9,13,14,20,15,19,21,23);(2,3)(4,6)(5,7)(8,9)(10,13)(11,14)(12,15)(16,20)(17,19)(18,21)(22,23)Polycyclic presentation:
2^3,3,2^4,7|b^2=e,e^2=h,c^a=cg,c^b=cf,f^a=fh,g^b=gh,i^a=i^6,i^d=i^4124 conjugacy classes — view the full character table.
| maximal subgroup of | AGL(1,𝔽7)×#1891 |
| maximal normal subgroup of | AGL(1,𝔽7)×#1891 |
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.5);;
gap> SetPower(coll, 5, F.8);;
gap> SetConjugate(coll, 3, 1, F.3*F.7);;
gap> SetConjugate(coll, 3, 2, F.3*F.6);;
gap> SetConjugate(coll, 6, 1, F.6*F.8);;
gap> SetConjugate(coll, 7, 2, F.7*F.8);;
gap> SetConjugate(coll, 9, 1, F.9^6);;
gap> SetConjugate(coll, 9, 4, F.9^4);;
gap> UpdatePolycyclicCollector(coll);;
gap> G := GroupByRws(coll);