| order | 2048 |
| nilpotency class | 2 |
| automorphism | ? |
| homology | Abelianization (H1) = C26 · Schur multiplier (H2) = C216 |
No aliases for this group.
| subgroup | G/H | |
|---|---|---|
| center, commutator, Frattini, socle, cosocle | C25 | C26 |
| LCS | G ▷ C25 ▷ C1 | |
| UCS | C1 ◁ C25 ◁ G | |
| LECS | G ▷ C25 ▷ C1 | |
At least 21969 conjugacy classes of subgroups; only the 5452 normal subgroups are shown.
| minimal degree | μ(G) = 24 |
| transitive degree | μt(G) = 256 |
A minimal faithful permutation representation — 6 generators on 24 points:
(6,7)(14,16);(5,6)(7,8)(10,12)(13,14)(15,16)(17,18)(19,23)(20,22)(21,24);(17,19)(18,21)(20,24)(22,23);(6,7)(9,10)(11,12)(18,22)(21,23);(2,4)(5,6,8,7)(9,10,11,12)(17,18)(19,21)(20,22)(23,24);(1,2)(3,4)(5,7,8,6)(9,10)(11,12)(17,19)(18,21)(20,24)(22,23)Polycyclic presentation:
2^11|e^2=gi,f^2=jk,b^a=bj,c^b=cg,d^b=di,e^a=ejk,e^b=egi,e^d=ei,f^a=fjk,f^b=fi,f^d=fjk,f^e=fh248 conjugacy classes — view the full character table.
| maximal subgroup of | #72331654 |
| maximal normal subgroup of | #72331654 |
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, 5, F.7*F.9);;
gap> SetPower(coll, 6, F.10*F.11);;
gap> SetConjugate(coll, 2, 1, F.2*F.10);;
gap> SetConjugate(coll, 3, 2, F.3*F.7);;
gap> SetConjugate(coll, 4, 2, F.4*F.9);;
gap> SetConjugate(coll, 5, 1, F.5*F.10*F.11);;
gap> SetConjugate(coll, 5, 2, F.5*F.7*F.9);;
gap> SetConjugate(coll, 5, 4, F.5*F.9);;
gap> SetConjugate(coll, 6, 1, F.6*F.10*F.11);;
gap> SetConjugate(coll, 6, 2, F.6*F.9);;
gap> SetConjugate(coll, 6, 4, F.6*F.10*F.11);;
gap> SetConjugate(coll, 6, 5, F.6*F.8);;
gap> UpdatePolycyclicCollector(coll);;
gap> G := GroupByRws(coll);