| order | 1024 |
| nilpotency class | 2 |
| automorphism | ? |
| homology | Abelianization (H1) = C27 · Schur multiplier (H2) = C219 |
No aliases for this group.
| subgroup | G/H | |
|---|---|---|
| center, commutator, Frattini, socle, cosocle | C23 | C27 |
| LCS | G ▷ C23 ▷ C1 | |
| UCS | C1 ◁ C23 ◁ G | |
| LECS | G ▷ C23 ▷ C1 | |
At least 15996 conjugacy classes of subgroups; only the 31863 normal subgroups are shown.
| minimal degree | μ(G) = 20 |
| transitive degree | μt(G) = 128 |
A minimal faithful permutation representation — 7 generators on 20 points:
(1,2)(3,4)(5,6)(7,8)(9,12)(10,11)(13,14)(15,18)(16,19)(17,20);(13,14,17,20)(15,16,19,18);(5,7)(6,8)(9,11)(10,12)(13,15)(14,18)(16,20)(17,19);(1,2)(3,4)(7,11)(8,10)(13,15,17,19)(14,16,20,18);(5,7)(6,10)(8,12)(9,11)(13,15)(14,16)(17,19)(18,20);(1,2,3,4)(5,8,9,10)(6,11,12,7)(13,16)(14,19)(15,20)(17,18);(1,2)(3,4)(5,6)(7,8)(9,12)(10,11)Polycyclic presentation:
2^10|b^2=i,d^2=i,f^2=h,b^a=bi,c^b=ci,d^a=di,d^c=dij,e^a=eij,e^d=eij,f^a=fh,f^d=fh,f^e=fij,g^e=gj,g^f=gh190 conjugacy classes — view the full character table.
| maximal subgroup of | #72234468, #72237405, #72256702 |
| maximal normal subgroup of | #72234468, #72237405, #72256702 |
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.9);;
gap> SetPower(coll, 4, F.9);;
gap> SetPower(coll, 6, F.8);;
gap> SetConjugate(coll, 2, 1, F.2*F.9);;
gap> SetConjugate(coll, 3, 2, F.3*F.9);;
gap> SetConjugate(coll, 4, 1, F.4*F.9);;
gap> SetConjugate(coll, 4, 3, F.4*F.9*F.10);;
gap> SetConjugate(coll, 5, 1, F.5*F.9*F.10);;
gap> SetConjugate(coll, 5, 4, F.5*F.9*F.10);;
gap> SetConjugate(coll, 6, 1, F.6*F.8);;
gap> SetConjugate(coll, 6, 4, F.6*F.8);;
gap> SetConjugate(coll, 6, 5, F.6*F.9*F.10);;
gap> SetConjugate(coll, 7, 5, F.7*F.10);;
gap> SetConjugate(coll, 7, 6, F.7*F.8);;
gap> UpdatePolycyclicCollector(coll);;
gap> G := GroupByRws(coll);