| order | 1024 |
| nilpotency class | 5 |
| automorphism | ? |
| homology | Abelianization (H1) = C23 · Schur multiplier (H2) = C25 |
No aliases for this group.
| subgroup | G/H | |
|---|---|---|
| center, socle | C2 | #142969 |
| commutator, Frattini, cosocle | #2309 | C23 |
| LCS | G ▷ #2309 ▷ C24 ▷ C22 ▷ C2 ▷ C1 | |
| UCS | C1 ◁ C2 ◁ C23 ◁ C23×C4 ◁ #2309 ◁ G | |
| LECS | G ▷ #2309 ▷ C24 ▷ C22 ▷ C2 ▷ C1 | |
1336 conjugacy classes of subgroups; only the 57 normal subgroups are shown.
This group has 1336 conjugacy classes of subgroups — too many to draw. Only its 57 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) = 32 |
A minimal faithful permutation representation — 3 generators on 32 points:
(2,7)(3,11)(8,24)(9,22)(10,23)(12,30)(14,31)(15,16)(18,29)(21,25)(26,27)(28,32);(1,2,5,7)(3,12,18,26,15,8,14,21)(4,9,17,22)(6,10,20,23)(11,25,31,24,16,27,29,30)(13,28,19,32);(1,3,13,11,6,15,4,16)(2,8,9,27,10,12,28,25)(5,18,19,31,20,14,17,29)(7,21,22,30,23,26,32,24)Polycyclic presentation:
2^10|b^2=fh,c^2=deh,f^2=h,b^a=bf,c^a=cd,c^b=ce,d^b=dg,d^c=dh,e^a=eh,e^b=eghj,e^c=ehj,e^d=ej,f^a=fh,f^c=fgh,f^d=fij,f^e=fij,g^a=gi,g^b=gij,g^c=gj,g^f=gj,h^c=hj,i^b=ij40 conjugacy classes — view the full character table.
| maximal subgroup of | #72285412, #72285878, #72285997, … |
| maximal normal subgroup of | #72285412, #72285878, #72285997, … |
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, 2, F.6*F.8);;
gap> SetPower(coll, 3, F.4*F.5*F.8);;
gap> SetPower(coll, 6, F.8);;
gap> SetConjugate(coll, 2, 1, F.2*F.6);;
gap> SetConjugate(coll, 3, 1, F.3*F.4);;
gap> SetConjugate(coll, 3, 2, F.3*F.5);;
gap> SetConjugate(coll, 4, 2, F.4*F.7);;
gap> SetConjugate(coll, 4, 3, F.4*F.8);;
gap> SetConjugate(coll, 5, 1, F.5*F.8);;
gap> SetConjugate(coll, 5, 2, F.5*F.7*F.8*F.10);;
gap> SetConjugate(coll, 5, 3, F.5*F.8*F.10);;
gap> SetConjugate(coll, 5, 4, F.5*F.10);;
gap> SetConjugate(coll, 6, 1, F.6*F.8);;
gap> SetConjugate(coll, 6, 3, F.6*F.7*F.8);;
gap> SetConjugate(coll, 6, 4, F.6*F.9*F.10);;
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.9*F.10);;
gap> SetConjugate(coll, 7, 3, F.7*F.10);;
gap> SetConjugate(coll, 7, 6, F.7*F.10);;
gap> SetConjugate(coll, 8, 3, F.8*F.10);;
gap> SetConjugate(coll, 9, 2, F.9*F.10);;
gap> UpdatePolycyclicCollector(coll);;
gap> G := GroupByRws(coll);