| order | 1024 |
| nilpotency class | 6 |
| automorphism | ? |
| homology | Abelianization (H1) = C2×C42 · Schur multiplier (H2) = C24 |
No aliases for this group.
| subgroup | G/H | |
|---|---|---|
| center, socle | C2 | C2×#7493 |
| commutator | C4⋊Q8 | C2×C42 |
| Frattini, cosocle | #3151 | C23 |
| prime radical | C2×#3151 | C22 |
| LCS | G ▷ C4⋊Q8 ▷ C42 ▷ C2×C4 ▷ C22 ▷ C2 ▷ C1 | |
| UCS | C1 ◁ C2 ◁ C23 ◁ C23×C4 ◁ C22×C42 ◁ C2×#3151 ◁ G | |
| LECS | G ▷ #3151 ▷ C42 ▷ C2×C4 ▷ C22 ▷ C2 ▷ C1 | |
1053 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)(3,14,15,29)(4,20,21,28)(5,11,22,12)(6,13,7,24)(8,10)(9,16,25,32)(17,31)(18,26,19,30)(23,27);(1,3,8,19)(2,9,13,31,10,25,24,27)(4,17)(5,23)(6,15,7,18)(11,29,12,30,20,26,28,14)(16,21)(22,32);(2,10)(4,5)(13,24)(14,30)(16,32)(17,23)(21,22)(26,29)Polycyclic presentation:
2^10|a^2=d,b^2=defh,e^2=j,f^2=hj,g^2=ij,h^2=j,b^a=be,c^a=cj,c^b=ci,d^b=dg,e^a=egi,e^b=ehij,e^c=ej,e^d=ehi,f^a=fgh,f^b=fgh,f^c=fj,f^d=fh,f^e=fhj,g^a=gh,g^b=gj,g^d=gij,g^e=gij,h^a=hi,h^b=hi,h^d=hj,h^e=hj,i^a=ij58 conjugacy classes — view the full character table.
| maximal subgroup of | #72286650, #72286664, #72286909 |
| maximal normal subgroup of | #72286650, #72286664, #72286909 |
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.4);;
gap> SetPower(coll, 2, F.4*F.5*F.6*F.8);;
gap> SetPower(coll, 5, F.10);;
gap> SetPower(coll, 6, F.8*F.10);;
gap> SetPower(coll, 7, F.9*F.10);;
gap> SetPower(coll, 8, F.10);;
gap> SetConjugate(coll, 2, 1, F.2*F.5);;
gap> SetConjugate(coll, 3, 1, F.3*F.10);;
gap> SetConjugate(coll, 3, 2, F.3*F.9);;
gap> SetConjugate(coll, 4, 2, F.4*F.7);;
gap> SetConjugate(coll, 5, 1, F.5*F.7*F.9);;
gap> SetConjugate(coll, 5, 2, F.5*F.8*F.9*F.10);;
gap> SetConjugate(coll, 5, 3, F.5*F.10);;
gap> SetConjugate(coll, 5, 4, F.5*F.8*F.9);;
gap> SetConjugate(coll, 6, 1, F.6*F.7*F.8);;
gap> SetConjugate(coll, 6, 2, F.6*F.7*F.8);;
gap> SetConjugate(coll, 6, 3, F.6*F.10);;
gap> SetConjugate(coll, 6, 4, F.6*F.8);;
gap> SetConjugate(coll, 6, 5, F.6*F.8*F.10);;
gap> SetConjugate(coll, 7, 1, F.7*F.8);;
gap> SetConjugate(coll, 7, 2, F.7*F.10);;
gap> SetConjugate(coll, 7, 4, F.7*F.9*F.10);;
gap> SetConjugate(coll, 7, 5, F.7*F.9*F.10);;
gap> SetConjugate(coll, 8, 1, F.8*F.9);;
gap> SetConjugate(coll, 8, 2, F.8*F.9);;
gap> SetConjugate(coll, 8, 4, F.8*F.10);;
gap> SetConjugate(coll, 8, 5, F.8*F.10);;
gap> SetConjugate(coll, 9, 1, F.9*F.10);;
gap> UpdatePolycyclicCollector(coll);;
gap> G := GroupByRws(coll);