| order | 1024 |
| nilpotency class | 4 |
| automorphism | ? |
| homology | Abelianization (H1) = C25 · Schur multiplier (H2) = C212 |
No aliases for this group.
| subgroup | G/H | |
|---|---|---|
| center, socle | C2 | #6628896 |
| commutator, Frattini, cosocle | C2×#41 | C25 |
| LCS | G ▷ C2×#41 ▷ C22 ▷ C2 ▷ C1 | |
| UCS | C1 ◁ C2 ◁ C2×C4 ◁ #3498 ◁ G | |
| LECS | G ▷ C2×#41 ▷ C22 ▷ C2 ▷ C1 | |
21878 conjugacy classes of subgroups.
| minimal degree | μ(G) = 16 |
| transitive degree | μt(G) = 16 |
A minimal faithful permutation representation — 5 generators on 16 points:
(2,7,9,12)(8,14,16,15);(4,11)(10,13);(2,8)(3,5)(7,14)(9,16)(10,13)(12,15);(1,2,6,9)(3,7,5,12)(4,8,11,16)(10,15,13,14);(1,3)(2,7)(4,10)(5,6)(8,15)(9,12)(11,13)(14,16)Polycyclic presentation:
2^10|a^2=i,d^2=j,h^2=j,d^a=dh,d^b=dg,d^c=df,e^a=ei,e^c=ej,f^a=fi,f^b=fij,g^c=gi,g^f=gj,h^c=hij,h^d=hj,h^e=hj,h^f=hj,i^d=ij100 conjugacy classes — view the full character table.
| maximal subgroup of | #72258964 |
| maximal normal subgroup of | #72258964 |
| maximal quotient of | #72234104, #72260982, #72261081, … |
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.9);;
gap> SetPower(coll, 4, F.10);;
gap> SetPower(coll, 8, F.10);;
gap> SetConjugate(coll, 4, 1, F.4*F.8);;
gap> SetConjugate(coll, 4, 2, F.4*F.7);;
gap> SetConjugate(coll, 4, 3, F.4*F.6);;
gap> SetConjugate(coll, 5, 1, F.5*F.9);;
gap> SetConjugate(coll, 5, 3, F.5*F.10);;
gap> SetConjugate(coll, 6, 1, F.6*F.9);;
gap> SetConjugate(coll, 6, 2, F.6*F.9*F.10);;
gap> SetConjugate(coll, 7, 3, F.7*F.9);;
gap> SetConjugate(coll, 7, 6, F.7*F.10);;
gap> SetConjugate(coll, 8, 3, F.8*F.9*F.10);;
gap> SetConjugate(coll, 8, 4, F.8*F.10);;
gap> SetConjugate(coll, 8, 5, F.8*F.10);;
gap> SetConjugate(coll, 8, 6, F.8*F.10);;
gap> SetConjugate(coll, 9, 4, F.9*F.10);;
gap> UpdatePolycyclicCollector(coll);;
gap> G := GroupByRws(coll);