| order | 1024 |
| nilpotency class | 3 |
| automorphism | ? |
| homology | Abelianization (H1) = C25 · Schur multiplier (H2) = C210 |
No aliases for this group.
| subgroup | G/H | |
|---|---|---|
| center, socle | C23 | C22×#120 |
| commutator, Frattini, cosocle | C25 | C25 |
| prime radical | C26 | C24 |
| LCS | G ▷ C25 ▷ C2 ▷ C1 | |
| UCS | C1 ◁ C23 ◁ C24×Q8 ◁ G | |
| LECS | G ▷ C25 ▷ C2 ▷ C1 | |
13681 conjugacy classes of subgroups.
| minimal degree | μ(G) = 24 |
| transitive degree | μt(G) = 128 |
A minimal faithful permutation representation — 5 generators on 24 points:
(21,24);(1,2)(3,5)(4,6)(7,8)(9,10,14,12)(11,16,13,15)(17,18)(19,21)(20,22)(23,24);(1,3)(2,5)(4,7)(6,8)(9,11,14,13)(10,15,12,16)(17,19)(18,21)(20,23)(22,24);(2,6)(3,7)(9,12,14,10)(11,15,13,16);(3,7)(5,8)(9,13,14,11)(10,16,12,15)Polycyclic presentation:
2^10|b^2=i,c^2=i,d^2=i,e^2=i,b^a=bf,c^a=cfg,c^b=ci,d^b=dh,d^c=dhi,e^b=ei,e^c=eh,e^d=ei,f^c=fj,g^b=gj,g^c=gj112 conjugacy classes — view the full character table.
| maximal subgroup of | #72227406, #72227410 |
| maximal normal subgroup of | #72227406, #72227410 |
| maximal quotient of | #72267904, #72268083, #72268112, … |
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, 3, F.9);;
gap> SetPower(coll, 4, F.9);;
gap> SetPower(coll, 5, F.9);;
gap> SetConjugate(coll, 2, 1, F.2*F.6);;
gap> SetConjugate(coll, 3, 1, F.3*F.6*F.7);;
gap> SetConjugate(coll, 3, 2, F.3*F.9);;
gap> SetConjugate(coll, 4, 2, F.4*F.8);;
gap> SetConjugate(coll, 4, 3, F.4*F.8*F.9);;
gap> SetConjugate(coll, 5, 2, F.5*F.9);;
gap> SetConjugate(coll, 5, 3, F.5*F.8);;
gap> SetConjugate(coll, 5, 4, F.5*F.9);;
gap> SetConjugate(coll, 6, 3, F.6*F.10);;
gap> SetConjugate(coll, 7, 2, F.7*F.10);;
gap> SetConjugate(coll, 7, 3, F.7*F.10);;
gap> UpdatePolycyclicCollector(coll);;
gap> G := GroupByRws(coll);