| order | 1024 |
| nilpotency class | 2 |
| automorphism | ? |
| homology | Abelianization (H1) = C26 · Schur multiplier (H2) = C214×C4 |
No aliases for this group.
| subgroup | G/H | |
|---|---|---|
| center, commutator, Frattini, socle, cosocle | C24 | C26 |
| LCS | G ▷ C24 ▷ C1 | |
| UCS | C1 ◁ C24 ◁ G | |
| LECS | G ▷ C24 ▷ C1 | |
83713 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)(10,12)(13,14)(15,19)(16,17)(18,20);(2,4)(6,8)(10,12)(14,16)(18,19);(6,8);(15,20)(18,19);(5,6)(7,8)(9,10)(11,12)(13,15,17,20)(14,18,16,19);(1,2,3,4)(13,16,17,14)(15,19,20,18)Polycyclic presentation:
2^10|e^2=g,f^2=j,b^a=bg,e^a=egh,e^b=ei,e^c=ehi,e^d=eg,f^a=fj,f^b=fj184 conjugacy classes — view the full character table.
| maximal subgroup of | #72305100, #72305143 |
| maximal normal subgroup of | #72305100, #72305143 |
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.7);;
gap> SetPower(coll, 6, F.10);;
gap> SetConjugate(coll, 2, 1, F.2*F.7);;
gap> SetConjugate(coll, 5, 1, F.5*F.7*F.8);;
gap> SetConjugate(coll, 5, 2, F.5*F.9);;
gap> SetConjugate(coll, 5, 3, F.5*F.8*F.9);;
gap> SetConjugate(coll, 5, 4, F.5*F.7);;
gap> SetConjugate(coll, 6, 1, F.6*F.10);;
gap> SetConjugate(coll, 6, 2, F.6*F.10);;
gap> UpdatePolycyclicCollector(coll);;
gap> G := GroupByRws(coll);