| order | 1024 |
| nilpotency class | 4 |
| automorphism | ? |
| homology | Abelianization (H1) = C2×C42 · Schur multiplier (H2) = C27 |
No aliases for this group.
| subgroup | G/H | |
|---|---|---|
| center, socle | C22 | #9495 |
| commutator | C22×D4 | C2×C42 |
| Frattini, cosocle | C24×D4 | C23 |
| prime radical | C2×#3484 | C22 |
| LCS | G ▷ C22×D4 ▷ C23 ▷ C2 ▷ C1 | |
| UCS | C1 ◁ C22 ◁ C24 ◁ C24×D4 ◁ G | |
| LECS | G ▷ C24×D4 ▷ C23 ▷ C2 ▷ C1 | |
3853 conjugacy classes of subgroups.
| minimal degree | μ(G) = 20 |
| transitive degree | μt(G) = 32 |
A minimal faithful permutation representation — 3 generators on 20 points:
(1,2)(3,4)(5,6,9,13,10,14,8,11)(7,12,16,19,17,20,15,18);(2,4)(6,11,14,13)(12,19)(15,16)(18,20);(5,7)(6,12)(8,15)(9,16)(10,17)(11,18)(13,19)(14,20)Polycyclic presentation:
2^10|a^2=e,b^2=degj,d^2=j,e^2=j,b^a=bd,c^b=cf,d^a=dh,d^b=dhj,d^c=di,e^b=ehj,f^a=fij,f^b=fi,f^d=fj,f^e=fj,h^c=hj,i^a=ij82 conjugacy classes — view the full character table.
| maximal subgroup of | #72310367, #72310373, #72310377, … |
| maximal normal subgroup of | #72310367, #72310373, #72310377, … |
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.5);;
gap> SetPower(coll, 2, F.4*F.5*F.7*F.10);;
gap> SetPower(coll, 4, F.10);;
gap> SetPower(coll, 5, F.10);;
gap> SetConjugate(coll, 2, 1, F.2*F.4);;
gap> SetConjugate(coll, 3, 2, F.3*F.6);;
gap> SetConjugate(coll, 4, 1, F.4*F.8);;
gap> SetConjugate(coll, 4, 2, F.4*F.8*F.10);;
gap> SetConjugate(coll, 4, 3, F.4*F.9);;
gap> SetConjugate(coll, 5, 2, F.5*F.8*F.10);;
gap> SetConjugate(coll, 6, 1, F.6*F.9*F.10);;
gap> SetConjugate(coll, 6, 2, F.6*F.9);;
gap> SetConjugate(coll, 6, 4, F.6*F.10);;
gap> SetConjugate(coll, 6, 5, F.6*F.10);;
gap> SetConjugate(coll, 8, 3, F.8*F.10);;
gap> SetConjugate(coll, 9, 1, F.9*F.10);;
gap> UpdatePolycyclicCollector(coll);;
gap> G := GroupByRws(coll);