| order | 1024 |
| nilpotency class | 6 |
| automorphism | ? |
| homology | Abelianization (H1) = C23 · Schur multiplier (H2) = C23 |
No aliases for this group.
| subgroup | G/H | |
|---|---|---|
| center, socle | C2 | #151366 |
| commutator, Frattini, cosocle | #1781 | C23 |
| prime radical | #245282 | C2 |
| LCS | G ▷ #1781 ▷ C25 ▷ C23 ▷ C22 ▷ C2 ▷ C1 | |
| UCS | C1 ◁ C2 ◁ C22 ◁ C24 ◁ C25 ◁ #1781 ◁ G | |
| LECS | G ▷ #1781 ▷ C25 ▷ C23 ▷ C22 ▷ C2 ▷ C1 | |
1082 conjugacy classes of subgroups; only the 39 normal subgroups are shown.
This group has 1082 conjugacy classes of subgroups — too many to draw. Only its 39 normal subgroups are shown.
Dotted edges: containments with no intermediate normal subgroup — omitted non-normal subgroups may lie between.
| minimal degree | μ(G) = 32 |
| transitive degree | μt(G) = 32 |
A minimal faithful permutation representation — 3 generators on 32 points:
(1,2)(3,7)(4,15)(5,9)(6,11)(8,16)(10,14)(12,28)(13,22)(17,25)(18,31)(19,23)(20,26)(21,29)(24,32)(27,30);(1,3)(2,7)(4,16,19,32)(5,17)(6,14)(8,23,24,15)(9,25)(10,11)(12,29)(13,20)(18,30)(21,31)(22,26)(27,28);(1,4,17,29,6,19,13,30)(2,8,22,31,11,24,25,28)(3,12,5,16)(7,21,26,23)(9,15,10,27)(14,18,20,32)Polycyclic presentation:
2^10|b^2=fi,c^2=defghi,e^2=gj,b^a=bfj,c^a=cd,c^b=cdegj,d^b=df,d^c=dfij,e^a=ef,e^b=efg,e^c=efh,e^d=eh,f^c=fh,f^e=fij,g^a=gij,g^b=gij,g^c=gi,g^d=gj,h^b=hi,h^c=hij,h^e=hj,i^c=ij34 conjugacy classes — view the full character table.
| maximal subgroup of | #72286122, #72341248 |
| maximal normal subgroup of | #72286122, #72341248 |
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.6*F.9);;
gap> SetPower(coll, 3, F.4*F.5*F.6*F.7*F.8*F.9);;
gap> SetPower(coll, 5, F.7*F.10);;
gap> SetConjugate(coll, 2, 1, F.2*F.6*F.10);;
gap> SetConjugate(coll, 3, 1, F.3*F.4);;
gap> SetConjugate(coll, 3, 2, F.3*F.4*F.5*F.7*F.10);;
gap> SetConjugate(coll, 4, 2, F.4*F.6);;
gap> SetConjugate(coll, 4, 3, F.4*F.6*F.9*F.10);;
gap> SetConjugate(coll, 5, 1, F.5*F.6);;
gap> SetConjugate(coll, 5, 2, F.5*F.6*F.7);;
gap> SetConjugate(coll, 5, 3, F.5*F.6*F.8);;
gap> SetConjugate(coll, 5, 4, F.5*F.8);;
gap> SetConjugate(coll, 6, 3, F.6*F.8);;
gap> SetConjugate(coll, 6, 5, F.6*F.9*F.10);;
gap> SetConjugate(coll, 7, 1, F.7*F.9*F.10);;
gap> SetConjugate(coll, 7, 2, F.7*F.9*F.10);;
gap> SetConjugate(coll, 7, 3, F.7*F.9);;
gap> SetConjugate(coll, 7, 4, F.7*F.10);;
gap> SetConjugate(coll, 8, 2, F.8*F.9);;
gap> SetConjugate(coll, 8, 3, F.8*F.9*F.10);;
gap> SetConjugate(coll, 8, 5, F.8*F.10);;
gap> SetConjugate(coll, 9, 3, F.9*F.10);;
gap> UpdatePolycyclicCollector(coll);;
gap> G := GroupByRws(coll);