| order | 1024 |
| nilpotency class | 4 |
| automorphism | ? |
| homology | Abelianization (H1) = C24 · Schur multiplier (H2) = C28 |
No aliases for this group.
| subgroup | G/H | |
|---|---|---|
| center, socle | C22 | #32898 |
| commutator, Frattini, cosocle | C23×D4 | C24 |
| prime radical | #245225 | C2 |
| LCS | G ▷ C23×D4 ▷ C23 ▷ C2 ▷ C1 | |
| UCS | C1 ◁ C22 ◁ C24 ◁ C22×#120 ◁ G | |
| LECS | G ▷ C23×D4 ▷ C23 ▷ C2 ▷ C1 | |
4922 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,5)(4,6)(7,8);(5,8)(9,10)(11,17)(12,14)(13,16)(15,19)(18,21)(20,22)(23,24);(1,3)(2,5)(4,7)(6,8)(10,14)(15,23)(16,22)(17,21);(9,11,13,19)(10,15)(12,18,20,24)(14,21)(16,17)(22,23)Polycyclic presentation:
2^10|d^2=ij,b^a=be,c^b=cf,d^b=dg,d^c=di,e^c=eh,f^a=fh,f^d=fi,g^c=gi,g^d=gj,g^f=gj,i^b=ij76 conjugacy classes — view the full character table.
| maximal subgroup of | #72265772 |
| maximal normal subgroup of | #72265772 |
| maximal quotient of | #72266714 |
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, 4, F.9*F.10);;
gap> SetConjugate(coll, 2, 1, F.2*F.5);;
gap> SetConjugate(coll, 3, 2, F.3*F.6);;
gap> SetConjugate(coll, 4, 2, F.4*F.7);;
gap> SetConjugate(coll, 4, 3, F.4*F.9);;
gap> SetConjugate(coll, 5, 3, F.5*F.8);;
gap> SetConjugate(coll, 6, 1, F.6*F.8);;
gap> SetConjugate(coll, 6, 4, F.6*F.9);;
gap> SetConjugate(coll, 7, 3, F.7*F.9);;
gap> SetConjugate(coll, 7, 4, F.7*F.10);;
gap> SetConjugate(coll, 7, 6, F.7*F.10);;
gap> SetConjugate(coll, 9, 2, F.9*F.10);;
gap> UpdatePolycyclicCollector(coll);;
gap> G := GroupByRws(coll);