| order | 2048 |
| nilpotency class | 3 |
| automorphism | ? |
| homology | Abelianization (H1) = C26 · Schur multiplier (H2) = C218 |
No aliases for this group.
| subgroup | G/H | |
|---|---|---|
| center, socle | C24 | C24×D4 |
| commutator, Frattini, cosocle | C23×C4 | C26 |
| LCS | G ▷ C23×C4 ▷ C2 ▷ C1 | |
| UCS | C1 ◁ C24 ◁ C24×C4×D4 ◁ G | |
| LECS | G ▷ C23×C4 ▷ C2 ▷ C1 | |
846872 conjugacy classes of subgroups.
| minimal degree | μ(G) = 20 |
| transitive degree | μt(G) = 128 |
A minimal faithful permutation representation — 6 generators on 20 points:
(14,17)(15,19)(18,20);(9,10)(11,12)(14,18)(17,20);(5,6)(7,8)(10,12);(14,18)(17,20);(1,2)(3,4);(2,4)(6,8)(13,14,15,17,16,18,19,20)Polycyclic presentation:
2^11|f^2=j,j^2=k,c^b=ci,f^a=fj,f^b=fk,f^c=fh,f^d=fk,f^e=fg,j^a=jk272 conjugacy classes — view the full character table.
| maximal subgroup of | #72252166, #72261194 |
| maximal normal subgroup of | #72252166, #72261194 |
| maximal quotient of | #72262133 |
| automorphism group of | #1687, #1688, #1689, … |
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, 6, F.10);;
gap> SetPower(coll, 10, F.11);;
gap> SetConjugate(coll, 3, 2, F.3*F.9);;
gap> SetConjugate(coll, 6, 1, F.6*F.10);;
gap> SetConjugate(coll, 6, 2, F.6*F.11);;
gap> SetConjugate(coll, 6, 3, F.6*F.8);;
gap> SetConjugate(coll, 6, 4, F.6*F.11);;
gap> SetConjugate(coll, 6, 5, F.6*F.7);;
gap> SetConjugate(coll, 10, 1, F.10*F.11);;
gap> UpdatePolycyclicCollector(coll);;
gap> G := GroupByRws(coll);