| order | 2048 |
| nilpotency class | 2 |
| automorphism | ? |
| homology | Abelianization (H1) = C26 · Schur multiplier (H2) = C216×C4 |
No aliases for this group.
| subgroup | G/H | |
|---|---|---|
| center, commutator, Frattini, socle, cosocle | C25 | C26 |
| LCS | G ▷ C25 ▷ C1 | |
| UCS | C1 ◁ C25 ◁ G | |
| LECS | G ▷ C25 ▷ C1 | |
832710 conjugacy classes of subgroups.
| minimal degree | μ(G) = 28 |
| transitive degree | μt(G) = 256 |
A minimal faithful permutation representation — 6 generators on 28 points:
(13,14,16,18)(15,17,20,19);(2,4)(6,8)(10,12)(21,22,24,25)(23,26,28,27);(10,12)(22,25)(26,27);(6,8);(13,15)(14,17)(16,20)(18,19)(21,23)(22,26)(24,28)(25,27);(1,2)(3,4)(5,6)(7,8)(9,10)(11,12)(13,14)(15,19)(16,18)(17,20)(21,22)(23,27)(24,25)(26,28)Polycyclic presentation:
2^11|a^2=g,b^2=k,c^b=ck,f^a=fg,f^b=fj,f^c=fi,f^d=fh,f^e=fgk368 conjugacy classes — view the full character table.
| maximal subgroup of | #72339945 |
| maximal normal subgroup of | #72339945 |
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.7);;
gap> SetPower(coll, 2, F.11);;
gap> SetConjugate(coll, 3, 2, F.3*F.11);;
gap> SetConjugate(coll, 6, 1, F.6*F.7);;
gap> SetConjugate(coll, 6, 2, F.6*F.10);;
gap> SetConjugate(coll, 6, 3, F.6*F.9);;
gap> SetConjugate(coll, 6, 4, F.6*F.8);;
gap> SetConjugate(coll, 6, 5, F.6*F.7*F.11);;
gap> UpdatePolycyclicCollector(coll);;
gap> G := GroupByRws(coll);