| order | 2048 |
| nilpotency class | 2 |
| automorphism | ? |
| homology | Abelianization (H1) = C25×C4 · Schur multiplier (H2) = C217 |
No aliases for this group.
| subgroup | G/H | |
|---|---|---|
| center, Frattini, socle, cosocle | C25 | C26 |
| commutator | C24 | C25×C4 |
| prime radical | C2×#612424 | C2 |
| LCS | G ▷ C24 ▷ C1 | |
| UCS | C1 ◁ C25 ◁ G | |
| LECS | G ▷ C25 ▷ C1 | |
At least 6495 conjugacy classes of subgroups; only the 10448 normal subgroups are shown.
| minimal degree | μ(G) = 24 |
| transitive degree | μt(G) = 256 |
A minimal faithful permutation representation — 6 generators on 24 points:
(10,12)(13,14,15,16)(19,23)(22,24);(18,21)(19,23);(2,4)(6,8)(10,12);(10,12);(5,6)(7,8)(9,10)(11,12)(17,18)(19,22)(20,21)(23,24);(1,2)(3,4)(5,6)(7,8)(9,10)(11,12)(17,19)(18,22)(20,23)(21,24)Polycyclic presentation:
2^11|a^2=k,e^a=eg,e^b=ej,e^c=ei,e^d=eg,f^a=fgj,f^b=fj,f^c=fh,f^d=fg368 conjugacy classes — view the full character table.
| maximal subgroup of | #72330739 |
| maximal normal subgroup of | #72330739 |
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", "j", "k");;
gap> coll := SingleCollector(F, [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2]);;
gap> SetPower(coll, 1, F.11);;
gap> SetConjugate(coll, 5, 1, F.5*F.7);;
gap> SetConjugate(coll, 5, 2, F.5*F.10);;
gap> SetConjugate(coll, 5, 3, F.5*F.9);;
gap> SetConjugate(coll, 5, 4, F.5*F.7);;
gap> SetConjugate(coll, 6, 1, F.6*F.7*F.10);;
gap> SetConjugate(coll, 6, 2, F.6*F.10);;
gap> SetConjugate(coll, 6, 3, F.6*F.8);;
gap> SetConjugate(coll, 6, 4, F.6*F.7);;
gap> UpdatePolycyclicCollector(coll);;
gap> G := GroupByRws(coll);