| order | 1024 |
| nilpotency class | 3 |
| automorphism | ? |
| homology | Abelianization (H1) = C26 · Schur multiplier (H2) = C213×C4 |
No aliases for this group.
| subgroup | G/H | |
|---|---|---|
| center, socle | C22 | C23×#120 |
| commutator, Frattini, cosocle | C22×C4 | C26 |
| LCS | G ▷ C22×C4 ▷ C2 ▷ C1 | |
| UCS | C1 ◁ C22 ◁ C23×C42 ◁ G | |
| LECS | G ▷ C22×C4 ▷ C2 ▷ C1 | |
30873 conjugacy classes of subgroups.
| minimal degree | μ(G) = 24 |
| transitive degree | μt(G) = 64 |
A minimal faithful permutation representation — 6 generators on 24 points:
(9,10,13,16,14,18,12,15)(11,19,20,24,21,17,22,23);(1,2)(3,6)(4,5)(7,8)(10,15)(12,13)(16,18)(17,24)(19,23)(20,22);(2,5)(6,8)(10,16)(12,13)(15,18)(17,23)(19,24)(20,22);(1,3)(2,6)(4,7)(5,8)(9,11)(10,17)(12,20)(13,22)(14,21)(15,23)(16,24)(18,19);(3,7)(6,8);(9,12,14,13)(10,15,18,16)(11,20,21,22)(17,23,19,24)Polycyclic presentation:
2^10|a^2=i,f^2=j,i^2=j,b^a=bi,c^a=cij,c^b=cg,d^a=dh,d^b=dh,d^c=dh,e^d=eg,f^b=fj,f^c=fj,h^a=hj,i^b=ij,i^c=ij,i^d=ij136 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, 1, F.9);;
gap> SetPower(coll, 6, F.10);;
gap> SetPower(coll, 9, F.10);;
gap> SetConjugate(coll, 2, 1, F.2*F.9);;
gap> SetConjugate(coll, 3, 1, F.3*F.9*F.10);;
gap> SetConjugate(coll, 3, 2, F.3*F.7);;
gap> SetConjugate(coll, 4, 1, F.4*F.8);;
gap> SetConjugate(coll, 4, 2, F.4*F.8);;
gap> SetConjugate(coll, 4, 3, F.4*F.8);;
gap> SetConjugate(coll, 5, 4, F.5*F.7);;
gap> SetConjugate(coll, 6, 2, F.6*F.10);;
gap> SetConjugate(coll, 6, 3, F.6*F.10);;
gap> SetConjugate(coll, 8, 1, F.8*F.10);;
gap> SetConjugate(coll, 9, 2, F.9*F.10);;
gap> SetConjugate(coll, 9, 3, F.9*F.10);;
gap> SetConjugate(coll, 9, 4, F.9*F.10);;
gap> UpdatePolycyclicCollector(coll);;
gap> G := GroupByRws(coll);