| order | 1024 |
| nilpotency class | 2 |
| automorphism | ? |
| homology | Abelianization (H1) = C26 · Schur multiplier (H2) = C215 |
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 | |
50005 conjugacy classes of subgroups.
| minimal degree | μ(G) = 24 |
| transitive degree | μt(G) = 128 |
A minimal faithful permutation representation — 6 generators on 24 points:
(18,19)(20,24);(9,10)(11,12)(13,16)(14,15);(5,6)(7,8)(9,11)(10,14)(12,16)(13,15)(17,18,21,19)(20,22,24,23);(2,4)(5,6,7,8)(17,19,21,18)(20,23,24,22);(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,20)(18,22)(19,23)(21,24)Polycyclic presentation:
2^10|c^2=j,d^2=hj,c^a=cj,c^b=cg,d^a=dj,d^c=dh,f^a=fj,f^b=fg,f^d=fhi,f^e=fg172 conjugacy classes — view the full character table.
| maximal subgroup of | #72332480 |
| maximal normal subgroup of | #72332480 |
| maximal quotient of | #72333253, #72336422 |
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, 3, F.10);;
gap> SetPower(coll, 4, F.8*F.10);;
gap> SetConjugate(coll, 3, 1, F.3*F.10);;
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.8);;
gap> SetConjugate(coll, 6, 1, F.6*F.10);;
gap> SetConjugate(coll, 6, 2, F.6*F.7);;
gap> SetConjugate(coll, 6, 4, F.6*F.8*F.9);;
gap> SetConjugate(coll, 6, 5, F.6*F.7);;
gap> UpdatePolycyclicCollector(coll);;
gap> G := GroupByRws(coll);