| order | 1024 |
| nilpotency class | 2 |
| automorphism | ? |
| homology | Abelianization (H1) = C25 · Schur multiplier (H2) = C29×C42 |
No aliases for this group.
| subgroup | G/H | |
|---|---|---|
| center, commutator, Frattini, socle, cosocle | C25 | C25 |
| LCS | G ▷ C25 ▷ C1 | |
| UCS | C1 ◁ C25 ◁ G | |
| LECS | G ▷ C25 ▷ C1 | |
22617 conjugacy classes of subgroups.
| minimal degree | μ(G) = 28 |
| transitive degree | μt(G) = 512 |
A minimal faithful permutation representation — 5 generators on 28 points:
(2,4)(6,8)(10,12)(15,19)(18,20)(23,27)(26,28);(6,8)(9,10,11,12)(14,17)(18,20)(22,25)(26,28);(1,2)(3,4)(5,6)(7,8)(9,10)(11,12)(15,19)(18,20)(22,25)(26,28);(13,14)(15,18)(16,17)(19,20)(21,22,24,25)(23,26,27,28);(13,15,16,19)(14,18,17,20)(21,23,24,27)(22,26,25,28)Polycyclic presentation:
2^10|b^2=h,d^2=i,e^2=j,b^a=bh,c^a=cg,c^b=cf,d^b=dj,d^c=di,e^a=ej,e^c=eij160 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.9);;
gap> SetPower(coll, 5, F.10);;
gap> SetConjugate(coll, 2, 1, F.2*F.8);;
gap> SetConjugate(coll, 3, 1, F.3*F.7);;
gap> SetConjugate(coll, 3, 2, F.3*F.6);;
gap> SetConjugate(coll, 4, 2, F.4*F.10);;
gap> SetConjugate(coll, 4, 3, F.4*F.9);;
gap> SetConjugate(coll, 5, 1, F.5*F.10);;
gap> SetConjugate(coll, 5, 3, F.5*F.9*F.10);;
gap> UpdatePolycyclicCollector(coll);;
gap> G := GroupByRws(coll);