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×#418 ⋊ C2×C3 |
| Hall | #11728068 ⋊ C3 |
| Hall | ΓL(1,𝔽8) ⋊ #1904 |
| Sylow | C7 ⋊ C3×#1904 |
692 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)(10,17)(11,20)(13,21)(14,23)(16,22)(18,19);(2,3)(4,6)(5,7)(8,10,11,18,12,19,20,17)(9,13,14,22,15,16,23,21);(2,3)(4,6)(5,7)(8,9)(10,16,19,13)(11,14)(12,15)(17,22,18,21)(20,23)Polycyclic presentation:
2^3,3,2^4,7|a^2=g,b^2=e,e^2=h,b^a=bf,c^b=ce,e^c=eh,f^a=fh,g^b=gh,i^a=i^6,i^b=i^6,i^d=i^4109 conjugacy classes — view the full character table.
| maximal subgroup of | AGL(1,𝔽7)×#1904 |
| maximal normal subgroup of | AGL(1,𝔽7)×#1904 |
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, 1, F.7);;
gap> SetPower(coll, 2, F.5);;
gap> SetPower(coll, 5, F.8);;
gap> SetConjugate(coll, 2, 1, F.2*F.6);;
gap> SetConjugate(coll, 3, 2, F.3*F.5);;
gap> SetConjugate(coll, 5, 3, F.5*F.8);;
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, 2, F.9^6);;
gap> SetConjugate(coll, 9, 4, F.9^4);;
gap> UpdatePolycyclicCollector(coll);;
gap> G := GroupByRws(coll);