| order | 2048 |
| nilpotency class | 2 |
| automorphism | ? |
| homology | Abelianization (H1) = C26 · Schur multiplier (H2) = C215 |
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 16678 conjugacy classes of subgroups; only the 5120 normal subgroups are shown.
| minimal degree | μ(G) = 24 |
| transitive degree | μt(G) = 512 |
A minimal faithful permutation representation — 6 generators on 24 points:
(1,2)(3,4)(5,6)(7,8)(14,16)(17,18)(19,22)(20,21)(23,24);(6,8)(13,14)(15,16)(18,21)(22,23);(2,4)(5,6)(7,8)(10,12);(6,8)(9,10)(11,12)(18,21)(22,23);(2,4)(5,6)(7,8)(17,19)(18,22)(20,24)(21,23);(1,2)(3,4)(5,6)(7,8)(17,18)(19,23)(20,21)(22,24)Polycyclic presentation:
2^11|b^a=bk,c^a=ci,c^b=ch,d^a=dg,d^c=dj,e^a=ei,e^b=eh,e^d=eh,f^b=fg,f^c=fi,f^d=fg,f^e=fghi224 conjugacy classes — view the full character table.
| maximal quotient of | #72299933 |
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.11);;
gap> SetConjugate(coll, 3, 1, F.3*F.9);;
gap> SetConjugate(coll, 3, 2, F.3*F.8);;
gap> SetConjugate(coll, 4, 1, F.4*F.7);;
gap> SetConjugate(coll, 4, 3, F.4*F.10);;
gap> SetConjugate(coll, 5, 1, F.5*F.9);;
gap> SetConjugate(coll, 5, 2, F.5*F.8);;
gap> SetConjugate(coll, 5, 4, F.5*F.8);;
gap> SetConjugate(coll, 6, 2, F.6*F.7);;
gap> SetConjugate(coll, 6, 3, F.6*F.9);;
gap> SetConjugate(coll, 6, 4, F.6*F.7);;
gap> SetConjugate(coll, 6, 5, F.6*F.7*F.8*F.9);;
gap> UpdatePolycyclicCollector(coll);;
gap> G := GroupByRws(coll);