| order | 9720 |
| automorphism | ? |
| homology | Abelianization (H1) = C2×C3×C4 · Schur multiplier (H2) = C2 |
No aliases for this group.
| Fitting, Hall | C5×#6891 ⋊ C2×C4 |
| derived | C5×C32⋊C9 ⋊ C2×C3×C4 |
| Sylow | #6891 ⋊ C2×AGL(1,𝔽5) |
| Sylow | C5 ⋊ #92259⋊C4 |
600 conjugacy classes of subgroups; only the 67 normal subgroups are shown.
This group has 600 conjugacy classes of subgroups — too many to draw. Only its 67 normal subgroups are shown.
Dotted edges: containments with no intermediate normal subgroup — omitted non-normal subgroups may lie between.
| transitive degree | μt(G) = 90 |
Polycyclic presentation:
2^2,3,2,3^2,5,3^2|b^2=d,f^3=i,e^a=e^2,e^b=e^2,f^b=f^2i^2,f^c=fi,f^e=fh,g^b=g^3,g^d=g^4,h^a=h^2,i^b=i^2120 conjugacy classes — view the full character table.
| maximal subgroup of | AGL(1,𝔽5)×(((C3⋊D3)⋊C9)⋊C2)⋊C3 |
| maximal normal subgroup of | AGL(1,𝔽5)×(((C3⋊D3)⋊C9)⋊C2)⋊C3 |
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, 3, 3, 5, 3, 3]);;
gap> SetPower(coll, 2, F.4);;
gap> SetPower(coll, 6, F.9);;
gap> SetConjugate(coll, 5, 1, F.5^2);;
gap> SetConjugate(coll, 5, 2, F.5^2);;
gap> SetConjugate(coll, 6, 2, F.6^2*F.9^2);;
gap> SetConjugate(coll, 6, 3, F.6*F.9);;
gap> SetConjugate(coll, 6, 5, F.6*F.8);;
gap> SetConjugate(coll, 7, 2, F.7^3);;
gap> SetConjugate(coll, 7, 4, F.7^4);;
gap> SetConjugate(coll, 8, 1, F.8^2);;
gap> SetConjugate(coll, 9, 2, F.9^2);;
gap> UpdatePolycyclicCollector(coll);;
gap> G := GroupByRws(coll);