| order | 4096 |
| nilpotency class | 2 |
| automorphism | ? |
| homology | Abelianization (H1) = C27 · Schur multiplier (H2) = C224 |
No aliases for this group.
| subgroup | G/H | |
|---|---|---|
| center, commutator, Frattini, socle, cosocle | C25 | C27 |
| LCS | G ▷ C25 ▷ C1 | |
| UCS | C1 ◁ C25 ◁ G | |
| LECS | G ▷ C25 ▷ C1 | |
At least 6587 conjugacy classes of subgroups; only the 75099 normal subgroups are shown.
| minimal degree | μ(G) = 20 |
| transitive degree | μt(G) = 128 |
A minimal faithful permutation representation — 7 generators on 20 points:
(5,6)(7,8)(9,10)(11,12)(13,14)(15,16)(18,20);(6,8)(10,12)(14,16)(17,18)(19,20);(14,16);(10,12);(6,8)(10,12)(14,16);(2,4)(14,16);(1,2)(3,4)(5,6)(7,8)(9,10)(11,12)(13,14)(15,16)Polycyclic presentation:
2^12|b^a=bl,c^a=ck,d^a=dj,e^a=ei,f^a=fk,g^b=gi,g^c=gk,g^d=gj,g^e=gi,g^f=gh592 conjugacy classes — view the full character table.
| maximal subgroup of | C2×#72296209 |
| maximal normal subgroup of | C2×#72296209 |
| maximal quotient of | C2×#72296209 |
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> SetConjugate(coll, 2, 1, F.2*F.12);;
gap> SetConjugate(coll, 3, 1, F.3*F.11);;
gap> SetConjugate(coll, 4, 1, F.4*F.10);;
gap> SetConjugate(coll, 5, 1, F.5*F.9);;
gap> SetConjugate(coll, 6, 1, F.6*F.11);;
gap> SetConjugate(coll, 7, 2, F.7*F.9);;
gap> SetConjugate(coll, 7, 3, F.7*F.11);;
gap> SetConjugate(coll, 7, 4, F.7*F.10);;
gap> SetConjugate(coll, 7, 5, F.7*F.9);;
gap> SetConjugate(coll, 7, 6, F.7*F.8);;
gap> UpdatePolycyclicCollector(coll);;
gap> G := GroupByRws(coll);