| order | 1024 |
| nilpotency class | 2 |
| automorphism | ? |
| homology | Abelianization (H1) = C26 · Schur multiplier (H2) = C211 |
No aliases for this group.
| subgroup | G/H | |
|---|---|---|
| center, commutator, Frattini, socle, cosocle | C24 | C26 |
| prime radical | #845341 | C2 |
| LCS | G ▷ C24 ▷ C1 | |
| UCS | C1 ◁ C24 ◁ G | |
| LECS | G ▷ C24 ▷ C1 | |
At least 8342 conjugacy classes of subgroups; only the 3153 normal subgroups are shown.
| minimal degree | μ(G) = 32 |
| transitive degree | μt(G) = 128 |
A minimal faithful permutation representation — 6 generators on 32 points:
(2,5)(3,7)(26,29)(27,31);(10,13)(11,15)(17,18,20,22)(19,23,24,21)(25,26)(27,30)(28,29)(31,32);(3,7)(6,8)(10,13)(11,15)(19,24)(21,23)(27,31)(30,32);(2,5)(3,7)(10,13)(14,16)(27,31)(30,32);(1,2,4,5)(3,6,7,8)(9,10)(11,14)(12,13)(15,16)(17,18)(19,21)(20,22)(23,24)(25,27)(26,30)(28,31)(29,32);(1,3)(2,6)(4,7)(5,8)(9,11,12,15)(10,14,13,16)(17,19,20,24)(18,21,22,23)(25,26)(27,30)(28,29)(31,32)Polycyclic presentation:
2^10|b^2=i,e^2=h,f^2=ghj,b^a=bg,e^a=egh,e^b=eghj,e^c=ehij,e^d=eij,f^a=fgh,f^b=fghj,f^c=fgj,f^d=fh148 conjugacy classes — view the full character table.
| maximal subgroup of | #72336494 |
| maximal normal subgroup of | #72336494 |
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.9);;
gap> SetPower(coll, 5, F.8);;
gap> SetPower(coll, 6, F.7*F.8*F.10);;
gap> SetConjugate(coll, 2, 1, F.2*F.7);;
gap> SetConjugate(coll, 5, 1, F.5*F.7*F.8);;
gap> SetConjugate(coll, 5, 2, F.5*F.7*F.8*F.10);;
gap> SetConjugate(coll, 5, 3, F.5*F.8*F.9*F.10);;
gap> SetConjugate(coll, 5, 4, F.5*F.9*F.10);;
gap> SetConjugate(coll, 6, 1, F.6*F.7*F.8);;
gap> SetConjugate(coll, 6, 2, F.6*F.7*F.8*F.10);;
gap> SetConjugate(coll, 6, 3, F.6*F.7*F.10);;
gap> SetConjugate(coll, 6, 4, F.6*F.8);;
gap> UpdatePolycyclicCollector(coll);;
gap> G := GroupByRws(coll);