Finite Group DatabasebetaFinite Group Databasebeta| order | 7488 |
| automorphism | ? |
| homology | Abelianization (H1) = C2×C3×C4 · Schur multiplier (H2) = C23 |
No aliases for this group.
| Fitting | C24×C13 ⋊ C3×Dic3 |
| Sylow | C13 ⋊ C3×#5432 |
756 conjugacy classes of subgroups; only the 63 normal subgroups are shown.
This group has 756 conjugacy classes of subgroups — too many to draw. Only its 63 normal subgroups are shown.
Dotted edges: containments with no intermediate normal subgroup — omitted non-normal subgroups may lie between.
| minimal degree | μ(G) = 21 |
| transitive degree | μt(G) = 156 |
A minimal faithful permutation representation — 2 generators on 21 points:
(2,4)(5,7,8)(9,10,19)(11,13,15)(12,18,16)(14,21,17);(1,2)(3,4)(6,7)(10,11,13,16)(12,15,18,14)(17,21,19,20)Polycyclic presentation:
2^2,3,2^2,3,13,2^2|a^2=d,b^a=be,f^a=f^2,g^a=g^8,g^c=g^3,g^d=g^12,h^a=i,h^f=hi,i^a=h,i^f=h100 conjugacy classes — view the full character table.
| maximal subgroup of | #72242208, GL(2,ℤ/4)×AGL(1,𝔽13) |
| maximal normal subgroup of | GL(2,ℤ/4)×AGL(1,𝔽13) |
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, 3, 2, 2, 3, 13, 2, 2]);;
gap> SetPower(coll, 1, F.4);;
gap> SetConjugate(coll, 2, 1, F.2*F.5);;
gap> SetConjugate(coll, 6, 1, F.6^2);;
gap> SetConjugate(coll, 7, 1, F.7^8);;
gap> SetConjugate(coll, 7, 3, F.7^3);;
gap> SetConjugate(coll, 7, 4, F.7^12);;
gap> SetConjugate(coll, 8, 1, F.9);;
gap> SetConjugate(coll, 8, 6, F.8*F.9);;
gap> SetConjugate(coll, 9, 1, F.8);;
gap> SetConjugate(coll, 9, 6, F.8);;
gap> UpdatePolycyclicCollector(coll);;
gap> G := GroupByRws(coll);