| order | 1024 |
| nilpotency class | 2 |
| automorphism | ? |
| homology | Abelianization (H1) = C23×C8 · Schur multiplier (H2) = C28 |
No aliases for this group.
| subgroup | G/H | |
|---|---|---|
| center, Frattini, cosocle | C23×C8 | C24 |
| commutator, socle | C24 | C23×C8 |
| prime radical | C23×#41 | C8 |
| LCS | G ▷ C24 ▷ C1 | |
| UCS | C1 ◁ C23×C8 ◁ G | |
| LECS | G ▷ C23×C8 ▷ C4 ▷ C2 ▷ C1 | |
5837 conjugacy classes of subgroups.
| minimal degree | μ(G) = 32 |
| transitive degree | μt(G) = 512 |
A minimal faithful permutation representation — 4 generators on 32 points:
(2,4)(9,10)(11,14)(12,13)(15,16);(5,6)(7,8)(10,13)(14,16);(1,2,3,4)(6,8)(17,18,22,29,28,31,27,30,21,23,26,32,20,25,19,24);(9,11,12,15)(10,14,13,16)(18,23)(24,30)(25,31)(29,32)Polycyclic presentation:
2^10|c^2=efij,d^2=h,f^2=i,i^2=j,b^a=bh,c^a=ce,c^b=cg,d^c=dj256 conjugacy classes — view the full character table.
| maximal subgroup of | #72287806, #72287826 |
| maximal normal subgroup of | #72287806, #72287826 |
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.5*F.6*F.9*F.10);;
gap> SetPower(coll, 4, F.8);;
gap> SetPower(coll, 6, F.9);;
gap> SetPower(coll, 9, F.10);;
gap> SetConjugate(coll, 2, 1, F.2*F.8);;
gap> SetConjugate(coll, 3, 1, F.3*F.5);;
gap> SetConjugate(coll, 3, 2, F.3*F.7);;
gap> SetConjugate(coll, 4, 3, F.4*F.10);;
gap> UpdatePolycyclicCollector(coll);;
gap> G := GroupByRws(coll);