Finite Group DatabasebetaFinite Group Databasebeta| order | 1024 |
| nilpotency class | 2 |
| automorphism | ? |
| homology | Abelianization (H1) = C24×C4 · Schur multiplier (H2) = C210×C4 |
No aliases for this group.
| subgroup | G/H | |
|---|---|---|
| center, Frattini, socle, cosocle | C25 | C25 |
| commutator | C24 | C24×C4 |
| prime radical | C2×#16249 | C2 |
| LCS | G ▷ C24 ▷ C1 | |
| UCS | C1 ◁ C25 ◁ G | |
| LECS | G ▷ C25 ▷ C1 | |
28109 conjugacy classes of subgroups.
| minimal degree | μ(G) = 20 |
| transitive degree | μt(G) = 256 |
A minimal faithful permutation representation — 5 generators on 20 points:
(5,6)(7,8)(14,16)(18,20);(13,14)(15,16)(17,18)(19,20);(6,7)(10,12)(14,16);(9,10)(11,12)(13,14)(15,16);(1,2,3,4)(5,7,8,6)Polycyclic presentation:
2^10|e^2=f,b^a=bj,c^a=ch,c^b=cg,d^a=dg,d^c=di,e^a=eh,e^c=eh184 conjugacy classes — view the full character table.
| maximal subgroup of | #72299691 |
| maximal normal subgroup of | #72299691 |
| maximal quotient of | #72299927 |
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, 5, F.6);;
gap> SetConjugate(coll, 2, 1, F.2*F.10);;
gap> SetConjugate(coll, 3, 1, F.3*F.8);;
gap> SetConjugate(coll, 3, 2, F.3*F.7);;
gap> SetConjugate(coll, 4, 1, F.4*F.7);;
gap> SetConjugate(coll, 4, 3, F.4*F.9);;
gap> SetConjugate(coll, 5, 1, F.5*F.8);;
gap> SetConjugate(coll, 5, 3, F.5*F.8);;
gap> UpdatePolycyclicCollector(coll);;
gap> G := GroupByRws(coll);