| order | 1024 |
| nilpotency class | 5 |
| automorphism | ? |
| homology | Abelianization (H1) = C2×C42 · Schur multiplier (H2) = C25×C4 |
No aliases for this group.
| subgroup | G/H | |
|---|---|---|
| center, socle | C2 | #128058 |
| commutator | C2×C42 | C2×C42 |
| Frattini, cosocle | C2×#535 | C23 |
| prime radical | C2×#3498 | C22 |
| LCS | G ▷ C2×C42 ▷ C22×C4 ▷ C22 ▷ C2 ▷ C1 | |
| UCS | C1 ◁ C2 ◁ C23 ◁ C22×#41 ◁ C2×#3498 ◁ G | |
| LECS | G ▷ C2×#535 ▷ C22×C4 ▷ C22 ▷ C2 ▷ C1 | |
2616 conjugacy classes of subgroups.
| minimal degree | μ(G) = 32 |
| transitive degree | μt(G) = 32 |
A minimal faithful permutation representation — 3 generators on 32 points:
(1,2,4,9)(3,8,13,24)(5,7,20,22)(6,11,17,28)(10,18,26,19)(12,25,29,32)(14,23,30,27)(15,21,16,31);(2,7)(3,12)(5,19)(8,23)(9,26)(10,11)(16,30)(18,20)(21,25)(22,28)(24,27)(31,32);(1,3)(2,8,7,21)(4,16,17,30)(5,15,19,14)(6,12)(9,27,22,24)(10,23,11,25)(13,18)(20,29)(26,32,28,31)Polycyclic presentation:
2^10|a^2=d,c^2=f,e^2=ij,g^2=j,h^2=j,b^a=bhj,c^a=ce,c^b=cj,d^b=dij,d^c=dh,e^a=ehi,e^b=eij,e^c=eg,e^d=ei,f^a=fgij,f^d=fi,f^e=fij,g^a=gi,g^b=gj,g^c=gi,g^d=gj,g^f=gj,h^a=hi,h^b=hj,h^c=hij,h^d=hj,h^f=hj,i^a=ij,i^c=ij64 conjugacy classes — view the full character table.
| maximal subgroup of | #72318067, #72318092, #72318154, … |
| maximal normal subgroup of | #72318067, #72318092, #72318154, … |
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.4);;
gap> SetPower(coll, 3, F.6);;
gap> SetPower(coll, 5, F.9*F.10);;
gap> SetPower(coll, 7, F.10);;
gap> SetPower(coll, 8, F.10);;
gap> SetConjugate(coll, 2, 1, F.2*F.8*F.10);;
gap> SetConjugate(coll, 3, 1, F.3*F.5);;
gap> SetConjugate(coll, 3, 2, F.3*F.10);;
gap> SetConjugate(coll, 4, 2, F.4*F.9*F.10);;
gap> SetConjugate(coll, 4, 3, F.4*F.8);;
gap> SetConjugate(coll, 5, 1, F.5*F.8*F.9);;
gap> SetConjugate(coll, 5, 2, F.5*F.9*F.10);;
gap> SetConjugate(coll, 5, 3, F.5*F.7);;
gap> SetConjugate(coll, 5, 4, F.5*F.9);;
gap> SetConjugate(coll, 6, 1, F.6*F.7*F.9*F.10);;
gap> SetConjugate(coll, 6, 4, F.6*F.9);;
gap> SetConjugate(coll, 6, 5, F.6*F.9*F.10);;
gap> SetConjugate(coll, 7, 1, F.7*F.9);;
gap> SetConjugate(coll, 7, 2, F.7*F.10);;
gap> SetConjugate(coll, 7, 3, F.7*F.9);;
gap> SetConjugate(coll, 7, 4, F.7*F.10);;
gap> SetConjugate(coll, 7, 6, F.7*F.10);;
gap> SetConjugate(coll, 8, 1, F.8*F.9);;
gap> SetConjugate(coll, 8, 2, F.8*F.10);;
gap> SetConjugate(coll, 8, 3, F.8*F.9*F.10);;
gap> SetConjugate(coll, 8, 4, F.8*F.10);;
gap> SetConjugate(coll, 8, 6, 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);