| 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 |
| LCS | G ▷ C23×D4 ▷ C23 ▷ C2 ▷ C1 | |
| UCS | C1 ◁ C22 ◁ C24 ◁ C22×#120 ◁ G | |
| LECS | G ▷ C23×D4 ▷ C23 ▷ C2 ▷ C1 | |
4660 conjugacy classes of subgroups.
| minimal degree | μ(G) = 24 |
| transitive degree | μt(G) = 64 |
A minimal faithful permutation representation — 4 generators on 24 points:
(9,10)(11,14)(12,16)(13,15)(17,24)(18,22)(19,21)(20,23);(1,2)(3,7)(4,6)(5,8)(11,17,18,19)(14,21,22,24);(5,7)(9,11)(10,14)(12,19)(13,18)(15,22)(16,24)(17,20)(21,23);(1,3)(2,5)(4,8)(6,7)(14,22)(21,24)Polycyclic presentation:
2^10|b^2=i,g^2=j,b^a=bi,c^a=cf,c^b=cg,d^a=di,d^b=dh,d^c=de,e^a=ej,e^b=eh,f^b=fi,g^a=gi,g^c=gj,g^d=gh,g^f=gj,i^c=ij64 conjugacy classes — view the full character table.
| maximal subgroup of | #72256076, #72256187, #72263049 |
| maximal normal subgroup of | #72256076, #72256187, #72263049 |
| maximal quotient of | #72263331 |
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.9);;
gap> SetPower(coll, 7, F.10);;
gap> SetConjugate(coll, 2, 1, F.2*F.9);;
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.9);;
gap> SetConjugate(coll, 4, 2, F.4*F.8);;
gap> SetConjugate(coll, 4, 3, F.4*F.5);;
gap> SetConjugate(coll, 5, 1, F.5*F.10);;
gap> SetConjugate(coll, 5, 2, F.5*F.8);;
gap> SetConjugate(coll, 6, 2, F.6*F.9);;
gap> SetConjugate(coll, 7, 1, F.7*F.9);;
gap> SetConjugate(coll, 7, 3, F.7*F.10);;
gap> SetConjugate(coll, 7, 4, F.7*F.8);;
gap> SetConjugate(coll, 7, 6, F.7*F.10);;
gap> SetConjugate(coll, 9, 3, F.9*F.10);;
gap> UpdatePolycyclicCollector(coll);;
gap> G := GroupByRws(coll);