| order | 1024 |
| nilpotency class | 3 |
| automorphism | ? |
| homology | Abelianization (H1) = C25 · Schur multiplier (H2) = C212 |
No aliases for this group.
| subgroup | G/H | |
|---|---|---|
| center, socle | C23 | C22×#120 |
| commutator, Frattini, cosocle | C2×C42 | C25 |
| LCS | G ▷ C2×C42 ▷ C22 ▷ C1 | |
| UCS | C1 ◁ C23 ◁ C23×C42 ◁ G | |
| LECS | G ▷ C2×C42 ▷ C22 ▷ C1 | |
56344 conjugacy classes of subgroups.
| minimal degree | μ(G) = 20 |
| transitive degree | μt(G) = 64 |
A minimal faithful permutation representation — 5 generators on 20 points:
(13,14)(15,17)(16,18)(19,20);(1,2)(3,4);(6,9)(7,11)(10,12)(15,20)(17,19);(6,10)(9,12);(2,4)(5,6,7,9,8,10,11,12)(14,17,18,19)Polycyclic presentation:
2^10|e^2=f,f^2=i,h^2=j,e^a=eh,e^b=eg,e^c=ef,e^d=ei,f^a=fj,f^c=fi,h^a=hj,h^c=hj130 conjugacy classes — view the full character table.
| maximal subgroup of | #72261804, #72284608, #72284725, … |
| maximal normal subgroup of | #72261804, #72284608, #72284725, … |
| maximal quotient of | #72226708, #72226717 |
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.6);;
gap> SetPower(coll, 6, F.9);;
gap> SetPower(coll, 8, F.10);;
gap> SetConjugate(coll, 5, 1, F.5*F.8);;
gap> SetConjugate(coll, 5, 2, F.5*F.7);;
gap> SetConjugate(coll, 5, 3, F.5*F.6);;
gap> SetConjugate(coll, 5, 4, F.5*F.9);;
gap> SetConjugate(coll, 6, 1, F.6*F.10);;
gap> SetConjugate(coll, 6, 3, F.6*F.9);;
gap> SetConjugate(coll, 8, 1, F.8*F.10);;
gap> SetConjugate(coll, 8, 3, F.8*F.10);;
gap> UpdatePolycyclicCollector(coll);;
gap> G := GroupByRws(coll);