| order | 4096 |
| nilpotency class | 4 |
| automorphism | ? |
| homology | Abelianization (H1) = C25 · Schur multiplier (H2) = C214 |
No aliases for this group.
| subgroup | G/H | |
|---|---|---|
| center, socle | C23 | C2×#23900 |
| commutator, Frattini, cosocle | C23×C22⋊C4 | C25 |
| LCS | G ▷ C23×C22⋊C4 ▷ C23 ▷ C2 ▷ C1 | |
| UCS | C1 ◁ C23 ◁ C26 ◁ C24×#120 ◁ G | |
| LECS | G ▷ C23×C22⋊C4 ▷ C23 ▷ C2 ▷ C1 | |
At least 13415 conjugacy classes of subgroups; only the 1475 normal subgroups are shown.
| minimal degree | μ(G) = 20 |
| transitive degree | μt(G) = 32 |
A minimal faithful permutation representation — 5 generators on 20 points:
(7,11)(9,12);(15,19);(6,9,10,12)(14,17)(18,20);(1,2)(3,4);(2,4)(5,6)(7,12)(8,10)(9,11)(13,14)(15,20)(16,18)(17,19)Polycyclic presentation:
2^12|c^2=i,g^2=k,c^a=ci,e^b=eh,e^c=eg,e^d=ef,g^a=gk,g^b=gj,g^e=gk,h^c=hjl,h^g=hl,i^e=ik,j^e=jl256 conjugacy classes — view the full character table.
| automorphism group of | #8497, #8498 |
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", "l");;
gap> coll := SingleCollector(F, [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2]);;
gap> SetPower(coll, 3, F.9);;
gap> SetPower(coll, 7, F.11);;
gap> SetConjugate(coll, 3, 1, F.3*F.9);;
gap> SetConjugate(coll, 5, 2, F.5*F.8);;
gap> SetConjugate(coll, 5, 3, F.5*F.7);;
gap> SetConjugate(coll, 5, 4, F.5*F.6);;
gap> SetConjugate(coll, 7, 1, F.7*F.11);;
gap> SetConjugate(coll, 7, 2, F.7*F.10);;
gap> SetConjugate(coll, 7, 5, F.7*F.11);;
gap> SetConjugate(coll, 8, 3, F.8*F.10*F.12);;
gap> SetConjugate(coll, 8, 7, F.8*F.12);;
gap> SetConjugate(coll, 9, 5, F.9*F.11);;
gap> SetConjugate(coll, 10, 5, F.10*F.12);;
gap> UpdatePolycyclicCollector(coll);;
gap> G := GroupByRws(coll);