| 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 | |
At least 6179 conjugacy classes of subgroups; only the 3937 normal subgroups are shown.
| minimal degree | μ(G) = 24 |
| transitive degree | μt(G) = 256 |
A minimal faithful permutation representation — 6 generators on 24 points:
(2,4)(6,8)(17,18)(19,20)(21,23)(22,24);(5,6,7,8)(10,13)(11,15)(17,19)(18,20)(21,24)(22,23);(9,10)(11,14)(12,13)(15,16)(17,19,21,24)(18,20,23,22);(2,4);(1,2,3,4)(9,10)(11,14)(12,13)(15,16)(17,19)(18,22)(20,23)(21,24);(9,11,12,15)(10,14,13,16)(17,20,21,22)(18,19,23,24)Polycyclic presentation:
2^10|b^2=i,c^2=g,e^2=h,f^2=j,b^a=bi,c^b=cj,e^a=egh,e^b=egj,e^c=eg,e^d=eh,f^b=fj196 conjugacy classes — view the full character table.
| maximal subgroup of | #72305679, #72306267 |
| maximal normal subgroup of | #72305679, #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.9);;
gap> SetPower(coll, 3, F.7);;
gap> SetPower(coll, 5, F.8);;
gap> SetPower(coll, 6, F.10);;
gap> SetConjugate(coll, 2, 1, F.2*F.9);;
gap> SetConjugate(coll, 3, 2, F.3*F.10);;
gap> SetConjugate(coll, 5, 1, F.5*F.7*F.8);;
gap> SetConjugate(coll, 5, 2, F.5*F.7*F.10);;
gap> SetConjugate(coll, 5, 3, F.5*F.7);;
gap> SetConjugate(coll, 5, 4, F.5*F.8);;
gap> SetConjugate(coll, 6, 2, F.6*F.10);;
gap> UpdatePolycyclicCollector(coll);;
gap> G := GroupByRws(coll);