| order | 2048 |
| nilpotency class | 2 |
| automorphism | ? |
| homology | Abelianization (H1) = C28 · Schur multiplier (H2) = C225 |
No aliases for this group.
| subgroup | G/H | |
|---|---|---|
| center, commutator, Frattini, socle, cosocle | C23 | C28 |
| LCS | G ▷ C23 ▷ C1 | |
| UCS | C1 ◁ C23 ◁ G | |
| LECS | G ▷ C23 ▷ C1 | |
At least 45301 conjugacy classes of subgroups; only the 418836 normal subgroups are shown.
| minimal degree | μ(G) = 24 |
| transitive degree | μt(G) = 64 |
A minimal faithful permutation representation — 8 generators on 24 points:
(2,5)(3,7)(10,13)(11,15)(17,18)(19,22)(20,21)(23,24);(2,5)(3,7)(10,13)(11,15)(18,21)(19,23);(3,7)(6,8)(11,15)(14,16);(2,5)(3,7)(10,13)(11,15)(19,23)(22,24);(11,15)(14,16);(10,13)(11,15)(19,23)(22,24);(1,2)(3,6)(4,5)(7,8)(9,10)(11,14)(12,13)(15,16)(17,19)(18,22)(20,23)(21,24);(1,3)(2,6)(4,7)(5,8)(9,11)(10,14)(12,15)(13,16)(17,18)(19,22)(20,21)(23,24)Polycyclic presentation:
2^11|b^a=bj,g^a=gjk,g^b=gk,g^d=gk,g^f=gi,h^a=hjk,h^b=hk,h^c=hjk,h^d=hjk,h^e=hij,h^f=hij344 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> SetConjugate(coll, 2, 1, F.2*F.10);;
gap> SetConjugate(coll, 7, 1, F.7*F.10*F.11);;
gap> SetConjugate(coll, 7, 2, F.7*F.11);;
gap> SetConjugate(coll, 7, 4, F.7*F.11);;
gap> SetConjugate(coll, 7, 6, F.7*F.9);;
gap> SetConjugate(coll, 8, 1, F.8*F.10*F.11);;
gap> SetConjugate(coll, 8, 2, F.8*F.11);;
gap> SetConjugate(coll, 8, 3, F.8*F.10*F.11);;
gap> SetConjugate(coll, 8, 4, F.8*F.10*F.11);;
gap> SetConjugate(coll, 8, 5, F.8*F.9*F.10);;
gap> SetConjugate(coll, 8, 6, F.8*F.9*F.10);;
gap> UpdatePolycyclicCollector(coll);;
gap> G := GroupByRws(coll);