| order | 2160 |
| automorphism | ? |
| homology | Abelianization (H1) = C2 · Schur multiplier (H2) = C1 |
No aliases for this group.
| Fitting, socle | C32×C5 ⋊ GL(2,𝔽3) |
| derived | C5×PSU(3,𝔽2)⋊C3 ⋊ C2 |
| Sylow | C5 ⋊ AGL(2,𝔽3) |
| subgroup | G/H | |
|---|---|---|
| center, Frattini, hypercenter | C1 | G |
| commutator, cosocle, hypocenter | C5×PSU(3,𝔽2)⋊C3 | C2 |
| Fitting, socle | C32×C5 | GL(2,𝔽3) |
| LCS | G ▷ C5×PSU(3,𝔽2)⋊C3 | |
| UCS | C1 | |
92 conjugacy classes of subgroups.
Polycyclic presentation:
2,3,5,2^3,3^2|d^2=f,e^2=f,b^a=b^2,c^a=c^4,d^a=de,d^b=e,e^a=ef,e^b=def,e^d=ef,g^a=g^2,g^d=h,g^e=gh,g^f=g^2,h^a=g^2h,h^b=gh,h^d=g^2,h^e=gh^2,h^f=h^231 conjugacy classes — view the full character table.
| maximal subgroup of | D5×AGL(2,𝔽3), C3×#72213709, C2×#72213709 |
| maximal normal subgroup of | D5×AGL(2,𝔽3), C3×#72213709, C2×#72213709 |
| maximal quotient of | C3×#72213709, C2×#72213709 |
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, 3, 5, 2, 2, 2, 3, 3]);;
gap> SetPower(coll, 4, F.6);;
gap> SetPower(coll, 5, F.6);;
gap> SetConjugate(coll, 2, 1, F.2^2);;
gap> SetConjugate(coll, 3, 1, F.3^4);;
gap> SetConjugate(coll, 4, 1, F.4*F.5);;
gap> SetConjugate(coll, 4, 2, F.5);;
gap> SetConjugate(coll, 5, 1, F.5*F.6);;
gap> SetConjugate(coll, 5, 2, F.4*F.5*F.6);;
gap> SetConjugate(coll, 5, 4, F.5*F.6);;
gap> SetConjugate(coll, 7, 1, F.7^2);;
gap> SetConjugate(coll, 7, 4, F.8);;
gap> SetConjugate(coll, 7, 5, F.7*F.8);;
gap> SetConjugate(coll, 7, 6, F.7^2);;
gap> SetConjugate(coll, 8, 1, F.7^2*F.8);;
gap> SetConjugate(coll, 8, 2, F.7*F.8);;
gap> SetConjugate(coll, 8, 4, F.7^2);;
gap> SetConjugate(coll, 8, 5, F.7*F.8^2);;
gap> SetConjugate(coll, 8, 6, F.8^2);;
gap> UpdatePolycyclicCollector(coll);;
gap> G := GroupByRws(coll);