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