| order | 1024 |
| nilpotency class | 4 |
| automorphism | ? |
| homology | Abelianization (H1) = C23×C4 · Schur multiplier (H2) = C28 |
No aliases for this group.
| subgroup | G/H | |
|---|---|---|
| center, socle | C22 | #20609 |
| commutator | C22×D4 | C23×C4 |
| Frattini, cosocle | C22×#41 | C24 |
| prime radical | #7819606 | C2 |
| LCS | G ▷ C22×D4 ▷ C23 ▷ C2 ▷ C1 | |
| UCS | C1 ◁ C22 ◁ C22×C4 ◁ C22×H(5,𝔽2) ◁ G | |
| LECS | G ▷ C22×#41 ▷ C23 ▷ C2 ▷ C1 | |
5987 conjugacy classes of subgroups.
| minimal degree | μ(G) = 24 |
| transitive degree | μt(G) = 64 |
A minimal faithful permutation representation — 4 generators on 24 points:
(1,2)(3,7)(4,5)(6,8)(10,15)(11,12)(16,24)(17,22)(18,23)(19,20);(2,5)(6,7)(13,21)(19,20);(1,3)(2,6,5,7)(4,8)(9,10,12,16,14,17,11,18)(13,22,20,24,21,15,19,23);(3,8)(6,7)(9,11)(10,16)(12,14)(13,19)(15,23)(17,18)(20,21)(22,24)Polycyclic presentation:
2^10|c^2=e,e^2=j,b^a=bij,c^a=cf,c^b=cg,d^a=dj,d^c=dhi,e^a=ei,e^d=ej,f^b=fh,f^c=fi,g^a=ghj,g^f=gj,h^c=hj79 conjugacy classes — view the full character table.
| maximal subgroup of | #72233346, #72233670 |
| maximal normal subgroup of | #72233346, #72233670 |
| maximal quotient of | #72233286, #72233619, #72233630 |
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");;
gap> coll := SingleCollector(F, [2, 2, 2, 2, 2, 2, 2, 2, 2, 2]);;
gap> SetPower(coll, 3, F.5);;
gap> SetPower(coll, 5, F.10);;
gap> SetConjugate(coll, 2, 1, F.2*F.9*F.10);;
gap> SetConjugate(coll, 3, 1, F.3*F.6);;
gap> SetConjugate(coll, 3, 2, F.3*F.7);;
gap> SetConjugate(coll, 4, 1, F.4*F.10);;
gap> SetConjugate(coll, 4, 3, F.4*F.8*F.9);;
gap> SetConjugate(coll, 5, 1, F.5*F.9);;
gap> SetConjugate(coll, 5, 4, F.5*F.10);;
gap> SetConjugate(coll, 6, 2, F.6*F.8);;
gap> SetConjugate(coll, 6, 3, F.6*F.9);;
gap> SetConjugate(coll, 7, 1, F.7*F.8*F.10);;
gap> SetConjugate(coll, 7, 6, F.7*F.10);;
gap> SetConjugate(coll, 8, 3, F.8*F.10);;
gap> UpdatePolycyclicCollector(coll);;
gap> G := GroupByRws(coll);