| order | 1024 |
| nilpotency class | 5 |
| automorphism | ? |
| homology | Abelianization (H1) = C24 · Schur multiplier (H2) = C25 |
No aliases for this group.
| subgroup | G/H | |
|---|---|---|
| center, socle | C2 | #485605 |
| commutator, Frattini, cosocle | #379 | C24 |
| prime radical | #7266798 | C2 |
| LCS | G ▷ #379 ▷ C24 ▷ C22 ▷ C2 ▷ C1 | |
| UCS | C1 ◁ C2 ◁ C23 ◁ C25 ◁ C2×#379 ◁ G | |
| LECS | G ▷ #379 ▷ C24 ▷ C22 ▷ C2 ▷ C1 | |
1970 conjugacy classes of subgroups; only the 121 normal subgroups are shown.
This group has 1970 conjugacy classes of subgroups — too many to draw. Only its 121 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 — 4 generators on 32 points:
(1,2)(3,8)(4,17)(5,12)(6,11)(7,10)(9,20)(13,26)(14,23)(15,24)(16,25)(18,31)(19,27)(21,28)(22,30)(29,32);(1,3)(2,8)(4,18)(5,16)(6,15)(7,14)(9,26)(10,23)(11,24)(12,25)(13,20)(17,31)(19,30)(21,29)(22,27)(28,32);(1,4,6,20,7,19,5,21)(2,9,11,27,10,28,12,17)(3,13,16,30)(8,22,24,32)(14,29,15,18)(23,31,25,26);(2,10)(3,14)(4,19)(5,6)(8,23)(11,12)(13,29)(15,16)(17,27)(20,21)(22,31)(26,32)Polycyclic presentation:
2^10|c^2=ehij,e^2=h,f^2=hij,c^a=ce,c^b=cf,d^a=dgi,d^b=dgj,d^c=dgj,e^a=eh,e^b=eg,e^c=ej,e^d=ei,f^a=fgij,f^b=fhij,f^c=fghi,f^d=fi,f^e=fij,g^a=gj,g^c=gi,g^e=gj,g^f=gj,h^b=hj,i^a=ij,i^b=ij,i^c=ij52 conjugacy classes — view the full character table.
| maximal subgroup of | #72285319, #72285681 |
| maximal normal subgroup of | #72285319, #72285681 |
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.8*F.9*F.10);;
gap> SetPower(coll, 5, F.8);;
gap> SetPower(coll, 6, F.8*F.9*F.10);;
gap> SetConjugate(coll, 3, 1, F.3*F.5);;
gap> SetConjugate(coll, 3, 2, F.3*F.6);;
gap> SetConjugate(coll, 4, 1, F.4*F.7*F.9);;
gap> SetConjugate(coll, 4, 2, F.4*F.7*F.10);;
gap> SetConjugate(coll, 4, 3, F.4*F.7*F.10);;
gap> SetConjugate(coll, 5, 1, F.5*F.8);;
gap> SetConjugate(coll, 5, 2, F.5*F.7);;
gap> SetConjugate(coll, 5, 3, F.5*F.10);;
gap> SetConjugate(coll, 5, 4, F.5*F.9);;
gap> SetConjugate(coll, 6, 1, F.6*F.7*F.9*F.10);;
gap> SetConjugate(coll, 6, 2, F.6*F.8*F.9*F.10);;
gap> SetConjugate(coll, 6, 3, F.6*F.7*F.8*F.9);;
gap> SetConjugate(coll, 6, 4, F.6*F.9);;
gap> SetConjugate(coll, 6, 5, F.6*F.9*F.10);;
gap> SetConjugate(coll, 7, 1, F.7*F.10);;
gap> SetConjugate(coll, 7, 3, F.7*F.9);;
gap> SetConjugate(coll, 7, 5, F.7*F.10);;
gap> SetConjugate(coll, 7, 6, F.7*F.10);;
gap> SetConjugate(coll, 8, 2, F.8*F.10);;
gap> SetConjugate(coll, 9, 1, F.9*F.10);;
gap> SetConjugate(coll, 9, 2, F.9*F.10);;
gap> SetConjugate(coll, 9, 3, F.9*F.10);;
gap> UpdatePolycyclicCollector(coll);;
gap> G := GroupByRws(coll);