| order | 2048 |
| nilpotency class | 5 |
| automorphism | ? |
| homology | Abelianization (H1) = C22×C4 · Schur multiplier (H2) = C25 |
No aliases for this group.
| subgroup | G/H | |
|---|---|---|
| center, socle | C2 | #72238699 |
| commutator | #2308 | C22×C4 |
| Frattini, cosocle | #35346 | C23 |
| prime radical | #417824 | C22 |
| LCS | G ▷ #2308 ▷ C25 ▷ C23 ▷ C2 ▷ C1 | |
| UCS | C1 ◁ C2 ◁ C23 ◁ C25 ◁ #35346 ◁ G | |
| LECS | G ▷ #35346 ▷ C25 ▷ C23 ▷ C2 ▷ C1 | |
3126 conjugacy classes of subgroups; only the 96 normal subgroups are shown.
This group has 3126 conjugacy classes of subgroups — too many to draw. Only its 96 normal subgroups are shown.
Dotted edges: containments with no intermediate normal subgroup — omitted non-normal subgroups may lie between.
| minimal degree | μ(G) = 32 |
| transitive degree | μt(G) = 32 |
A minimal faithful permutation representation — 3 generators on 32 points:
(1,2)(3,8,13,23)(4,7)(5,9)(6,10)(11,24,28,31)(12,22,29,18)(14,19)(15,20)(16,25)(17,26)(21,30,32,27);(2,7)(3,11)(8,21,23,32)(9,25,26,19)(10,20)(12,27,29,30)(13,28)(14,16)(18,31)(22,24);(1,3)(2,8)(4,12)(5,11)(6,13)(7,18)(9,24)(10,23)(14,27)(15,29)(16,30)(17,28)(19,32)(20,22)(21,25)(26,31)Polycyclic presentation:
2^11|a^2=i,b^2=e,b^a=bd,c^a=chk,c^b=cef,d^b=dg,d^c=dgij,e^a=eg,e^c=eh,e^d=ei,f^b=fhj,f^c=fhj,f^d=fk,f^e=fj,g^b=gi,g^c=gk,g^f=gk,h^a=hk,h^b=hj,h^d=hk,i^c=ik,j^a=jk62 conjugacy classes — view the full character table.
| maximal subgroup of | #72310536, #72337752, #72337767 |
| maximal normal subgroup of | #72310536, #72337752, #72337767 |
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, 1, F.9);;
gap> SetPower(coll, 2, F.5);;
gap> SetConjugate(coll, 2, 1, F.2*F.4);;
gap> SetConjugate(coll, 3, 1, F.3*F.8*F.11);;
gap> SetConjugate(coll, 3, 2, F.3*F.5*F.6);;
gap> SetConjugate(coll, 4, 2, F.4*F.7);;
gap> SetConjugate(coll, 4, 3, F.4*F.7*F.9*F.10);;
gap> SetConjugate(coll, 5, 1, F.5*F.7);;
gap> SetConjugate(coll, 5, 3, F.5*F.8);;
gap> SetConjugate(coll, 5, 4, F.5*F.9);;
gap> SetConjugate(coll, 6, 2, F.6*F.8*F.10);;
gap> SetConjugate(coll, 6, 3, F.6*F.8*F.10);;
gap> SetConjugate(coll, 6, 4, F.6*F.11);;
gap> SetConjugate(coll, 6, 5, F.6*F.10);;
gap> SetConjugate(coll, 7, 2, F.7*F.9);;
gap> SetConjugate(coll, 7, 3, F.7*F.11);;
gap> SetConjugate(coll, 7, 6, F.7*F.11);;
gap> SetConjugate(coll, 8, 1, F.8*F.11);;
gap> SetConjugate(coll, 8, 2, F.8*F.10);;
gap> SetConjugate(coll, 8, 4, F.8*F.11);;
gap> SetConjugate(coll, 9, 3, F.9*F.11);;
gap> SetConjugate(coll, 10, 1, F.10*F.11);;
gap> UpdatePolycyclicCollector(coll);;
gap> G := GroupByRws(coll);