| order | 1024 |
| nilpotency class | 5 |
| automorphism | ? |
| homology | Abelianization (H1) = C24 · Schur multiplier (H2) = C27 |
No aliases for this group.
| subgroup | G/H | |
|---|---|---|
| center, socle | C2 | #499831 |
| commutator, Frattini, cosocle | C2×#127 | C24 |
| LCS | G ▷ C2×#127 ▷ C2×C4 ▷ C22 ▷ C2 ▷ C1 | |
| UCS | C1 ◁ C2 ◁ C23 ◁ #117 ◁ #3508 ◁ G | |
| LECS | G ▷ C2×#127 ▷ C2×C4 ▷ C22 ▷ C2 ▷ C1 | |
2452 conjugacy classes of subgroups.
| minimal degree | μ(G) = 32 |
| transitive degree | μt(G) = 32 |
A minimal faithful permutation representation — 4 generators on 32 points:
(1,2)(3,12)(4,19)(5,10)(6,11)(7,16)(8,24)(9,25)(13,29)(14,20)(15,27)(17,26)(18,28)(21,31)(22,23)(30,32);(1,2)(3,13,17,30,18,31,16,27)(4,20)(5,9)(6,11)(7,15,12,29,26,32,28,21)(8,23)(10,25)(14,19)(22,24);(1,3,14,32)(2,7,22,31)(4,21,25,16)(5,17,24,29)(6,18,23,15)(8,27,9,28)(10,12,19,30)(11,26,20,13);(1,2)(3,7)(4,22)(5,9)(6,11)(8,14)(10,25)(12,16)(13,29)(15,30)(17,28)(18,26)(19,23)(20,24)(21,31)(27,32)Polycyclic presentation:
2^10|b^2=g,c^2=eghi,f^2=j,g^2=ij,h^2=j,c^a=cf,c^b=ce,d^b=dgij,d^c=dghj,e^a=ei,e^b=eh,e^c=ehij,e^d=ehi,f^a=fj,f^b=fij,f^c=fij,f^e=fj,g^c=ghj,g^d=gij,g^e=gij,h^b=hi,h^c=hi,h^d=hj,h^e=hj,i^c=ij55 conjugacy classes — view the full character table.
| maximal subgroup of | #72339877, #72339889 |
| maximal normal subgroup of | #72339877, #72339889 |
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, 2, F.7);;
gap> SetPower(coll, 3, F.5*F.7*F.8*F.9);;
gap> SetPower(coll, 6, F.10);;
gap> SetPower(coll, 7, F.9*F.10);;
gap> SetPower(coll, 8, F.10);;
gap> SetConjugate(coll, 3, 1, F.3*F.6);;
gap> SetConjugate(coll, 3, 2, F.3*F.5);;
gap> SetConjugate(coll, 4, 2, F.4*F.7*F.9*F.10);;
gap> SetConjugate(coll, 4, 3, F.4*F.7*F.8*F.10);;
gap> SetConjugate(coll, 5, 1, F.5*F.9);;
gap> SetConjugate(coll, 5, 2, F.5*F.8);;
gap> SetConjugate(coll, 5, 3, F.5*F.8*F.9*F.10);;
gap> SetConjugate(coll, 5, 4, F.5*F.8*F.9);;
gap> SetConjugate(coll, 6, 1, F.6*F.10);;
gap> SetConjugate(coll, 6, 2, F.6*F.9*F.10);;
gap> SetConjugate(coll, 6, 3, F.6*F.9*F.10);;
gap> SetConjugate(coll, 6, 5, F.6*F.10);;
gap> SetConjugate(coll, 7, 3, F.7*F.8*F.10);;
gap> SetConjugate(coll, 7, 4, F.7*F.9*F.10);;
gap> SetConjugate(coll, 7, 5, F.7*F.9*F.10);;
gap> SetConjugate(coll, 8, 2, F.8*F.9);;
gap> SetConjugate(coll, 8, 3, F.8*F.9);;
gap> SetConjugate(coll, 8, 4, F.8*F.10);;
gap> SetConjugate(coll, 8, 5, F.8*F.10);;
gap> SetConjugate(coll, 9, 3, F.9*F.10);;
gap> UpdatePolycyclicCollector(coll);;
gap> G := GroupByRws(coll);