| order | 2048 |
| nilpotency class | 2 |
| automorphism | ? |
| homology | Abelianization (H1) = C26 · Schur multiplier (H2) = C219 |
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 | |
2760236 conjugacy classes of subgroups.
| minimal degree | μ(G) = 24 |
| transitive degree | μt(G) = 128 |
A minimal faithful permutation representation — 6 generators on 24 points:
(2,4)(6,8)(10,12)(14,15)(17,18)(19,23)(20,21)(22,24);(2,4)(6,8)(9,10,11,12)(13,14,16,15)(19,24)(22,23);(5,6)(7,8)(13,14,16,15)(18,21)(22,23);(2,4)(6,8)(9,10,11,12)(13,15,16,14)(17,18)(19,23)(20,21)(22,24);(1,2)(3,4)(5,6)(7,8)(9,10)(11,12);(17,19)(18,22)(20,24)(21,23)Polycyclic presentation:
2^11|b^2=h,c^2=k,d^2=h,b^a=bh,c^a=ci,c^b=cij,d^a=dh,d^c=dik,e^a=eg,e^b=eg,e^d=eg,f^a=fjk,f^b=fjk,f^d=fjk320 conjugacy classes — view the full character table.
| maximal subgroup of | #72287919, #72334985, #72339945 |
| maximal normal subgroup of | #72287919, #72334985, #72339945 |
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, 2, F.8);;
gap> SetPower(coll, 3, F.11);;
gap> SetPower(coll, 4, F.8);;
gap> SetConjugate(coll, 2, 1, F.2*F.8);;
gap> SetConjugate(coll, 3, 1, F.3*F.9);;
gap> SetConjugate(coll, 3, 2, F.3*F.9*F.10);;
gap> SetConjugate(coll, 4, 1, F.4*F.8);;
gap> SetConjugate(coll, 4, 3, F.4*F.9*F.11);;
gap> SetConjugate(coll, 5, 1, F.5*F.7);;
gap> SetConjugate(coll, 5, 2, F.5*F.7);;
gap> SetConjugate(coll, 5, 4, F.5*F.7);;
gap> SetConjugate(coll, 6, 1, F.6*F.10*F.11);;
gap> SetConjugate(coll, 6, 2, F.6*F.10*F.11);;
gap> SetConjugate(coll, 6, 4, F.6*F.10*F.11);;
gap> UpdatePolycyclicCollector(coll);;
gap> G := GroupByRws(coll);