| order | 1024 |
| nilpotency class | 4 |
| automorphism | ? |
| homology | Abelianization (H1) = C24 · Schur multiplier (H2) = C27 |
No aliases for this group.
| subgroup | G/H | |
|---|---|---|
| center, socle | C22 | #32898 |
| commutator, Frattini, cosocle | C2×C4×D4 | C24 |
| prime radical | #7699588 | C2 |
| LCS | G ▷ C2×C4×D4 ▷ C23 ▷ C2 ▷ C1 | |
| UCS | C1 ◁ C22 ◁ C22×C4 ◁ C2×#547 ◁ G | |
| LECS | G ▷ C2×C4×D4 ▷ C23 ▷ C2 ▷ C1 | |
4840 conjugacy classes of subgroups.
| minimal degree | μ(G) = 24 |
| transitive degree | μt(G) = 64 |
A minimal faithful permutation representation — 4 generators on 24 points:
(2,5)(6,8)(17,19)(21,23);(11,17,18,19)(14,21,22,23);(2,6)(4,7)(5,8)(9,10,13,16)(11,14,18,22)(12,15,20,24)(17,21,19,23);(1,2,4,6,3,5,7,8)(9,11)(10,14)(12,19)(13,18)(15,23)(16,22)(17,20)(21,24)Polycyclic presentation:
2^10|b^2=h,c^2=j,d^2=efi,f^2=i,g^2=j,b^a=bh,d^a=de,d^b=dg,d^c=defi,e^b=eh,f^b=fh,f^c=fi,g^a=gh,g^d=gj,g^e=gj,g^f=gj,h^d=hj85 conjugacy classes — view the full character table.
| maximal subgroup of | #72282057 |
| maximal normal subgroup of | #72282057 |
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, 2, F.8);;
gap> SetPower(coll, 3, F.10);;
gap> SetPower(coll, 4, F.5*F.6*F.9);;
gap> SetPower(coll, 6, F.9);;
gap> SetPower(coll, 7, F.10);;
gap> SetConjugate(coll, 2, 1, F.2*F.8);;
gap> SetConjugate(coll, 4, 1, F.4*F.5);;
gap> SetConjugate(coll, 4, 2, F.4*F.7);;
gap> SetConjugate(coll, 4, 3, F.4*F.5*F.6*F.9);;
gap> SetConjugate(coll, 5, 2, F.5*F.8);;
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);;
gap> SetConjugate(coll, 7, 4, F.7*F.10);;
gap> SetConjugate(coll, 7, 5, F.7*F.10);;
gap> SetConjugate(coll, 7, 6, F.7*F.10);;
gap> SetConjugate(coll, 8, 4, F.8*F.10);;
gap> UpdatePolycyclicCollector(coll);;
gap> G := GroupByRws(coll);