| order | 2688 |
| automorphism | ? |
| homology | Abelianization (H1) = C24×C3 · Schur multiplier (H2) = C26 |
No aliases for this group.
| Fitting | C2×C7×H(5,𝔽2) ⋊ C2×C3 |
| Hall | #11741549 ⋊ C3 |
| Hall | ΓL(1,𝔽8) ⋊ #3019 |
| Sylow | C7 ⋊ C3×#3019 |
1524 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)(4,5,6)(10,17)(11,19)(14,20)(15,21);(8,10,12,17)(9,14,13,20)(11,16,19,18)(15,23,21,22);(2,3)(4,5)(6,7)(9,13)(10,16)(11,19)(14,22)(17,18)(20,23);(8,9)(10,14)(11,15)(12,13)(16,23)(17,20)(18,22)(19,21)Polycyclic presentation:
2^4,3,2^3,7|c^2=h,f^2=h,b^a=bh,c^b=cf,d^b=dg,d^c=dh,f^b=fh,f^c=fh,f^d=fh,g^c=gh,i^b=i^6,i^e=i^2121 conjugacy classes — view the full character table.
| maximal subgroup of | #72259795 |
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, 3, F.8);;
gap> SetPower(coll, 6, F.8);;
gap> SetConjugate(coll, 2, 1, F.2*F.8);;
gap> SetConjugate(coll, 3, 2, F.3*F.6);;
gap> SetConjugate(coll, 4, 2, F.4*F.7);;
gap> SetConjugate(coll, 4, 3, F.4*F.8);;
gap> SetConjugate(coll, 6, 2, F.6*F.8);;
gap> SetConjugate(coll, 6, 3, F.6*F.8);;
gap> SetConjugate(coll, 6, 4, F.6*F.8);;
gap> SetConjugate(coll, 7, 3, F.7*F.8);;
gap> SetConjugate(coll, 9, 2, F.9^6);;
gap> SetConjugate(coll, 9, 5, F.9^2);;
gap> UpdatePolycyclicCollector(coll);;
gap> G := GroupByRws(coll);