| order | 1024 |
| nilpotency class | 3 |
| automorphism | ? |
| homology | Abelianization (H1) = C26 · Schur multiplier (H2) = C215 |
No aliases for this group.
| subgroup | G/H | |
|---|---|---|
| center, socle | C22 | C23×#120 |
| commutator, Frattini, cosocle | C24 | C26 |
| LCS | G ▷ C24 ▷ C2 ▷ C1 | |
| UCS | C1 ◁ C22 ◁ C22×#120 ◁ G | |
| LECS | G ▷ C24 ▷ C2 ▷ C1 | |
50330 conjugacy classes of subgroups.
| minimal degree | μ(G) = 20 |
| transitive degree | μt(G) = 32 |
A minimal faithful permutation representation — 6 generators on 20 points:
(11,18)(16,20);(1,2)(3,4)(5,6)(7,10)(8,11)(9,12)(13,16)(14,17)(15,18)(19,20);(1,2)(3,4)(5,7,9,14)(6,10,12,17)(8,13,15,19)(11,16,18,20);(5,8)(6,11)(7,13)(9,15)(10,16)(12,18)(14,19)(17,20);(2,4);(6,12)(7,14)(11,18)(13,19)Polycyclic presentation:
2^10|c^2=j,b^a=bg,d^a=di,e^b=eh,e^c=eh,f^b=fj,f^c=fj,g^d=gj,i^b=ij148 conjugacy classes — view the full character table.
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.10);;
gap> SetConjugate(coll, 2, 1, F.2*F.7);;
gap> SetConjugate(coll, 4, 1, F.4*F.9);;
gap> SetConjugate(coll, 5, 2, F.5*F.8);;
gap> SetConjugate(coll, 5, 3, F.5*F.8);;
gap> SetConjugate(coll, 6, 2, F.6*F.10);;
gap> SetConjugate(coll, 6, 3, F.6*F.10);;
gap> SetConjugate(coll, 7, 4, F.7*F.10);;
gap> SetConjugate(coll, 9, 2, F.9*F.10);;
gap> UpdatePolycyclicCollector(coll);;
gap> G := GroupByRws(coll);