| order | 2048 |
| nilpotency class | 2 |
| automorphism | ? |
| homology | Abelianization (H1) = C27 · Schur multiplier (H2) = C220 |
No aliases for this group.
| subgroup | G/H | |
|---|---|---|
| center, commutator, Frattini, socle, cosocle | C24 | C27 |
| LCS | G ▷ C24 ▷ C1 | |
| UCS | C1 ◁ C24 ◁ G | |
| LECS | G ▷ C24 ▷ C1 | |
At least 28586 conjugacy classes of subgroups; only the 37668 normal subgroups are shown.
| minimal degree | μ(G) = 20 |
| transitive degree | μt(G) = 256 |
A minimal faithful permutation representation — 7 generators on 20 points:
(10,12)(13,14)(15,17)(16,18)(19,20);(6,8)(9,10)(11,12)(13,15)(14,17)(16,20)(18,19);(5,6)(7,8)(13,14)(15,17)(16,18)(19,20);(5,6,7,8)(13,15)(14,17)(16,20)(18,19);(6,8)(14,18)(17,19);(2,4)(5,6)(7,8)(13,15)(14,17)(16,20)(18,19);(1,2)(3,4)(13,14)(15,19)(16,18)(17,20)Polycyclic presentation:
2^11|d^2=i,b^a=bk,c^b=ci,d^b=di,d^c=di,e^a=eij,e^c=ej,e^d=ei,f^b=fi,f^d=fi,f^e=fi,g^b=gij,g^d=gij,g^e=gij,g^f=gh284 conjugacy classes — view the full character table.
| maximal quotient of | #72298631 |
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", "k");;
gap> coll := SingleCollector(F, [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2]);;
gap> SetPower(coll, 4, F.9);;
gap> SetConjugate(coll, 2, 1, F.2*F.11);;
gap> SetConjugate(coll, 3, 2, F.3*F.9);;
gap> SetConjugate(coll, 4, 2, F.4*F.9);;
gap> SetConjugate(coll, 4, 3, F.4*F.9);;
gap> SetConjugate(coll, 5, 1, F.5*F.9*F.10);;
gap> SetConjugate(coll, 5, 3, F.5*F.10);;
gap> SetConjugate(coll, 5, 4, F.5*F.9);;
gap> SetConjugate(coll, 6, 2, F.6*F.9);;
gap> SetConjugate(coll, 6, 4, F.6*F.9);;
gap> SetConjugate(coll, 6, 5, F.6*F.9);;
gap> SetConjugate(coll, 7, 2, F.7*F.9*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, 7, 6, F.7*F.8);;
gap> UpdatePolycyclicCollector(coll);;
gap> G := GroupByRws(coll);