| order | 1024 |
| nilpotency class | 6 |
| automorphism | ? |
| homology | Abelianization (H1) = C22×C4 · Schur multiplier (H2) = C22×C4 |
No aliases for this group.
| subgroup | G/H | |
|---|---|---|
| center, socle | C2 | #149761 |
| commutator | C23×D4 | C22×C4 |
| Frattini, cosocle | #1781 | C23 |
| prime radical | #35527 | C4 |
| LCS | G ▷ C23×D4 ▷ C24 ▷ C23 ▷ C22 ▷ C2 ▷ C1 | |
| UCS | C1 ◁ C2 ◁ C22 ◁ C24 ◁ C23×D4 ◁ #20586 ◁ G | |
| LECS | G ▷ #1781 ▷ C25 ▷ C23 ▷ C22 ▷ C2 ▷ C1 | |
1113 conjugacy classes of subgroups; only the 57 normal subgroups are shown.
This group has 1113 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:
(1,2)(3,11)(4,17)(5,21,24,9)(6,20)(7,10)(8,14,26,22)(12,23,28,19)(13,29)(15,31,25,30)(16,27)(18,32);(1,3,12,29)(2,8,19,30)(4,18,21,11,20,13,9,27)(5,22,17,25,24,14,6,15)(7,16,28,32)(10,26,23,31);(1,4)(2,6)(3,13)(5,23)(7,20)(8,25)(9,28)(10,17)(11,29)(12,21)(14,30)(15,26)(16,18)(19,24)(22,31)(27,32)Polycyclic presentation:
2^10|a^2=fgj,b^2=deg,e^2=g,b^a=bd,c^a=cij,c^b=cfghi,d^a=dhi,d^b=df,d^c=dj,e^a=efh,e^b=ef,e^c=ehj,e^d=ehj,f^a=fij,f^b=fh,f^c=fj,f^e=fi,g^a=gij,g^b=gi,g^c=gj,g^d=gj,h^a=hj,h^b=hi,h^e=hj,i^b=ij40 conjugacy classes — view the full character table.
| maximal subgroup of | #72285637, #72285692, #72285722, … |
| maximal normal subgroup of | #72285637, #72285692, #72285722, … |
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*F.7*F.10);;
gap> SetPower(coll, 2, F.4*F.5*F.7);;
gap> SetPower(coll, 5, F.7);;
gap> SetConjugate(coll, 2, 1, F.2*F.4);;
gap> SetConjugate(coll, 3, 1, F.3*F.9*F.10);;
gap> SetConjugate(coll, 3, 2, F.3*F.6*F.7*F.8*F.9);;
gap> SetConjugate(coll, 4, 1, F.4*F.8*F.9);;
gap> SetConjugate(coll, 4, 2, F.4*F.6);;
gap> SetConjugate(coll, 4, 3, F.4*F.10);;
gap> SetConjugate(coll, 5, 1, F.5*F.6*F.8);;
gap> SetConjugate(coll, 5, 2, F.5*F.6);;
gap> SetConjugate(coll, 5, 3, F.5*F.8*F.10);;
gap> SetConjugate(coll, 5, 4, F.5*F.8*F.10);;
gap> SetConjugate(coll, 6, 1, F.6*F.9*F.10);;
gap> SetConjugate(coll, 6, 2, F.6*F.8);;
gap> SetConjugate(coll, 6, 3, F.6*F.10);;
gap> SetConjugate(coll, 6, 5, F.6*F.9);;
gap> SetConjugate(coll, 7, 1, F.7*F.9*F.10);;
gap> SetConjugate(coll, 7, 2, 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, 8, 1, F.8*F.10);;
gap> SetConjugate(coll, 8, 2, F.8*F.9);;
gap> SetConjugate(coll, 8, 5, F.8*F.10);;
gap> SetConjugate(coll, 9, 2, F.9*F.10);;
gap> UpdatePolycyclicCollector(coll);;
gap> G := GroupByRws(coll);