| order | 1024 |
| nilpotency class | 4 |
| automorphism | ? |
| homology | Abelianization (H1) = C25 · Schur multiplier (H2) = C27×C4 |
No aliases for this group.
| subgroup | G/H | |
|---|---|---|
| center, socle | C22 | C2×#3109 |
| commutator, Frattini, cosocle | C22×C8 | C25 |
| LCS | G ▷ C22×C8 ▷ C4 ▷ C2 ▷ C1 | |
| UCS | C1 ◁ C22 ◁ C2×C42 ◁ C42×M16 ◁ G | |
| LECS | G ▷ C22×C8 ▷ C4 ▷ C2 ▷ C1 | |
3965 conjugacy classes of subgroups.
| minimal degree | μ(G) = 20 |
| transitive degree | μt(G) = 64 |
A minimal faithful permutation representation — 5 generators on 20 points:
(5,6,7,11,8,12,14,19,9,10,13,16,15,17,20,18);(6,10)(7,13)(12,17)(14,20);(2,4)(6,11,10,16)(7,14)(8,15)(12,18,17,19)(13,20);(6,12,10,17)(7,13)(11,18,16,19)(14,20);(1,2,3,4)Polycyclic presentation:
2^10|a^2=f,c^2=g,d^2=g,e^2=h,f^2=i,i^2=j,b^a=bg,c^a=cfij,c^b=cg,d^a=dij,e^c=eh,f^b=fj,f^c=fi,f^d=fj,g^a=gj,i^c=ij100 conjugacy classes — view the full character table.
| maximal quotient of | #72224854 |
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, 3, F.7);;
gap> SetPower(coll, 4, F.7);;
gap> SetPower(coll, 5, F.8);;
gap> SetPower(coll, 6, F.9);;
gap> SetPower(coll, 9, F.10);;
gap> SetConjugate(coll, 2, 1, F.2*F.7);;
gap> SetConjugate(coll, 3, 1, F.3*F.6*F.9*F.10);;
gap> SetConjugate(coll, 3, 2, F.3*F.7);;
gap> SetConjugate(coll, 4, 1, F.4*F.9*F.10);;
gap> SetConjugate(coll, 5, 3, F.5*F.8);;
gap> SetConjugate(coll, 6, 2, F.6*F.10);;
gap> SetConjugate(coll, 6, 3, F.6*F.9);;
gap> SetConjugate(coll, 6, 4, F.6*F.10);;
gap> SetConjugate(coll, 7, 1, F.7*F.10);;
gap> SetConjugate(coll, 9, 3, F.9*F.10);;
gap> UpdatePolycyclicCollector(coll);;
gap> G := GroupByRws(coll);