| order | 1024 |
| nilpotency class | 2 |
| automorphism | ? |
| homology | Abelianization (H1) = C25 · Schur multiplier (H2) = C210×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 | |
At least 8409 conjugacy classes of subgroups; only the 1121 normal subgroups are shown.
| minimal degree | μ(G) = 24 |
| transitive degree | μt(G) = 256 |
A minimal faithful permutation representation — 5 generators on 24 points:
(9,10)(11,12)(14,16);(5,6)(7,8)(13,14)(15,16)(19,23)(22,24);(6,7)(10,11)(18,21)(19,23);(2,4)(9,11,12,10)(17,18,20,21)(19,24,23,22);(1,2)(3,4)(5,7,8,6)(17,19,20,23)(18,22,21,24)Polycyclic presentation:
2^10|d^2=fh,e^2=hi,b^a=bj,c^a=ci,c^b=cf,d^a=di,d^c=dfh,e^b=ehi,e^c=ehi,e^d=efg136 conjugacy classes — view the full character table.
| maximal subgroup of | #72331237, #72331252, #72331636 |
| maximal normal subgroup of | #72331237, #72331252, #72331636 |
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.6*F.8);;
gap> SetPower(coll, 5, F.8*F.9);;
gap> SetConjugate(coll, 2, 1, F.2*F.10);;
gap> SetConjugate(coll, 3, 1, F.3*F.9);;
gap> SetConjugate(coll, 3, 2, F.3*F.6);;
gap> SetConjugate(coll, 4, 1, F.4*F.9);;
gap> SetConjugate(coll, 4, 3, F.4*F.6*F.8);;
gap> SetConjugate(coll, 5, 2, F.5*F.8*F.9);;
gap> SetConjugate(coll, 5, 3, F.5*F.8*F.9);;
gap> SetConjugate(coll, 5, 4, F.5*F.6*F.7);;
gap> UpdatePolycyclicCollector(coll);;
gap> G := GroupByRws(coll);