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