| 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 | |
36775 conjugacy classes of subgroups.
| minimal degree | μ(G) = 24 |
| transitive degree | μt(G) = 128 |
A minimal faithful permutation representation — 6 generators on 24 points:
(2,3)(5,6)(7,8)(10,13)(14,16);(6,8)(17,18)(19,22)(20,21)(23,24);(5,6)(7,8)(10,13)(14,16)(18,21)(22,23);(17,19)(18,22)(20,24)(21,23);(1,2,4,3)(9,10)(11,14)(12,13)(15,16)(17,18)(19,23)(20,21)(22,24);(1,3,4,2)(9,11,12,15)(10,14,13,16)(17,18)(19,23)(20,21)(22,24)Polycyclic presentation:
2^10|e^2=ghij,f^2=h,b^a=bg,c^b=ci,e^a=eh,e^c=ej,e^d=egi,f^a=fghij,f^c=fgi,f^d=fgi160 conjugacy classes — view the full character table.
| maximal subgroup of | #72335688 |
| maximal normal subgroup of | #72335688 |
| maximal quotient of | #72336148 |
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, 5, F.7*F.8*F.9*F.10);;
gap> SetPower(coll, 6, F.8);;
gap> SetConjugate(coll, 2, 1, F.2*F.7);;
gap> SetConjugate(coll, 3, 2, F.3*F.9);;
gap> SetConjugate(coll, 5, 1, F.5*F.8);;
gap> SetConjugate(coll, 5, 3, F.5*F.10);;
gap> SetConjugate(coll, 5, 4, F.5*F.7*F.9);;
gap> SetConjugate(coll, 6, 1, F.6*F.7*F.8*F.9*F.10);;
gap> SetConjugate(coll, 6, 3, F.6*F.7*F.9);;
gap> SetConjugate(coll, 6, 4, F.6*F.7*F.9);;
gap> UpdatePolycyclicCollector(coll);;
gap> G := GroupByRws(coll);