| order | 3960 |
| automorphism | ? |
| homology | Abelianization (H1) = C2×C5 · Schur multiplier (H2) = C2×C3 |
No aliases for this group.
| Fitting, socle | C22×C3×C11 ⋊ C5×D3 |
| derived | C3×C11×A4 ⋊ C2×C5 |
| Hall | C3⋊(C11⋊S4) ⋊ C5 |
| Hall | C11⋊C5 ⋊ C3⋊S4 |
| Sylow | C11 ⋊ C5×C3⋊S4 |
| subgroup | G/H | |
|---|---|---|
| center, Frattini, hypercenter | C1 | G |
| commutator, cosocle, hypocenter | C3×C11×A4 | C2×C5 |
| Fitting, socle | C22×C3×C11 | C5×D3 |
| LCS | G ▷ C3×C11×A4 | |
| UCS | C1 | |
120 conjugacy classes of subgroups.
| transitive degree | μt(G) = 132 |
Polycyclic presentation:
2,5,3^2,11,2^2|c^a=c^2,d^a=d^2,e^a=e^10,e^b=e^5,f^a=fg,f^c=g,g^c=fg57 conjugacy classes — view the full character table.
| maximal subgroup of | S4×C3⋊AGL(1,𝔽11), D3×A4⋊AGL(1,𝔽11), C3⋊S4×AGL(1,𝔽11), … |
| maximal normal subgroup of | S4×C3⋊AGL(1,𝔽11), D3×A4⋊AGL(1,𝔽11), C3⋊S4×AGL(1,𝔽11) |
| maximal quotient of | #72268737 |
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");;
gap> coll := SingleCollector(F, [2, 5, 3, 3, 11, 2, 2]);;
gap> SetConjugate(coll, 3, 1, F.3^2);;
gap> SetConjugate(coll, 4, 1, F.4^2);;
gap> SetConjugate(coll, 5, 1, F.5^10);;
gap> SetConjugate(coll, 5, 2, F.5^5);;
gap> SetConjugate(coll, 6, 1, F.6*F.7);;
gap> SetConjugate(coll, 6, 3, F.7);;
gap> SetConjugate(coll, 7, 3, F.6*F.7);;
gap> UpdatePolycyclicCollector(coll);;
gap> G := GroupByRws(coll);