| 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 10710 conjugacy classes of subgroups; only the 3721 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)(9,10)(11,13)(12,14)(15,16)(18,21)(22,23);(2,4)(6,8)(17,18,20,21)(19,22,24,23);(1,2)(3,4)(5,6,7,8)(9,10,12,14)(11,13,16,15);(1,2)(3,4)(9,10,12,14)(11,15,16,13)(17,18)(19,23)(20,21)(22,24);(2,4)(9,10)(11,13)(12,14)(15,16)(17,19)(18,22)(20,24)(21,23);(1,2)(3,4)(9,11)(10,13)(12,16)(14,15)(17,18)(19,23)(20,21)(22,24)Polycyclic presentation:
2^10|b^2=h,c^2=ghi,d^2=ij,b^a=bh,c^a=chi,c^b=cg,d^a=di,d^b=dj,e^c=ehi,e^d=ei,f^a=fj,f^b=fj,f^d=fij,f^e=fj142 conjugacy classes — view the full character table.
| maximal subgroup of | #72256795 |
| maximal normal subgroup of | #72256795 |
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.8);;
gap> SetPower(coll, 3, F.7*F.8*F.9);;
gap> SetPower(coll, 4, F.9*F.10);;
gap> SetConjugate(coll, 2, 1, F.2*F.8);;
gap> SetConjugate(coll, 3, 1, F.3*F.8*F.9);;
gap> SetConjugate(coll, 3, 2, F.3*F.7);;
gap> SetConjugate(coll, 4, 1, F.4*F.9);;
gap> SetConjugate(coll, 4, 2, F.4*F.10);;
gap> SetConjugate(coll, 5, 3, F.5*F.8*F.9);;
gap> SetConjugate(coll, 5, 4, F.5*F.9);;
gap> SetConjugate(coll, 6, 1, F.6*F.10);;
gap> SetConjugate(coll, 6, 2, F.6*F.10);;
gap> SetConjugate(coll, 6, 4, F.6*F.9*F.10);;
gap> SetConjugate(coll, 6, 5, F.6*F.10);;
gap> UpdatePolycyclicCollector(coll);;
gap> G := GroupByRws(coll);