| order | 2160 |
| automorphism | ? |
| homology | Abelianization (H1) = C4 · Schur multiplier (H2) = C2×C3 |
No aliases for this group.
| Fitting | C22×C5×C9 ⋊ Dic3 |
| derived | C5×C9×A4 ⋊ C4 |
| Sylow | C5 ⋊ C9⋊SL(2,ℤ/4) |
| subgroup | G/H | |
|---|---|---|
| center, hypercenter | C1 | G |
| commutator, hypocenter | C5×C9×A4 | C4 |
| Frattini | C3 | C3⋊(A4⋊AGL(1,𝔽5)) |
| Fitting | C22×C5×C9 | Dic3 |
| socle | C22×C3×C5 | C3⋊Dic3 |
| prime radical | C3×D5×A4 | D3 |
| cosocle | C9×D5×A4 | C2 |
| LCS | G ▷ C5×C9×A4 | |
| UCS | C1 | |
162 conjugacy classes of subgroups; only the 40 normal subgroups are shown.
This group has 162 conjugacy classes of subgroups — too many to draw. Only its 40 normal subgroups are shown.
Dotted edges: containments with no intermediate normal subgroup — omitted non-normal subgroups may lie between.
| minimal degree | μ(G) = 18 |
| transitive degree | μt(G) = 180 |
A minimal faithful permutation representation — 3 generators on 18 points:
(1,4,3,2)(6,7,8,9)(11,13)(12,16)(14,17)(15,18);(5,6,9,7,8)(10,15,13,12,17,14,16,11,18);(2,3,4)Polycyclic presentation:
2^2,3^2,5,3,2^2|a^2=b,d^3=f,c^a=c^2,d^a=d^2f^2,e^a=e^3,e^b=e^4,f^a=f^2,g^a=gh,g^c=h,h^c=gh78 conjugacy classes — view the full character table.
| maximal subgroup of | #72247686, S4×C9⋊AGL(1,𝔽5), D9×A4⋊AGL(1,𝔽5), … |
| maximal normal subgroup of | #72247686, S4×C9⋊AGL(1,𝔽5), D9×A4⋊AGL(1,𝔽5), … |
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");;
gap> coll := SingleCollector(F, [2, 2, 3, 3, 5, 3, 2, 2]);;
gap> SetPower(coll, 1, F.2);;
gap> SetPower(coll, 4, F.6);;
gap> SetConjugate(coll, 3, 1, F.3^2);;
gap> SetConjugate(coll, 4, 1, F.4^2*F.6^2);;
gap> SetConjugate(coll, 5, 1, F.5^3);;
gap> SetConjugate(coll, 5, 2, F.5^4);;
gap> SetConjugate(coll, 6, 1, F.6^2);;
gap> SetConjugate(coll, 7, 1, F.7*F.8);;
gap> SetConjugate(coll, 7, 3, F.8);;
gap> SetConjugate(coll, 8, 3, F.7*F.8);;
gap> UpdatePolycyclicCollector(coll);;
gap> G := GroupByRws(coll);