| order | 1024 |
| nilpotency class | 5 |
| automorphism | ? |
| homology | Abelianization (H1) = C23 · Schur multiplier (H2) = C24 |
No aliases for this group.
| subgroup | G/H | |
|---|---|---|
| center, socle | C22 | #13343 |
| commutator, Frattini, cosocle | #2297 | C23 |
| prime radical | C2×#585 | D4 |
| LCS | G ▷ #2297 ▷ C22×C4 ▷ C22 ▷ C2 ▷ C1 | |
| UCS | C1 ◁ C22 ◁ C22×C4 ◁ C23×C4 ◁ #2297 ◁ G | |
| LECS | G ▷ #2297 ▷ C22×C4 ▷ C22 ▷ C2 ▷ C1 | |
1301 conjugacy classes of subgroups; only the 61 normal subgroups are shown.
This group has 1301 conjugacy classes of subgroups — too many to draw. Only its 61 normal subgroups are shown.
Dotted edges: containments with no intermediate normal subgroup — omitted non-normal subgroups may lie between.
| minimal degree | μ(G) = 32 |
| transitive degree | μt(G) = 64 |
A minimal faithful permutation representation — 3 generators on 32 points:
(1,2)(3,9)(4,12)(5,8)(6,11)(7,14)(10,16)(13,15)(17,18,24,23)(19,28,32,26)(20,31,30,25)(21,29,27,22);(6,15)(9,16)(17,19,24,32)(18,25,23,31)(20,27,30,21)(22,26,29,28);(1,3,5,10)(2,6,8,15)(4,13,14,11)(7,16,12,9)(17,20,24,30)(18,26,23,28)(19,29,32,22)(21,31,27,25)Polycyclic presentation:
2^10|a^2=j,b^2=j,c^2=h,d^2=j,e^2=h,f^2=j,g^2=j,b^a=bd,c^a=ce,c^b=cf,d^a=dj,d^b=dj,d^c=dg,e^a=eh,e^b=eghi,e^c=eh,e^d=eij,f^a=fhj,f^b=fj,f^c=fj,g^a=gi,g^c=gj,g^d=gj,g^e=gj,i^b=ij,i^c=ij58 conjugacy classes — view the full character table.
| maximal subgroup of | #72227663 |
| maximal quotient of | #72227656 |
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.10);;
gap> SetPower(coll, 2, F.10);;
gap> SetPower(coll, 3, F.8);;
gap> SetPower(coll, 4, F.10);;
gap> SetPower(coll, 5, F.8);;
gap> SetPower(coll, 6, F.10);;
gap> SetPower(coll, 7, F.10);;
gap> SetConjugate(coll, 2, 1, F.2*F.4);;
gap> SetConjugate(coll, 3, 1, F.3*F.5);;
gap> SetConjugate(coll, 3, 2, F.3*F.6);;
gap> SetConjugate(coll, 4, 1, F.4*F.10);;
gap> SetConjugate(coll, 4, 2, F.4*F.10);;
gap> SetConjugate(coll, 4, 3, F.4*F.7);;
gap> SetConjugate(coll, 5, 1, F.5*F.8);;
gap> SetConjugate(coll, 5, 2, F.5*F.7*F.8*F.9);;
gap> SetConjugate(coll, 5, 3, F.5*F.8);;
gap> SetConjugate(coll, 5, 4, F.5*F.9*F.10);;
gap> SetConjugate(coll, 6, 1, F.6*F.8*F.10);;
gap> SetConjugate(coll, 6, 2, F.6*F.10);;
gap> SetConjugate(coll, 6, 3, F.6*F.10);;
gap> SetConjugate(coll, 7, 1, F.7*F.9);;
gap> SetConjugate(coll, 7, 3, F.7*F.10);;
gap> SetConjugate(coll, 7, 4, F.7*F.10);;
gap> SetConjugate(coll, 7, 5, F.7*F.10);;
gap> SetConjugate(coll, 9, 2, F.9*F.10);;
gap> SetConjugate(coll, 9, 3, F.9*F.10);;
gap> UpdatePolycyclicCollector(coll);;
gap> G := GroupByRws(coll);