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