| order | 1024 |
| nilpotency class | 4 |
| automorphism | ? |
| homology | Abelianization (H1) = C25 · Schur multiplier (H2) = C29 |
No aliases for this group.
| subgroup | G/H | |
|---|---|---|
| center, socle | C22 | C22×B(4,𝔽2) |
| commutator, Frattini, cosocle | C22×D4 | C25 |
| LCS | G ▷ C22×D4 ▷ C22 ▷ C2 ▷ C1 | |
| UCS | C1 ◁ C22 ◁ C25 ◁ C24×D4 ◁ G | |
| LECS | G ▷ C22×D4 ▷ C22 ▷ C2 ▷ C1 | |
9809 conjugacy classes of subgroups.
| minimal degree | μ(G) = 24 |
| transitive degree | μt(G) = 32 |
A minimal faithful permutation representation — 5 generators on 24 points:
(9,10)(11,17,20,24)(12,16)(13,14)(15,19,22,18)(21,23);(1,2)(3,6)(4,5)(7,8)(11,18,20,19)(15,24,22,17);(2,5)(6,8)(10,14)(15,22)(16,23)(18,19);(1,3)(2,6)(4,7)(5,8)(9,11)(10,15)(12,18)(13,20)(14,22)(16,24)(17,23)(19,21);(3,7)(6,8)Polycyclic presentation:
2^10|a^2=i,b^2=i,f^2=j,c^a=cij,c^b=ch,d^a=df,d^b=dfj,d^c=dg,e^d=ehi,f^c=fi,f^d=fj,g^a=gi,g^b=gi,g^f=gj,h^d=hj,i^d=ij82 conjugacy classes — view the full character table.
| maximal subgroup of | #72233486, #72234538, #72234567, … |
| maximal normal subgroup of | #72233486, #72234538, #72234567, … |
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, 1, F.9);;
gap> SetPower(coll, 2, F.9);;
gap> SetPower(coll, 6, F.10);;
gap> SetConjugate(coll, 3, 1, F.3*F.9*F.10);;
gap> SetConjugate(coll, 3, 2, F.3*F.8);;
gap> SetConjugate(coll, 4, 1, F.4*F.6);;
gap> SetConjugate(coll, 4, 2, F.4*F.6*F.10);;
gap> SetConjugate(coll, 4, 3, F.4*F.7);;
gap> SetConjugate(coll, 5, 4, F.5*F.8*F.9);;
gap> SetConjugate(coll, 6, 3, F.6*F.9);;
gap> SetConjugate(coll, 6, 4, F.6*F.10);;
gap> SetConjugate(coll, 7, 1, F.7*F.9);;
gap> SetConjugate(coll, 7, 2, F.7*F.9);;
gap> SetConjugate(coll, 7, 6, F.7*F.10);;
gap> SetConjugate(coll, 8, 4, F.8*F.10);;
gap> SetConjugate(coll, 9, 4, F.9*F.10);;
gap> UpdatePolycyclicCollector(coll);;
gap> G := GroupByRws(coll);