| order | 1024 |
| nilpotency class | 3 |
| automorphism | ? |
| homology | Abelianization (H1) = C22×C42 · Schur multiplier (H2) = C26×C4 |
No aliases for this group.
| subgroup | G/H | |
|---|---|---|
| center, socle | C24 | C2×#120 |
| commutator | C42 | C22×C42 |
| Frattini, cosocle | C22×C42 | C24 |
| prime radical | C22×#127 | C23 |
| LCS | G ▷ C42 ▷ C22 ▷ C1 | |
| UCS | C1 ◁ C24 ◁ C2×C43 ◁ G | |
| LECS | G ▷ C22×C42 ▷ C22 ▷ C1 | |
4073 conjugacy classes of subgroups.
| minimal degree | μ(G) = 24 |
| transitive degree | μt(G) = 512 |
A minimal faithful permutation representation — 4 generators on 24 points:
(1,2,4,3)(5,6,7,8)(18,22)(19,20)(23,24);(9,10)(11,15)(12,16)(13,14)(18,23)(19,20)(22,24);(10,14)(11,13)(15,16)(17,18,20,22,21,24,19,23);(1,3,4,2)(9,11,12,13)(10,15,16,14)Polycyclic presentation:
2^10|a^2=e,c^2=h,d^2=ef,g^2=i,h^2=j,c^a=ch,c^b=cg,d^c=dij,g^a=gj,g^b=gi,g^c=gij,h^a=hj,h^b=hj172 conjugacy classes — view the full character table.
| maximal subgroup of | #72279644 |
| maximal normal subgroup of | #72279644 |
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.5);;
gap> SetPower(coll, 3, F.8);;
gap> SetPower(coll, 4, F.5*F.6);;
gap> SetPower(coll, 7, F.9);;
gap> SetPower(coll, 8, F.10);;
gap> SetConjugate(coll, 3, 1, F.3*F.8);;
gap> SetConjugate(coll, 3, 2, F.3*F.7);;
gap> SetConjugate(coll, 4, 3, F.4*F.9*F.10);;
gap> SetConjugate(coll, 7, 1, F.7*F.10);;
gap> SetConjugate(coll, 7, 2, F.7*F.9);;
gap> SetConjugate(coll, 7, 3, F.7*F.9*F.10);;
gap> SetConjugate(coll, 8, 1, F.8*F.10);;
gap> SetConjugate(coll, 8, 2, F.8*F.10);;
gap> UpdatePolycyclicCollector(coll);;
gap> G := GroupByRws(coll);