| order | 1024 |
| nilpotency class | 2 |
| automorphism | ? |
| homology | Abelianization (H1) = C25 · Schur multiplier (H2) = C28×C43 |
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 | |
25857 conjugacy classes of subgroups.
| minimal degree | μ(G) = 24 |
| transitive degree | μt(G) = 512 |
A minimal faithful permutation representation — 5 generators on 24 points:
(2,4)(5,6)(7,8)(14,16)(18,21)(22,24);(1,2,3,4)(5,6,8,7)(10,11)(13,14)(15,16)(18,21)(19,23);(1,2)(3,4)(5,6)(7,8)(19,23)(22,24);(6,7)(9,10,12,11)(17,18,20,21)(19,22,23,24);(1,2)(3,4)(5,7,8,6)(9,11,12,10)(17,19,20,23)(18,22,21,24)Polycyclic presentation:
2^10|b^2=fg,d^2=hj,e^2=gj,b^a=bf,c^a=cfh,c^b=cfg,d^a=dgi,d^b=dgj,d^c=dgh,e^a=efg,e^b=efj,e^c=egi,e^d=egh148 conjugacy classes — view the full character table.
| maximal subgroup of | #72298586, #72298593, #72298603 |
| maximal normal subgroup of | #72298586, #72298593, #72298603 |
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.6*F.7);;
gap> SetPower(coll, 4, F.8*F.10);;
gap> SetPower(coll, 5, F.7*F.10);;
gap> SetConjugate(coll, 2, 1, F.2*F.6);;
gap> SetConjugate(coll, 3, 1, F.3*F.6*F.8);;
gap> SetConjugate(coll, 3, 2, F.3*F.6*F.7);;
gap> SetConjugate(coll, 4, 1, F.4*F.7*F.9);;
gap> SetConjugate(coll, 4, 2, F.4*F.7*F.10);;
gap> SetConjugate(coll, 4, 3, F.4*F.7*F.8);;
gap> SetConjugate(coll, 5, 1, F.5*F.6*F.7);;
gap> SetConjugate(coll, 5, 2, F.5*F.6*F.10);;
gap> SetConjugate(coll, 5, 3, F.5*F.7*F.9);;
gap> SetConjugate(coll, 5, 4, F.5*F.7*F.8);;
gap> UpdatePolycyclicCollector(coll);;
gap> G := GroupByRws(coll);