| order | 1024 |
| nilpotency class | 2 |
| automorphism | ? |
| homology | Abelianization (H1) = C26 · Schur multiplier (H2) = C213 |
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 6460 conjugacy classes of subgroups; only the 3669 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,12)(13,15)(14,16)(18,21)(19,23);(2,4)(5,6)(7,8)(9,11)(10,14)(12,15)(13,16)(18,21)(19,23);(9,12)(10,11)(13,14)(15,16)(18,21)(22,24);(2,4)(10,15)(12,14)(17,18,20,21)(19,24,23,22);(9,11)(10,12)(13,16)(14,15);(1,2)(3,4)(9,12)(10,16)(11,15)(13,14)(17,19)(18,22)(20,23)(21,24)Polycyclic presentation:
2^10|d^2=gi,b^a=bj,c^b=cg,d^a=di,d^b=dgi,d^c=di,f^a=fi,f^b=fh,f^d=fgh,f^e=fg142 conjugacy classes — view the full character table.
| maximal subgroup of | #72331439 |
| maximal normal subgroup of | #72331439 |
| maximal quotient of | #72333248 |
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.7*F.9);;
gap> SetConjugate(coll, 2, 1, F.2*F.10);;
gap> SetConjugate(coll, 3, 2, F.3*F.7);;
gap> SetConjugate(coll, 4, 1, F.4*F.9);;
gap> SetConjugate(coll, 4, 2, F.4*F.7*F.9);;
gap> SetConjugate(coll, 4, 3, F.4*F.9);;
gap> SetConjugate(coll, 6, 1, F.6*F.9);;
gap> SetConjugate(coll, 6, 2, F.6*F.8);;
gap> SetConjugate(coll, 6, 4, F.6*F.7*F.8);;
gap> SetConjugate(coll, 6, 5, F.6*F.7);;
gap> UpdatePolycyclicCollector(coll);;
gap> G := GroupByRws(coll);