| order | 1024 |
| nilpotency class | 2 |
| automorphism | ? |
| homology | Abelianization (H1) = C27 · Schur multiplier (H2) = C218 |
No aliases for this group.
| subgroup | G/H | |
|---|---|---|
| center, commutator, Frattini, socle, cosocle | C23 | C27 |
| prime radical | C23×#120 | C22 |
| LCS | G ▷ C23 ▷ C1 | |
| UCS | C1 ◁ C23 ◁ G | |
| LECS | G ▷ C23 ▷ C1 | |
60705 conjugacy classes of subgroups.
| minimal degree | μ(G) = 24 |
| transitive degree | μt(G) = 64 |
A minimal faithful permutation representation — 7 generators on 24 points:
(17,18,21,19)(20,23,24,22);(3,7)(6,8)(10,13)(11,15);(3,7)(6,8);(2,5)(6,8)(10,13)(14,16)(17,19,21,18)(20,22,24,23);(3,7)(6,8)(11,15)(14,16);(1,2,4,5)(3,6,7,8)(9,10)(11,14)(12,13)(15,16);(1,3)(2,6)(4,7)(5,8)(9,11)(10,14)(12,15)(13,16)(17,20,21,24)(18,22,19,23)Polycyclic presentation:
2^10|a^2=h,d^2=h,f^2=ij,g^2=h,f^b=fhi,f^d=fhj,g^a=gh,g^b=ghj,g^c=gij,g^d=gh,g^e=ghj208 conjugacy classes — view the full character table.
| maximal subgroup of | #72342291 |
| maximal normal subgroup of | #72342291 |
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.8);;
gap> SetPower(coll, 4, F.8);;
gap> SetPower(coll, 6, F.9*F.10);;
gap> SetPower(coll, 7, F.8);;
gap> SetConjugate(coll, 6, 2, F.6*F.8*F.9);;
gap> SetConjugate(coll, 6, 4, F.6*F.8*F.10);;
gap> SetConjugate(coll, 7, 1, F.7*F.8);;
gap> SetConjugate(coll, 7, 2, F.7*F.8*F.10);;
gap> SetConjugate(coll, 7, 3, F.7*F.9*F.10);;
gap> SetConjugate(coll, 7, 4, F.7*F.8);;
gap> SetConjugate(coll, 7, 5, F.7*F.8*F.10);;
gap> UpdatePolycyclicCollector(coll);;
gap> G := GroupByRws(coll);