| order | 4096 |
| nilpotency class | 2 |
| automorphism | ? |
| homology | Abelianization (H1) = C27 · Schur multiplier (H2) = C223 |
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 9982 conjugacy classes of subgroups; only the 64075 normal subgroups are shown.
| minimal degree | μ(G) = 28 |
| transitive degree | μt(G) = 256 |
A minimal faithful permutation representation — 7 generators on 28 points:
(6,8)(10,12)(13,14)(15,18)(16,19)(17,20)(21,22)(23,24)(25,28)(26,27);(13,15)(14,16)(17,19)(18,20)(21,23)(22,25)(24,27)(26,28);(2,4)(6,8)(10,12)(21,24)(22,23)(25,26)(27,28);(2,4)(6,8)(22,27)(24,25);(6,8)(10,12);(6,8)(13,15)(14,18)(16,20)(17,19)(21,23)(22,24)(25,27)(26,28);(1,2)(3,4)(5,6,7,8)(9,10)(11,12)(13,16,17,18)(14,19,20,15)(21,25,26,24)(22,28,27,23)Polycyclic presentation:
2^12|g^2=hijk,b^a=bh,c^b=cl,d^a=dl,d^c=dl,g^a=gi,g^c=gk,g^d=gj,g^e=gi,g^f=ghijk508 conjugacy classes — view the full character table.
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, 7, F.8*F.9*F.10*F.11);;
gap> SetConjugate(coll, 2, 1, F.2*F.8);;
gap> SetConjugate(coll, 3, 2, F.3*F.12);;
gap> SetConjugate(coll, 4, 1, F.4*F.12);;
gap> SetConjugate(coll, 4, 3, F.4*F.12);;
gap> SetConjugate(coll, 7, 1, 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*F.9*F.10*F.11);;
gap> UpdatePolycyclicCollector(coll);;
gap> G := GroupByRws(coll);