| order | 1024 |
| nilpotency class | 3 |
| automorphism | ? |
| homology | Abelianization (H1) = C25 · Schur multiplier (H2) = C24×C42 |
No aliases for this group.
| subgroup | G/H | |
|---|---|---|
| center, socle | C22 | #48088 |
| commutator, Frattini, cosocle | C23×C4 | C25 |
| LCS | G ▷ C23×C4 ▷ C2 ▷ C1 | |
| UCS | C1 ◁ C22 ◁ C23×C4 ◁ G | |
| LECS | G ▷ C23×C4 ▷ C2 ▷ C1 | |
4501 conjugacy classes of subgroups.
| minimal degree | μ(G) = 24 |
| transitive degree | μt(G) = 32 |
A minimal faithful permutation representation — 5 generators on 24 points:
(11,18,20,21)(14,23,19,24);(1,2)(3,5)(4,6)(7,8)(9,10)(11,19,20,14)(12,16)(13,17)(15,22)(18,24,21,23);(1,3)(2,5)(4,7)(6,8)(9,11)(10,14)(12,21)(13,20)(15,23)(16,24)(17,19)(18,22);(2,6)(3,7)(10,15,17,16)(11,20)(14,23,19,24)(18,21);(2,6)(5,8)(12,22)(15,16)(18,21)(23,24)Polycyclic presentation:
2^10|a^2=g,b^2=g,d^2=i,f^2=j,c^a=cf,c^b=ci,d^b=dfh,d^c=dh,e^a=eg,e^b=ehij,e^d=ei,f^c=fj,f^e=fj,g^c=gj,h^b=hj,i^b=ij76 conjugacy classes — view the full character table.
| maximal subgroup of | #72339044, #72339056, #72339059, … |
| maximal normal subgroup of | #72339044, #72339056, #72339059, … |
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.7);;
gap> SetPower(coll, 2, F.7);;
gap> SetPower(coll, 4, F.9);;
gap> SetPower(coll, 6, F.10);;
gap> SetConjugate(coll, 3, 1, F.3*F.6);;
gap> SetConjugate(coll, 3, 2, F.3*F.9);;
gap> SetConjugate(coll, 4, 2, F.4*F.6*F.8);;
gap> SetConjugate(coll, 4, 3, F.4*F.8);;
gap> SetConjugate(coll, 5, 1, F.5*F.7);;
gap> SetConjugate(coll, 5, 2, F.5*F.8*F.9*F.10);;
gap> SetConjugate(coll, 5, 4, F.5*F.9);;
gap> SetConjugate(coll, 6, 3, F.6*F.10);;
gap> SetConjugate(coll, 6, 5, F.6*F.10);;
gap> SetConjugate(coll, 7, 3, F.7*F.10);;
gap> SetConjugate(coll, 8, 2, F.8*F.10);;
gap> SetConjugate(coll, 9, 2, F.9*F.10);;
gap> UpdatePolycyclicCollector(coll);;
gap> G := GroupByRws(coll);