| order | 1024 |
| nilpotency class | 2 |
| automorphism | ? |
| homology | Abelianization (H1) = C26 · Schur multiplier (H2) = C212×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 | |
At least 7249 conjugacy classes of subgroups; only the 3689 normal subgroups are shown.
| minimal degree | μ(G) = 24 |
| transitive degree | μt(G) = 128 |
A minimal faithful permutation representation — 6 generators on 24 points:
(6,8)(9,10)(11,15)(12,14)(13,16)(19,23)(22,24);(2,4)(6,8)(9,10,12,14)(11,15,16,13);(9,10)(11,13)(12,14)(15,16)(18,21)(22,24);(2,4)(9,10,12,14)(11,13,16,15)(17,18)(19,24)(20,21)(22,23);(5,6)(7,8)(9,11)(10,13)(12,16)(14,15)(17,19)(18,22)(20,23)(21,24);(1,2)(3,4)(5,6)(7,8)(9,10)(11,13)(12,14)(15,16)(17,19)(18,22)(20,23)(21,24)Polycyclic presentation:
2^10|b^2=g,d^2=g,b^a=bg,c^b=cg,d^a=dg,d^c=dgj,e^a=ei,e^b=eij,e^d=ej,f^a=fgi,f^b=fgh,f^d=fhi136 conjugacy classes — view the full character table.
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.7);;
gap> SetPower(coll, 4, F.7);;
gap> SetConjugate(coll, 2, 1, F.2*F.7);;
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.7*F.10);;
gap> SetConjugate(coll, 5, 1, F.5*F.9);;
gap> SetConjugate(coll, 5, 2, F.5*F.9*F.10);;
gap> SetConjugate(coll, 5, 4, F.5*F.10);;
gap> SetConjugate(coll, 6, 1, F.6*F.7*F.9);;
gap> SetConjugate(coll, 6, 2, F.6*F.7*F.8);;
gap> SetConjugate(coll, 6, 4, F.6*F.8*F.9);;
gap> UpdatePolycyclicCollector(coll);;
gap> G := GroupByRws(coll);