| order | 2048 |
| nilpotency class | 3 |
| automorphism | ? |
| homology | Abelianization (H1) = C24 · Schur multiplier (H2) = C212 |
No aliases for this group.
| subgroup | G/H | |
|---|---|---|
| center, socle | C24 | #2846 |
| commutator, Frattini, cosocle | C27 | C24 |
| LCS | G ▷ C27 ▷ C22 ▷ C1 | |
| UCS | C1 ◁ C24 ◁ C27 ◁ G | |
| LECS | G ▷ C27 ▷ C22 ▷ C1 | |
193499 conjugacy classes of subgroups.
| minimal degree | μ(G) = 24 |
| transitive degree | μt(G) = 64 |
A minimal faithful permutation representation — 4 generators on 24 points:
(5,6)(7,8)(17,18)(19,23)(20,22)(21,24);(1,2)(3,4)(9,10)(11,15)(12,14)(13,16);(13,15)(21,23);(2,4)(6,8)(9,11)(10,13,14,15)(12,16)(17,19)(18,21,22,23)(20,24)Polycyclic presentation:
2^11|d^2=e,c^a=ci,c^b=cg,d^a=dh,d^b=df,d^c=de,e^a=ek,e^b=ej,f^d=fj,g^d=gj,h^d=hk,i^d=ik164 conjugacy classes — view the full character table.
| maximal subgroup of | #72225731, #72256361, #72310013, … |
| maximal normal subgroup of | #72225731, #72310013, #72310162, … |
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, 4, F.5);;
gap> SetConjugate(coll, 3, 1, F.3*F.9);;
gap> SetConjugate(coll, 3, 2, F.3*F.7);;
gap> SetConjugate(coll, 4, 1, F.4*F.8);;
gap> SetConjugate(coll, 4, 2, F.4*F.6);;
gap> SetConjugate(coll, 4, 3, F.4*F.5);;
gap> SetConjugate(coll, 5, 1, F.5*F.11);;
gap> SetConjugate(coll, 5, 2, F.5*F.10);;
gap> SetConjugate(coll, 6, 4, F.6*F.10);;
gap> SetConjugate(coll, 7, 4, F.7*F.10);;
gap> SetConjugate(coll, 8, 4, F.8*F.11);;
gap> SetConjugate(coll, 9, 4, F.9*F.11);;
gap> UpdatePolycyclicCollector(coll);;
gap> G := GroupByRws(coll);