| order | 2048 |
| nilpotency class | 5 |
| automorphism | ? |
| homology | Abelianization (H1) = C23×C8 · Schur multiplier (H2) = C24 |
No aliases for this group.
| subgroup | G/H | |
|---|---|---|
| center, socle | C22 | C2×#12067 |
| commutator | C2×C16 | C23×C8 |
| Frattini, cosocle | #1311 | C24 |
| prime radical | C22×D32 | C8 |
| LCS | G ▷ C2×C16 ▷ C8 ▷ C4 ▷ C2 ▷ C1 | |
| UCS | C1 ◁ C22 ◁ C2×C42 ◁ C2×C82 ◁ #122219 ◁ G | |
| LECS | G ▷ #1311 ▷ C4×C8 ▷ C2×C4 ▷ C2 ▷ C1 | |
835 conjugacy classes of subgroups.
| minimal degree | μ(G) = 48 |
| transitive degree | μt(G) = 512 |
A minimal faithful permutation representation — 4 generators on 48 points:
(2,4)(8,11)(10,13)(15,16);(1,2,5,10,7,8,14,15,6,4,9,13,3,11,12,16)(17,18,20,27,22,28,37,26,23,30,38,29,24,21,39,40)(19,25,32,42,34,43,47,33,36,44,48,45,41,31,35,46);(1,3,6,7)(2,8,4,11)(5,12,9,14)(10,15,13,16)(17,19,23,36)(18,25,30,44)(20,32,38,48)(21,31,28,43)(22,34,24,41)(26,33,40,46)(27,42,29,45)(35,37,47,39);(1,4,5,13,7,11,14,16,6,2,9,10,3,8,12,15)(18,26,30,40)(19,31,34,44,36,43,41,25)(20,37)(21,29,28,27)(22,24)(32,45,47,33,48,42,35,46)(38,39)Polycyclic presentation:
2^11|b^2=e,c^2=i,d^2=ehj,e^2=g,f^2=hj,g^2=i,h^2=jk,j^2=k,b^a=bik,c^b=cik,d^a=dik,d^b=dh,d^c=df,e^d=ejk,f^b=fj,f^c=fh,f^d=fhjk,f^e=fk,g^d=gk,h^b=hk,h^c=hj,h^d=hjk,j^c=jk,j^d=jk128 conjugacy classes — view the full character table.
| maximal subgroup of | #72287443, #72323084, #72323152, … |
| maximal normal subgroup of | #72287443, #72323084, #72323152, … |
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, 2, F.5);;
gap> SetPower(coll, 3, F.9);;
gap> SetPower(coll, 4, F.5*F.8*F.10);;
gap> SetPower(coll, 5, F.7);;
gap> SetPower(coll, 6, F.8*F.10);;
gap> SetPower(coll, 7, F.9);;
gap> SetPower(coll, 8, F.10*F.11);;
gap> SetPower(coll, 10, F.11);;
gap> SetConjugate(coll, 2, 1, F.2*F.9*F.11);;
gap> SetConjugate(coll, 3, 2, F.3*F.9*F.11);;
gap> SetConjugate(coll, 4, 1, F.4*F.9*F.11);;
gap> SetConjugate(coll, 4, 2, F.4*F.8);;
gap> SetConjugate(coll, 4, 3, F.4*F.6);;
gap> SetConjugate(coll, 5, 4, F.5*F.10*F.11);;
gap> SetConjugate(coll, 6, 2, F.6*F.10);;
gap> SetConjugate(coll, 6, 3, F.6*F.8);;
gap> SetConjugate(coll, 6, 4, F.6*F.8*F.10*F.11);;
gap> SetConjugate(coll, 6, 5, F.6*F.11);;
gap> SetConjugate(coll, 7, 4, F.7*F.11);;
gap> SetConjugate(coll, 8, 2, F.8*F.11);;
gap> SetConjugate(coll, 8, 3, F.8*F.10);;
gap> SetConjugate(coll, 8, 4, F.8*F.10*F.11);;
gap> SetConjugate(coll, 10, 3, F.10*F.11);;
gap> SetConjugate(coll, 10, 4, F.10*F.11);;
gap> UpdatePolycyclicCollector(coll);;
gap> G := GroupByRws(coll);