| order | 1024 |
| nilpotency class | 4 |
| automorphism | ? |
| homology | Abelianization (H1) = C22×C4 · Schur multiplier (H2) = C26×C4 |
No aliases for this group.
| subgroup | G/H | |
|---|---|---|
| center, socle | C22 | #10980 |
| commutator | C24×C4 | C22×C4 |
| Frattini, cosocle | C24×D4 | C23 |
| prime radical | #649052 | C2 |
| LCS | G ▷ C24×C4 ▷ C23 ▷ C2 ▷ C1 | |
| UCS | C1 ◁ C22 ◁ C25 ◁ C2×D4×C22⋊C4 ◁ G | |
| LECS | G ▷ C24×D4 ▷ C23 ▷ C2 ▷ C1 | |
5952 conjugacy classes of subgroups.
| minimal degree | μ(G) = 16 |
| transitive degree | μt(G) = 32 |
A minimal faithful permutation representation — 3 generators on 16 points:
(1,2)(3,6)(4,8)(5,7)(9,10)(11,14,16,13)(12,15);(1,3,5,4)(2,6,7,8)(10,13,15,14);(1,4,5,3)(2,6)(7,8)Polycyclic presentation:
2^10|a^2=f,b^2=hi,c^2=deh,g^2=j,b^a=bg,c^a=cd,c^b=cde,d^b=dh,d^c=dh,e^a=eh,e^b=eh,e^c=eh,f^b=fi,g^a=gij,g^f=gj,i^a=ij76 conjugacy classes — view the full character table.
| maximal subgroup of | #72234158, #72234168 |
| maximal normal subgroup of | #72234158, #72234168 |
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.6);;
gap> SetPower(coll, 2, F.8*F.9);;
gap> SetPower(coll, 3, F.4*F.5*F.8);;
gap> SetPower(coll, 7, F.10);;
gap> SetConjugate(coll, 2, 1, F.2*F.7);;
gap> SetConjugate(coll, 3, 1, F.3*F.4);;
gap> SetConjugate(coll, 3, 2, F.3*F.4*F.5);;
gap> SetConjugate(coll, 4, 2, F.4*F.8);;
gap> SetConjugate(coll, 4, 3, F.4*F.8);;
gap> SetConjugate(coll, 5, 1, F.5*F.8);;
gap> SetConjugate(coll, 5, 2, F.5*F.8);;
gap> SetConjugate(coll, 5, 3, F.5*F.8);;
gap> SetConjugate(coll, 6, 2, F.6*F.9);;
gap> SetConjugate(coll, 7, 1, F.7*F.9*F.10);;
gap> SetConjugate(coll, 7, 6, F.7*F.10);;
gap> SetConjugate(coll, 9, 1, F.9*F.10);;
gap> UpdatePolycyclicCollector(coll);;
gap> G := GroupByRws(coll);