| order | 2048 |
| nilpotency class | 4 |
| automorphism | ? |
| homology | Abelianization (H1) = C24×C4 · Schur multiplier (H2) = C212 |
No aliases for this group.
| subgroup | G/H | |
|---|---|---|
| center, socle | C23 | C22×#442 |
| commutator | C22×C8 | C24×C4 |
| Frattini, cosocle | C23×C8 | C25 |
| prime radical | #72231322 | C2 |
| LCS | G ▷ C22×C8 ▷ C4 ▷ C2 ▷ C1 | |
| UCS | C1 ◁ C23 ◁ C25×C4 ◁ C24×#97 ◁ G | |
| LECS | G ▷ C23×C8 ▷ C4 ▷ C2 ▷ C1 | |
83361 conjugacy classes of subgroups.
| minimal degree | μ(G) = 24 |
| transitive degree | μt(G) = 64 |
A minimal faithful permutation representation — 5 generators on 24 points:
(2,4)(10,14)(15,22)(16,23)(18,24);(5,6)(7,8);(10,15)(12,21)(13,20)(14,22)(16,18)(17,19)(23,24);(2,4)(10,16,14,23)(12,17)(13,20)(15,18,22,24)(19,21);(1,2,3,4)(6,8)(9,10,17,16,13,18,12,15,11,14,21,23,20,24,19,22)Polycyclic presentation:
2^11|d^2=f,e^2=ghj,h^2=jk,j^2=k,e^a=eg,e^b=ei,e^c=eh,e^d=eghj,f^e=fk,h^c=hj,h^d=hjk,j^c=jk,j^d=jk224 conjugacy classes — view the full character table.
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, 4, F.6);;
gap> SetPower(coll, 5, F.7*F.8*F.10);;
gap> SetPower(coll, 8, F.10*F.11);;
gap> SetPower(coll, 10, F.11);;
gap> SetConjugate(coll, 5, 1, F.5*F.7);;
gap> SetConjugate(coll, 5, 2, F.5*F.9);;
gap> SetConjugate(coll, 5, 3, F.5*F.8);;
gap> SetConjugate(coll, 5, 4, F.5*F.7*F.8*F.10);;
gap> SetConjugate(coll, 6, 5, F.6*F.11);;
gap> SetConjugate(coll, 8, 3, F.8*F.10);;
gap> SetConjugate(coll, 8, 4, F.8*F.10*F.11);;
gap> SetConjugate(coll, 10, 3, F.10*F.11);;
gap> SetConjugate(coll, 10, 4, F.10*F.11);;
gap> UpdatePolycyclicCollector(coll);;
gap> G := GroupByRws(coll);