| order | 1024 |
| nilpotency class | 2 |
| automorphism | ? |
| homology | Abelianization (H1) = C26 · Schur multiplier (H2) = C213 |
No aliases for this group.
| subgroup | G/H | |
|---|---|---|
| center, commutator, Frattini, socle, cosocle | C24 | C26 |
| LCS | G ▷ C24 ▷ C1 | |
| UCS | C1 ◁ C24 ◁ G | |
| LECS | G ▷ C24 ▷ C1 | |
24238 conjugacy classes of subgroups.
| minimal degree | μ(G) = 24 |
| transitive degree | μt(G) = 256 |
A minimal faithful permutation representation — 6 generators on 24 points:
(1,2)(3,4)(6,8)(17,18)(19,21)(20,22)(23,24);(2,4)(6,8)(9,10,14,15)(11,13,12,16)(17,18,20,22)(19,23,24,21);(1,2)(3,4)(5,6,7,8)(10,15)(11,12)(17,18)(19,21)(20,22)(23,24);(9,11,14,12)(10,16,15,13)(17,19,20,24)(18,21,22,23);(1,2)(3,4)(9,12,14,11)(10,13,15,16);(9,13)(10,11)(12,15)(14,16)(17,18)(19,21)(20,22)(23,24)Polycyclic presentation:
2^10|b^2=gh,c^2=gi,d^2=gh,e^2=j,b^a=bg,c^a=cgi,c^b=cij,d^b=dgh,d^c=dj,e^b=eh,e^c=ej,f^b=fgh196 conjugacy classes — view the full character table.
| maximal subgroup of | #72306267 |
| maximal normal subgroup of | #72306267 |
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");;
gap> coll := SingleCollector(F, [2, 2, 2, 2, 2, 2, 2, 2, 2, 2]);;
gap> SetPower(coll, 2, F.7*F.8);;
gap> SetPower(coll, 3, F.7*F.9);;
gap> SetPower(coll, 4, F.7*F.8);;
gap> SetPower(coll, 5, F.10);;
gap> SetConjugate(coll, 2, 1, F.2*F.7);;
gap> SetConjugate(coll, 3, 1, F.3*F.7*F.9);;
gap> SetConjugate(coll, 3, 2, F.3*F.9*F.10);;
gap> SetConjugate(coll, 4, 2, F.4*F.7*F.8);;
gap> SetConjugate(coll, 4, 3, F.4*F.10);;
gap> SetConjugate(coll, 5, 2, F.5*F.8);;
gap> SetConjugate(coll, 5, 3, F.5*F.10);;
gap> SetConjugate(coll, 6, 2, F.6*F.7*F.8);;
gap> UpdatePolycyclicCollector(coll);;
gap> G := GroupByRws(coll);