| order | 1024 |
| nilpotency class | 2 |
| automorphism | ? |
| homology | Abelianization (H1) = C26 · Schur multiplier (H2) = C214 |
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 | |
52969 conjugacy classes of subgroups.
| minimal degree | μ(G) = 24 |
| transitive degree | μt(G) = 128 |
A minimal faithful permutation representation — 6 generators on 24 points:
(5,6)(7,8)(17,18,22,21)(19,20,23,24);(9,10)(11,14)(12,13)(15,16)(17,19)(18,20)(21,24)(22,23);(2,4)(5,6,7,8)(10,13)(11,15);(17,20,22,24)(18,23,21,19);(1,2)(3,4)(5,6)(7,8)(9,11,12,15)(10,14,13,16)(17,21,22,18)(19,20,23,24);(1,2)(3,4)(5,6)(7,8)(9,10)(11,16)(12,13)(14,15)(17,20)(18,23)(19,21)(22,24)Polycyclic presentation:
2^10|a^2=g,c^2=j,d^2=g,e^2=gh,c^a=cj,c^b=ch,e^b=eg,e^c=ei,e^d=eg,f^b=fg,f^c=fi,f^d=fg,f^e=fgh184 conjugacy classes — view the full character table.
| maximal subgroup of | #72303323 |
| maximal normal subgroup of | #72303323 |
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, 1, F.7);;
gap> SetPower(coll, 3, F.10);;
gap> SetPower(coll, 4, F.7);;
gap> SetPower(coll, 5, F.7*F.8);;
gap> SetConjugate(coll, 3, 1, F.3*F.10);;
gap> SetConjugate(coll, 3, 2, F.3*F.8);;
gap> SetConjugate(coll, 5, 2, F.5*F.7);;
gap> SetConjugate(coll, 5, 3, F.5*F.9);;
gap> SetConjugate(coll, 5, 4, F.5*F.7);;
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);;
gap> UpdatePolycyclicCollector(coll);;
gap> G := GroupByRws(coll);