| order | 2688 |
| automorphism | ? |
| homology | Abelianization (H1) = C23×C3 · Schur multiplier (H2) = C24 |
No aliases for this group.
| Fitting | C7×AΣL(1,𝔽16) ⋊ C2×C3 |
| Hall | #11726884 ⋊ C3 |
| Hall | ΓL(1,𝔽8) ⋊ #2196 |
| Sylow | C7 ⋊ C3×#2196 |
708 conjugacy classes of subgroups; only the 69 normal subgroups are shown.
This group has 708 conjugacy classes of subgroups — too many to draw. Only its 69 normal subgroups are shown.
Dotted edges: containments with no intermediate normal subgroup — omitted non-normal subgroups may lie between.
| minimal degree | μ(G) = 15 |
| transitive degree | μt(G) = 56 |
A minimal faithful permutation representation — 3 generators on 15 points:
(2,5,6,3,4,7)(9,13,12,14);(1,2,4,7,6,5,3)(9,12);(8,9,10,14)(11,12,15,13)Polycyclic presentation:
2^3,3,2^4,7|a^2=e,c^2=g,f^2=h,b^a=befh,c^a=cfg,c^b=cg,e^b=eg,e^c=eg,f^a=fg,f^b=fg,f^e=fh,g^a=gh,i^c=i^6,i^d=i^273 conjugacy classes — view the full character table.
| maximal subgroup of | AGL(1,𝔽7)×#2196 |
| maximal normal subgroup of | AGL(1,𝔽7)×#2196 |
| maximal quotient of | #72277078 |
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.5);;
gap> SetPower(coll, 3, F.7);;
gap> SetPower(coll, 6, F.8);;
gap> SetConjugate(coll, 2, 1, F.2*F.5*F.6*F.8);;
gap> SetConjugate(coll, 3, 1, F.3*F.6*F.7);;
gap> SetConjugate(coll, 3, 2, F.3*F.7);;
gap> SetConjugate(coll, 5, 2, F.5*F.7);;
gap> SetConjugate(coll, 5, 3, F.5*F.7);;
gap> SetConjugate(coll, 6, 1, F.6*F.7);;
gap> SetConjugate(coll, 6, 2, F.6*F.7);;
gap> SetConjugate(coll, 6, 5, F.6*F.8);;
gap> SetConjugate(coll, 7, 1, F.7*F.8);;
gap> SetConjugate(coll, 9, 3, F.9^6);;
gap> SetConjugate(coll, 9, 4, F.9^2);;
gap> UpdatePolycyclicCollector(coll);;
gap> G := GroupByRws(coll);