Finite Group DatabasebetaFinite Group Databasebeta| order | 1024 |
| nilpotency class | 5 |
| automorphism | ? |
| homology | Abelianization (H1) = C22×C4 · Schur multiplier (H2) = C25×C4 |
No aliases for this group.
| subgroup | G/H | |
|---|---|---|
| center, socle | C2 | #134020 |
| commutator | C22×#41 | C22×C4 |
| Frattini, cosocle | C2×#535 | C23 |
| prime radical | #6443331 | C2 |
| LCS | G ▷ C22×#41 ▷ C22×C4 ▷ C22 ▷ C2 ▷ C1 | |
| UCS | C1 ◁ C2 ◁ C23 ◁ C23×C4 ◁ #35272 ◁ G | |
| LECS | G ▷ C2×#535 ▷ C22×C4 ▷ C22 ▷ C2 ▷ C1 | |
2839 conjugacy classes of subgroups; only the 99 normal subgroups are shown.
This group has 2839 conjugacy classes of subgroups — too many to draw. Only its 99 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,5,10)(3,12,16,30)(4,17,18,8)(6,9,20,11)(7,22,25,14)(13,27,31,24)(15,29,32,23)(19,26,21,28);(1,3)(2,7,9,24,10,25,11,27)(4,13,18,31)(5,16)(6,15)(8,23,26,12,17,29,28,30)(14,19,22,21)(20,32);(3,13,16,31)(7,23,25,29)(12,24,30,27)(14,15,22,32)Polycyclic presentation:
2^10|a^2=j,b^2=e,c^2=g,d^2=j,e^2=i,h^2=j,b^a=bd,c^a=cg,c^b=cdf,d^a=dj,d^b=dh,e^a=eh,e^c=eg,e^d=eij,f^b=fghj,f^e=fi,g^b=gj,h^a=hj,h^b=hi,h^d=hj,h^f=hj,i^a=ij52 conjugacy classes — view the full character table.
| maximal subgroup of | #72318082, #72318178, #72338471, … |
| maximal normal subgroup of | #72318082, #72318178, #72338471, … |
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.5);;
gap> SetPower(coll, 3, F.7);;
gap> SetPower(coll, 4, F.10);;
gap> SetPower(coll, 5, F.9);;
gap> SetPower(coll, 8, F.10);;
gap> SetConjugate(coll, 2, 1, F.2*F.4);;
gap> SetConjugate(coll, 3, 1, F.3*F.7);;
gap> SetConjugate(coll, 3, 2, F.3*F.4*F.6);;
gap> SetConjugate(coll, 4, 1, F.4*F.10);;
gap> SetConjugate(coll, 4, 2, F.4*F.8);;
gap> SetConjugate(coll, 5, 1, F.5*F.8);;
gap> SetConjugate(coll, 5, 3, F.5*F.7);;
gap> SetConjugate(coll, 5, 4, F.5*F.9*F.10);;
gap> SetConjugate(coll, 6, 2, F.6*F.7*F.8*F.10);;
gap> SetConjugate(coll, 6, 5, F.6*F.9);;
gap> SetConjugate(coll, 7, 2, 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, 4, F.8*F.10);;
gap> SetConjugate(coll, 8, 6, F.8*F.10);;
gap> SetConjugate(coll, 9, 1, F.9*F.10);;
gap> UpdatePolycyclicCollector(coll);;
gap> G := GroupByRws(coll);