Finite Group DatabasebetaFinite Group Databasebeta| order | 1024 |
| nilpotency class | 2 |
| automorphism | ? |
| homology | Abelianization (H1) = C25×C4 · Schur multiplier (H2) = C215 |
No aliases for this group.
| subgroup | G/H | |
|---|---|---|
| center, Frattini, socle, cosocle | C24 | C26 |
| commutator | C23 | C25×C4 |
| prime radical | C2×#36152 | C2 |
| LCS | G ▷ C23 ▷ C1 | |
| UCS | C1 ◁ C24 ◁ G | |
| LECS | G ▷ C24 ▷ C1 | |
71053 conjugacy classes of subgroups.
| minimal degree | μ(G) = 20 |
| transitive degree | μt(G) = 128 |
A minimal faithful permutation representation — 6 generators on 20 points:
(2,4)(6,8);(2,4)(9,10,12,11)(14,17)(15,19);(6,8);(9,10,12,11)(13,14,16,17)(15,18,19,20);(1,2,3,4)(5,6,7,8)(9,11,12,10)(13,14)(15,18)(16,17)(19,20);(13,15,16,19)(14,18,17,20)Polycyclic presentation:
2^10|b^2=g,d^2=gj,e^2=gi,f^2=j,d^b=dj,e^a=ei,e^b=eh,e^c=ehij,e^d=ej,f^b=fj256 conjugacy classes — view the full character table.
| maximal subgroup of | #72308053, #72308209, #72311878, … |
| maximal normal subgroup of | #72308053, #72308209, #72311878, … |
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, 4, F.7*F.10);;
gap> SetPower(coll, 5, F.7*F.9);;
gap> SetPower(coll, 6, F.10);;
gap> SetConjugate(coll, 4, 2, F.4*F.10);;
gap> SetConjugate(coll, 5, 1, F.5*F.9);;
gap> SetConjugate(coll, 5, 2, F.5*F.8);;
gap> SetConjugate(coll, 5, 3, F.5*F.8*F.9*F.10);;
gap> SetConjugate(coll, 5, 4, F.5*F.10);;
gap> SetConjugate(coll, 6, 2, F.6*F.10);;
gap> UpdatePolycyclicCollector(coll);;
gap> G := GroupByRws(coll);