| order | 1024 |
| nilpotency class | 5 |
| automorphism | ? |
| homology | Abelianization (H1) = C2×C42 · Schur multiplier (H2) = C26 |
No aliases for this group.
| subgroup | G/H | |
|---|---|---|
| center, socle | C2 | #146566 |
| commutator | C2×#41 | C2×C42 |
| Frattini, cosocle | C2×#532 | C23 |
| prime radical | C2×#3498 | C22 |
| LCS | G ▷ C2×#41 ▷ C2×C4 ▷ C22 ▷ C2 ▷ C1 | |
| UCS | C1 ◁ C2 ◁ C22×C4 ◁ C22×#41 ◁ C2×#3498 ◁ G | |
| LECS | G ▷ C2×#532 ▷ C2×C4 ▷ C22 ▷ C2 ▷ C1 | |
3086 conjugacy classes of subgroups.
| minimal degree | μ(G) = 32 |
| transitive degree | μt(G) = 32 |
A minimal faithful permutation representation — 3 generators on 32 points:
(1,2,5,10,7,12,6,11)(3,13)(4,18,19,25,21,9,20,24)(8,17)(14,27)(15,26)(16,23)(22,29)(28,32)(30,31);(1,3)(2,8,10,23)(4,14,21,29)(5,16,6,15)(7,17)(9,22,25,31)(11,26,12,13)(18,27,24,32)(19,28)(20,30);(2,9)(5,6)(8,22)(10,25)(11,24)(12,18)(13,27)(15,16)(19,20)(23,31)(26,32)(28,30)Polycyclic presentation:
2^10|a^2=e,b^2=g,e^2=ij,h^2=j,b^a=bef,c^a=cd,d^a=dij,d^b=dij,e^b=eh,e^c=eij,f^a=fhj,f^b=fi,f^c=fj,f^d=fj,f^e=fij,g^a=ghi,g^d=gj,g^e=gij,g^f=gj,h^a=hi,h^b=hi,h^c=hj,h^f=hj,h^g=hj,i^b=ij76 conjugacy classes — view the full character table.
| maximal subgroup of | #72286647, #72286685, #72286723, … |
| maximal normal subgroup of | #72286647, #72286685, #72286723, … |
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, 1, F.5);;
gap> SetPower(coll, 2, F.7);;
gap> SetPower(coll, 5, F.9*F.10);;
gap> SetPower(coll, 8, F.10);;
gap> SetConjugate(coll, 2, 1, F.2*F.5*F.6);;
gap> SetConjugate(coll, 3, 1, F.3*F.4);;
gap> SetConjugate(coll, 4, 1, F.4*F.9*F.10);;
gap> SetConjugate(coll, 4, 2, F.4*F.9*F.10);;
gap> SetConjugate(coll, 5, 2, F.5*F.8);;
gap> SetConjugate(coll, 5, 3, F.5*F.9*F.10);;
gap> SetConjugate(coll, 6, 1, F.6*F.8*F.10);;
gap> SetConjugate(coll, 6, 2, F.6*F.9);;
gap> SetConjugate(coll, 6, 3, F.6*F.10);;
gap> SetConjugate(coll, 6, 4, F.6*F.10);;
gap> SetConjugate(coll, 6, 5, F.6*F.9*F.10);;
gap> SetConjugate(coll, 7, 1, F.7*F.8*F.9);;
gap> SetConjugate(coll, 7, 4, F.7*F.10);;
gap> SetConjugate(coll, 7, 5, F.7*F.9*F.10);;
gap> SetConjugate(coll, 7, 6, F.7*F.10);;
gap> SetConjugate(coll, 8, 1, F.8*F.9);;
gap> SetConjugate(coll, 8, 2, F.8*F.9);;
gap> SetConjugate(coll, 8, 3, F.8*F.10);;
gap> SetConjugate(coll, 8, 6, F.8*F.10);;
gap> SetConjugate(coll, 8, 7, F.8*F.10);;
gap> SetConjugate(coll, 9, 2, F.9*F.10);;
gap> UpdatePolycyclicCollector(coll);;
gap> G := GroupByRws(coll);