| order | 1024 |
| nilpotency class | 2 |
| automorphism | ? |
| homology | Abelianization (H1) = C25×C4 · Schur multiplier (H2) = C215 |
No aliases for this group.
| subgroup | G/H | |
|---|---|---|
| center, Frattini, socle, cosocle | C24 | C26 |
| commutator | C23 | C25×C4 |
| prime radical | C23×#534 | C2 |
| LCS | G ▷ C23 ▷ C1 | |
| UCS | C1 ◁ C24 ◁ G | |
| LECS | G ▷ C24 ▷ C1 | |
57269 conjugacy classes of subgroups.
| minimal degree | μ(G) = 24 |
| transitive degree | μt(G) = 128 |
A minimal faithful permutation representation — 6 generators on 24 points:
(18,21)(22,24);(9,10)(11,12)(13,16)(14,15);(9,11)(10,14)(12,16)(13,15)(18,21)(19,23);(2,4)(5,6,7,8)(17,18)(19,22)(20,21)(23,24);(9,11)(10,12)(13,15)(14,16);(1,2)(3,4)(5,6)(7,8)(9,12)(10,15)(11,16)(13,14)(17,19)(18,22)(20,23)(21,24)Polycyclic presentation:
2^10|d^2=h,c^b=cg,d^a=dj,d^c=dj,f^b=fg,f^c=fj,f^d=fi,f^e=fg196 conjugacy classes — view the full character table.
| maximal subgroup of | #72332480 |
| maximal normal subgroup of | #72332480 |
| maximal quotient of | #72333209, #72336499 |
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.8);;
gap> SetConjugate(coll, 3, 2, F.3*F.7);;
gap> SetConjugate(coll, 4, 1, F.4*F.10);;
gap> SetConjugate(coll, 4, 3, F.4*F.10);;
gap> SetConjugate(coll, 6, 2, F.6*F.7);;
gap> SetConjugate(coll, 6, 3, F.6*F.10);;
gap> SetConjugate(coll, 6, 4, F.6*F.9);;
gap> SetConjugate(coll, 6, 5, F.6*F.7);;
gap> UpdatePolycyclicCollector(coll);;
gap> G := GroupByRws(coll);