| order | 1024 |
| nilpotency class | 2 |
| automorphism | ? |
| homology | Abelianization (H1) = C26 · Schur multiplier (H2) = C214 |
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 6624 conjugacy classes of subgroups; only the 3765 normal subgroups are shown.
| minimal degree | μ(G) = 24 |
| transitive degree | μt(G) = 256 |
A minimal faithful permutation representation — 6 generators on 24 points:
(6,8)(10,13)(14,16);(2,4)(6,8)(11,15)(14,16);(17,18,20,22)(19,21,23,24);(5,6,7,8)(11,15)(14,16)(17,18)(19,21)(20,22)(23,24);(9,10,12,13)(11,14,15,16)(17,19,20,23)(18,21,22,24);(1,2,3,4)(9,11,12,15)(10,14,13,16)Polycyclic presentation:
2^10|c^2=h,d^2=g,e^2=i,f^2=j,d^a=dg,d^b=dg,d^c=dh,e^a=ehi,f^b=fj,f^d=fhi166 conjugacy classes — view the full character table.
| maximal subgroup of | #72257942 |
| maximal normal subgroup of | #72257942 |
| maximal quotient of | #72264861 |
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.8);;
gap> SetPower(coll, 4, F.7);;
gap> SetPower(coll, 5, F.9);;
gap> SetPower(coll, 6, F.10);;
gap> SetConjugate(coll, 4, 1, F.4*F.7);;
gap> SetConjugate(coll, 4, 2, F.4*F.7);;
gap> SetConjugate(coll, 4, 3, F.4*F.8);;
gap> SetConjugate(coll, 5, 1, F.5*F.8*F.9);;
gap> SetConjugate(coll, 6, 2, F.6*F.10);;
gap> SetConjugate(coll, 6, 4, F.6*F.8*F.9);;
gap> UpdatePolycyclicCollector(coll);;
gap> G := GroupByRws(coll);