| order | 1024 |
| nilpotency class | 5 |
| automorphism | ? |
| homology | Abelianization (H1) = C24 · Schur multiplier (H2) = C28 |
No aliases for this group.
| subgroup | G/H | |
|---|---|---|
| center, socle | C22 | C2×#2196 |
| commutator, Frattini, cosocle | C2×#127 | C24 |
| LCS | G ▷ C2×#127 ▷ C2×C4 ▷ C22 ▷ C2 ▷ C1 | |
| UCS | C1 ◁ C22 ◁ C24 ◁ C23×C4 ◁ C22×#127 ◁ G | |
| LECS | G ▷ C2×#127 ▷ C2×C4 ▷ C22 ▷ C2 ▷ C1 | |
5013 conjugacy classes of subgroups.
| minimal degree | μ(G) = 20 |
| transitive degree | μt(G) = 32 |
A minimal faithful permutation representation — 4 generators on 20 points:
(7,13)(9,16)(10,18)(14,19)(15,17);(5,6)(7,14,15,10)(8,12)(9,11,16,20)(13,18,17,19);(1,2)(3,4);(2,4)(5,7)(6,10)(8,13)(9,17)(11,18)(12,19)(14,20)(15,16)Polycyclic presentation:
2^10|b^2=g,h^2=j,b^a=bg,d^a=df,d^b=dfj,d^c=de,f^b=fh,g^d=ghj,g^f=gij,h^a=hi,h^b=hi,h^d=hj,h^f=hj,h^g=hj,i^b=ij,i^d=ij70 conjugacy classes — view the full character table.
| maximal subgroup of | #72284608 |
| maximal normal subgroup of | #72284608 |
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, 2, F.7);;
gap> SetPower(coll, 8, F.10);;
gap> SetConjugate(coll, 2, 1, F.2*F.7);;
gap> SetConjugate(coll, 4, 1, F.4*F.6);;
gap> SetConjugate(coll, 4, 2, F.4*F.6*F.10);;
gap> SetConjugate(coll, 4, 3, F.4*F.5);;
gap> SetConjugate(coll, 6, 2, F.6*F.8);;
gap> SetConjugate(coll, 7, 4, F.7*F.8*F.10);;
gap> SetConjugate(coll, 7, 6, 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, 6, F.8*F.10);;
gap> SetConjugate(coll, 8, 7, F.8*F.10);;
gap> SetConjugate(coll, 9, 2, F.9*F.10);;
gap> SetConjugate(coll, 9, 4, F.9*F.10);;
gap> UpdatePolycyclicCollector(coll);;
gap> G := GroupByRws(coll);