| order | 2048 |
| nilpotency class | 2 |
| automorphism | ? |
| homology | Abelianization (H1) = C27 · Schur multiplier (H2) = C219 |
No aliases for this group.
| subgroup | G/H | |
|---|---|---|
| center, commutator, Frattini, socle, cosocle | C24 | C27 |
| LCS | G ▷ C24 ▷ C1 | |
| UCS | C1 ◁ C24 ◁ G | |
| LECS | G ▷ C24 ▷ C1 | |
At least 43152 conjugacy classes of subgroups; only the 35128 normal subgroups are shown.
| minimal degree | μ(G) = 24 |
| transitive degree | μt(G) = 128 |
A minimal faithful permutation representation — 7 generators on 24 points:
(10,13)(14,16)(19,23)(20,24);(9,10)(11,14)(12,13)(15,16)(17,18)(19,20)(21,22)(23,24);(6,7)(10,13)(14,16)(18,22)(20,24);(2,4)(11,15)(14,16);(2,4)(6,7)(11,15)(14,16);(5,6,8,7)(9,11)(10,14)(12,15)(13,16)(17,19)(18,20)(21,23)(22,24);(1,2)(3,4)(5,7,8,6)(9,10)(11,14)(12,13)(15,16)(17,20)(18,19)(21,24)(22,23)Polycyclic presentation:
2^11|f^2=ij,g^2=ij,b^a=bi,c^b=cik,f^a=fk,f^c=fij,f^d=fi,f^e=fj,g^a=gik,g^c=gjk,g^d=gh,g^e=ghij272 conjugacy classes — view the full character table.
| maximal quotient of | #72335839 |
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, 6, F.9*F.10);;
gap> SetPower(coll, 7, F.9*F.10);;
gap> SetConjugate(coll, 2, 1, F.2*F.9);;
gap> SetConjugate(coll, 3, 2, F.3*F.9*F.11);;
gap> SetConjugate(coll, 6, 1, F.6*F.11);;
gap> SetConjugate(coll, 6, 3, F.6*F.9*F.10);;
gap> SetConjugate(coll, 6, 4, F.6*F.9);;
gap> SetConjugate(coll, 6, 5, F.6*F.10);;
gap> SetConjugate(coll, 7, 1, F.7*F.9*F.11);;
gap> SetConjugate(coll, 7, 3, F.7*F.10*F.11);;
gap> SetConjugate(coll, 7, 4, F.7*F.8);;
gap> SetConjugate(coll, 7, 5, F.7*F.8*F.9*F.10);;
gap> UpdatePolycyclicCollector(coll);;
gap> G := GroupByRws(coll);