| order | 1024 |
| nilpotency class | 2 |
| automorphism | ? |
| homology | Abelianization (H1) = C26 · Schur multiplier (H2) = C215 |
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 8195 conjugacy classes of subgroups; only the 4529 normal subgroups are shown.
| minimal degree | μ(G) = 20 |
| transitive degree | μt(G) = 128 |
A minimal faithful permutation representation — 6 generators on 20 points:
(5,6)(7,8)(14,17)(15,19);(9,10)(11,12)(15,19)(18,20);(5,6,7,8)(10,12)(14,17)(15,19);(2,4);(9,10)(11,12)(13,14,16,17)(15,18,19,20);(1,2,3,4)(5,6)(7,8)(9,10)(11,12)(13,15,16,19)(14,18,17,20)Polycyclic presentation:
2^10|c^2=h,e^2=i,f^2=gi,c^a=ch,c^b=cj,e^a=ei,e^c=eij,f^a=fi,f^b=fi,f^c=fhij,f^d=fg166 conjugacy classes — view the full character table.
| maximal quotient of | #72251043 |
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, 3, F.8);;
gap> SetPower(coll, 5, F.9);;
gap> SetPower(coll, 6, F.7*F.9);;
gap> SetConjugate(coll, 3, 1, F.3*F.8);;
gap> SetConjugate(coll, 3, 2, F.3*F.10);;
gap> SetConjugate(coll, 5, 1, F.5*F.9);;
gap> SetConjugate(coll, 5, 3, F.5*F.9*F.10);;
gap> SetConjugate(coll, 6, 1, F.6*F.9);;
gap> SetConjugate(coll, 6, 2, F.6*F.9);;
gap> SetConjugate(coll, 6, 3, F.6*F.8*F.9*F.10);;
gap> SetConjugate(coll, 6, 4, F.6*F.7);;
gap> UpdatePolycyclicCollector(coll);;
gap> G := GroupByRws(coll);