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