| order | 1024 |
| nilpotency class | 4 |
| automorphism | ? |
| homology | Abelianization (H1) = C23×C4 · Schur multiplier (H2) = C28 |
No aliases for this group.
| subgroup | G/H | |
|---|---|---|
| center, socle | C22 | #20585 |
| commutator | C23×C4 | C23×C4 |
| Frattini, cosocle | C22×#41 | C24 |
| prime radical | #8932883 | C2 |
| LCS | G ▷ C23×C4 ▷ C23 ▷ C2 ▷ C1 | |
| UCS | C1 ◁ C22 ◁ C22×C4 ◁ #35527 ◁ G | |
| LECS | G ▷ C22×#41 ▷ C23 ▷ C2 ▷ C1 | |
5143 conjugacy classes of subgroups.
| minimal degree | μ(G) = 24 |
| transitive degree | μt(G) = 32 |
A minimal faithful permutation representation — 4 generators on 24 points:
(1,2)(3,5)(4,6)(7,8)(10,14,16,22)(15,21,17,23);(5,8)(9,10)(11,17,18,15)(12,14,20,22)(13,16)(19,23)(21,24);(1,3)(2,5)(4,7)(6,8)(10,15)(14,21)(16,17)(22,23);(11,18)(15,17)(19,24)(21,23)Polycyclic presentation:
2^10|a^2=i,b^2=g,f^2=j,b^a=bf,c^b=ce,d^c=di,e^a=eh,e^b=ei,e^d=ej,f^b=fij,f^c=fh,g^a=gi,g^c=gi,g^e=gj,g^f=gj,i^b=ij76 conjugacy classes — view the full character table.
| maximal subgroup of | #72262734 |
| maximal normal subgroup of | #72262734 |
| maximal quotient of | #72262747 |
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.9);;
gap> SetPower(coll, 2, F.7);;
gap> SetPower(coll, 6, F.10);;
gap> SetConjugate(coll, 2, 1, F.2*F.6);;
gap> SetConjugate(coll, 3, 2, F.3*F.5);;
gap> SetConjugate(coll, 4, 3, F.4*F.9);;
gap> SetConjugate(coll, 5, 1, F.5*F.8);;
gap> SetConjugate(coll, 5, 2, F.5*F.9);;
gap> SetConjugate(coll, 5, 4, F.5*F.10);;
gap> SetConjugate(coll, 6, 2, F.6*F.9*F.10);;
gap> SetConjugate(coll, 6, 3, F.6*F.8);;
gap> SetConjugate(coll, 7, 1, F.7*F.9);;
gap> SetConjugate(coll, 7, 3, F.7*F.9);;
gap> SetConjugate(coll, 7, 5, F.7*F.10);;
gap> SetConjugate(coll, 7, 6, F.7*F.10);;
gap> SetConjugate(coll, 9, 2, F.9*F.10);;
gap> UpdatePolycyclicCollector(coll);;
gap> G := GroupByRws(coll);