| order | 1024 |
| nilpotency class | 4 |
| automorphism | ? |
| homology | Abelianization (H1) = C22×C4 · Schur multiplier (H2) = C26 |
No aliases for this group.
| subgroup | G/H | |
|---|---|---|
| center | C4 | #10392 |
| commutator | C22×#41 | C22×C4 |
| Frattini, cosocle | C23×#41 | C23 |
| socle | C2 | #116356 |
| prime radical | #62811 | C22 |
| LCS | G ▷ C22×#41 ▷ C23 ▷ C2 ▷ C1 | |
| UCS | C1 ◁ C4 ◁ C22×C4 ◁ C23×#41 ◁ G | |
| LECS | G ▷ C23×#41 ▷ C23 ▷ C2 ▷ C1 | |
2483 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,5,12)(3,17,18,23)(4,19,10,11)(6,26,7,14)(8,15,9,16)(13,29,32,25)(20,28,21,22)(24,31,30,27);(1,3,9,21)(2,10,16,30)(4,15)(5,20)(6,27)(7,19,29,31)(8,18)(11,25)(12,24)(13,28)(14,22,32,17)(23,26);(1,4,9,24)(2,11)(3,13,21,26)(5,10)(6,22)(7,28,29,23)(8,30)(12,31,15,19)(14,20)(16,27)(17,25)(18,32)Polycyclic presentation:
2^10|a^2=d,b^2=dgj,c^2=dghi,e^2=j,f^2=j,g^2=j,b^a=bdej,c^a=cghij,c^b=cf,d^b=dh,d^c=dhi,e^a=ehj,e^b=eij,e^c=ehj,f^a=fhi,f^c=fj,f^d=fj,f^e=fj,g^a=ghi,g^b=gh,g^c=ghij,g^d=gj,g^e=gj,g^f=gj,h^b=hj,h^c=hj,i^a=ij,i^b=ij64 conjugacy classes — view the full character table.
| maximal subgroup of | #72266597 |
| maximal normal subgroup of | #72266597 |
| maximal quotient of | #72266605 |
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, 2, F.4*F.7*F.10);;
gap> SetPower(coll, 3, F.4*F.7*F.8*F.9);;
gap> SetPower(coll, 5, F.10);;
gap> SetPower(coll, 6, F.10);;
gap> SetPower(coll, 7, F.10);;
gap> SetConjugate(coll, 2, 1, F.2*F.4*F.5*F.10);;
gap> SetConjugate(coll, 3, 1, F.3*F.7*F.8*F.9*F.10);;
gap> SetConjugate(coll, 3, 2, F.3*F.6);;
gap> SetConjugate(coll, 4, 2, F.4*F.8);;
gap> SetConjugate(coll, 4, 3, F.4*F.8*F.9);;
gap> SetConjugate(coll, 5, 1, F.5*F.8*F.10);;
gap> SetConjugate(coll, 5, 2, F.5*F.9*F.10);;
gap> SetConjugate(coll, 5, 3, F.5*F.8*F.10);;
gap> SetConjugate(coll, 6, 1, F.6*F.8*F.9);;
gap> SetConjugate(coll, 6, 3, F.6*F.10);;
gap> SetConjugate(coll, 6, 4, F.6*F.10);;
gap> SetConjugate(coll, 6, 5, F.6*F.10);;
gap> SetConjugate(coll, 7, 1, F.7*F.8*F.9);;
gap> SetConjugate(coll, 7, 2, F.7*F.8);;
gap> SetConjugate(coll, 7, 3, F.7*F.8*F.9*F.10);;
gap> SetConjugate(coll, 7, 4, F.7*F.10);;
gap> SetConjugate(coll, 7, 5, F.7*F.10);;
gap> SetConjugate(coll, 7, 6, F.7*F.10);;
gap> SetConjugate(coll, 8, 2, F.8*F.10);;
gap> SetConjugate(coll, 8, 3, F.8*F.10);;
gap> SetConjugate(coll, 9, 1, F.9*F.10);;
gap> SetConjugate(coll, 9, 2, F.9*F.10);;
gap> UpdatePolycyclicCollector(coll);;
gap> G := GroupByRws(coll);