| order | 2880 |
| automorphism | ? |
| homology | Abelianization (H1) = C2×C32 · Schur multiplier (H2) = C2×C3 |
No aliases for this group.
| Hall | #66285 ⋊ C32 |
| Sylow | C5 ⋊ (#41⋊C3)⋊A4 |
| subgroup | G/H | |
|---|---|---|
| center, Frattini, hypercenter | C2 | D5×A42 |
| commutator, Fitting, cosocle, hypocenter | C5×H(5,𝔽2) | C2×C32 |
| socle | C2×C5 | C2×A42 |
| LCS | G ▷ C5×H(5,𝔽2) | |
| UCS | C1 ◁ C2 | |
276 conjugacy classes of subgroups; only the 35 normal subgroups are shown.
This group has 276 conjugacy classes of subgroups — too many to draw. Only its 35 normal subgroups are shown.
Dotted edges: containments with no intermediate normal subgroup — omitted non-normal subgroups may lie between.
| transitive degree | μt(G) = 240 |
Polycyclic presentation:
2,3^2,2^4,5,2|a^2=i,d^2=i,e^2=i,d^b=e,d^c=e,e^b=dei,e^c=dei,e^d=ei,f^b=g,f^c=def,f^e=fi,g^b=fg,g^c=dgi,g^d=gi,h^a=h^4100 conjugacy classes — view the full character table.
| maximal subgroup of | D5×(#41⋊C3)⋊A4 |
| maximal normal subgroup of | D5×(#41⋊C3)⋊A4 |
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, 3, 3, 2, 2, 2, 2, 5, 2]);;
gap> SetPower(coll, 1, F.9);;
gap> SetPower(coll, 4, F.9);;
gap> SetPower(coll, 5, F.9);;
gap> SetConjugate(coll, 4, 2, F.5);;
gap> SetConjugate(coll, 4, 3, F.5);;
gap> SetConjugate(coll, 5, 2, F.4*F.5*F.9);;
gap> SetConjugate(coll, 5, 3, F.4*F.5*F.9);;
gap> SetConjugate(coll, 5, 4, F.5*F.9);;
gap> SetConjugate(coll, 6, 2, F.7);;
gap> SetConjugate(coll, 6, 3, F.4*F.5*F.6);;
gap> SetConjugate(coll, 6, 5, F.6*F.9);;
gap> SetConjugate(coll, 7, 2, F.6*F.7);;
gap> SetConjugate(coll, 7, 3, F.4*F.7*F.9);;
gap> SetConjugate(coll, 7, 4, F.7*F.9);;
gap> SetConjugate(coll, 8, 1, F.8^4);;
gap> UpdatePolycyclicCollector(coll);;
gap> G := GroupByRws(coll);