Finite Group DatabasebetaFinite Group Databasebeta| order | 1024 |
| nilpotency class | 6 |
| automorphism | ? |
| homology | Abelianization (H1) = C24 · Schur multiplier (H2) = C26 |
No aliases for this group.
| subgroup | G/H | |
|---|---|---|
| center, socle | C2 | C2×#13674 |
| commutator, Frattini, cosocle | #492 | C24 |
| LCS | G ▷ #492 ▷ C42 ▷ C2×C4 ▷ C22 ▷ C2 ▷ C1 | |
| UCS | C1 ◁ C2 ◁ C23 ◁ C22×C4 ◁ C2×C42 ◁ C2×#492 ◁ G | |
| LECS | G ▷ #492 ▷ C42 ▷ C2×C4 ▷ C22 ▷ C2 ▷ C1 | |
1492 conjugacy classes of subgroups; only the 115 normal subgroups are shown.
This group has 1492 conjugacy classes of subgroups — too many to draw. Only its 115 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 — 4 generators on 32 points:
(1,2)(3,10)(4,17,22,23,20,32,21,29)(5,11)(6,8)(7,16)(9,19,30,31,26,18,28,12)(13,27)(14,25)(15,24);(1,3)(2,7)(4,18,21,31,20,19,22,12)(5,14)(6,16)(8,10)(9,17,28,29,26,32,30,23)(11,24)(13,15)(25,27);(2,8)(7,10)(9,26)(11,27)(17,32)(23,29)(24,25)(28,30);(1,4)(2,9)(3,12)(5,22)(6,20)(7,23)(8,26)(10,29)(11,30)(13,21)(14,18)(15,19)(16,31)(17,24)(25,32)(27,28)Polycyclic presentation:
2^10|a^2=ghi,b^2=ghj,e^2=hj,g^2=i,h^2=j,b^a=bi,c^a=cj,d^a=de,d^b=df,e^b=eg,e^d=eh,f^a=fghj,f^b=fh,f^e=fh,g^b=gi,g^d=gh,g^f=gi,h^b=hi,h^d=hj,h^f=hj,i^d=ij55 conjugacy classes — view the full character table.
| maximal subgroup of | #72306774 |
| maximal normal subgroup of | #72306774 |
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.7*F.8*F.9);;
gap> SetPower(coll, 2, F.7*F.8*F.10);;
gap> SetPower(coll, 5, F.8*F.10);;
gap> SetPower(coll, 7, F.9);;
gap> SetPower(coll, 8, F.10);;
gap> SetConjugate(coll, 2, 1, F.2*F.9);;
gap> SetConjugate(coll, 3, 1, F.3*F.10);;
gap> SetConjugate(coll, 4, 1, F.4*F.5);;
gap> SetConjugate(coll, 4, 2, F.4*F.6);;
gap> SetConjugate(coll, 5, 2, F.5*F.7);;
gap> SetConjugate(coll, 5, 4, F.5*F.8);;
gap> SetConjugate(coll, 6, 1, F.6*F.7*F.8*F.10);;
gap> SetConjugate(coll, 6, 2, F.6*F.8);;
gap> SetConjugate(coll, 6, 5, F.6*F.8);;
gap> SetConjugate(coll, 7, 2, F.7*F.9);;
gap> SetConjugate(coll, 7, 4, F.7*F.8);;
gap> SetConjugate(coll, 7, 6, F.7*F.9);;
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, 4, F.9*F.10);;
gap> UpdatePolycyclicCollector(coll);;
gap> G := GroupByRws(coll);