| order | 1024 |
| nilpotency class | 2 |
| automorphism | ? |
| homology | Abelianization (H1) = C25 · Schur multiplier (H2) = C210 |
No aliases for this group.
| subgroup | G/H | |
|---|---|---|
| center, commutator, Frattini, socle, cosocle | C25 | C25 |
| prime radical | C2×#14716 | C2 |
| LCS | G ▷ C25 ▷ C1 | |
| UCS | C1 ◁ C25 ◁ G | |
| LECS | G ▷ C25 ▷ C1 | |
At least 7061 conjugacy classes of subgroups; only the 1093 normal subgroups are shown.
| minimal degree | μ(G) = 32 |
| transitive degree | μt(G) = 256 |
A minimal faithful permutation representation — 5 generators on 32 points:
(10,13)(14,16)(18,21)(22,24)(25,26)(27,29)(28,30)(31,32);(1,2,3,4)(5,6,7,8)(11,15)(14,16)(18,21)(19,23)(26,27)(30,31);(5,6)(7,8)(11,15)(14,16)(19,23)(22,24)(28,32)(30,31);(2,4)(5,6)(7,8)(9,10)(11,16)(12,13)(14,15)(17,18,20,21)(19,22,23,24)(25,27,29,26)(28,31,32,30);(1,2)(3,4)(9,11)(10,14)(12,15)(13,16)(17,19,20,23)(18,22,21,24)(25,28)(26,30)(27,31)(29,32)Polycyclic presentation:
2^10|b^2=h,d^2=hi,e^2=ghi,b^a=bg,c^b=cf,d^a=dj,d^b=di,e^b=efghj,e^c=ej,e^d=efij148 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, 2, F.8);;
gap> SetPower(coll, 4, F.8*F.9);;
gap> SetPower(coll, 5, F.7*F.8*F.9);;
gap> SetConjugate(coll, 2, 1, F.2*F.7);;
gap> SetConjugate(coll, 3, 2, F.3*F.6);;
gap> SetConjugate(coll, 4, 1, F.4*F.10);;
gap> SetConjugate(coll, 4, 2, F.4*F.9);;
gap> SetConjugate(coll, 5, 2, F.5*F.6*F.7*F.8*F.10);;
gap> SetConjugate(coll, 5, 3, F.5*F.10);;
gap> SetConjugate(coll, 5, 4, F.5*F.6*F.9*F.10);;
gap> UpdatePolycyclicCollector(coll);;
gap> G := GroupByRws(coll);