| order | 1024 |
| nilpotency class | 3 |
| automorphism | ? |
| homology | Abelianization (H1) = C22×C42 · Schur multiplier (H2) = C24×C4×C8 |
No aliases for this group.
| subgroup | G/H | |
|---|---|---|
| center, socle, prime radical | C24 | C2×#127 |
| commutator | C42 | C22×C42 |
| Frattini, cosocle | C22×C42 | C24 |
| LCS | G ▷ C42 ▷ C22 ▷ C1 | |
| UCS | C1 ◁ C24 ◁ C2×C43 ◁ G | |
| LECS | G ▷ C22×C42 ▷ C22 ▷ C1 | |
2721 conjugacy classes of subgroups.
| minimal degree | μ(G) = 24 |
| transitive degree | μt(G) = 1024 |
A minimal faithful permutation representation — 4 generators on 24 points:
(1,2,4,3)(9,10,11,15)(12,13,16,14)(18,21)(19,24)(22,23);(5,6,7,8)(10,13)(12,16)(14,15)(18,22)(19,24)(21,23);(1,3,4,2)(10,14)(12,16)(13,15)(18,21)(19,24)(22,23);(17,18,19,21,20,23,24,22)Polycyclic presentation:
2^10|a^2=e,b^2=f,c^2=ei,d^2=h,g^2=i,h^2=j,b^a=bg,c^a=cgi,d^a=dh,d^b=dhj,d^c=dh,g^a=gi,g^b=gi,g^c=gi,h^a=hj,h^b=hj,h^c=hj160 conjugacy classes — view the full character table.
| maximal subgroup of | C4×#212918 |
| maximal normal subgroup of | C4×#212918 |
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.5);;
gap> SetPower(coll, 2, F.6);;
gap> SetPower(coll, 3, F.5*F.9);;
gap> SetPower(coll, 4, F.8);;
gap> SetPower(coll, 7, F.9);;
gap> SetPower(coll, 8, 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, 4, 1, F.4*F.8);;
gap> SetConjugate(coll, 4, 2, F.4*F.8*F.10);;
gap> SetConjugate(coll, 4, 3, F.4*F.8);;
gap> SetConjugate(coll, 7, 1, F.7*F.9);;
gap> SetConjugate(coll, 7, 2, F.7*F.9);;
gap> SetConjugate(coll, 7, 3, F.7*F.9);;
gap> SetConjugate(coll, 8, 1, F.8*F.10);;
gap> SetConjugate(coll, 8, 2, F.8*F.10);;
gap> SetConjugate(coll, 8, 3, F.8*F.10);;
gap> UpdatePolycyclicCollector(coll);;
gap> G := GroupByRws(coll);