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