Finite Group DatabasebetaFinite Group Databasebeta| order | 1024 |
| nilpotency class | 4 |
| automorphism | ? |
| homology | Abelianization (H1) = C22×C4 · Schur multiplier (H2) = C23×C4 |
No aliases for this group.
| subgroup | G/H | |
|---|---|---|
| center, socle | C22 | #9495 |
| commutator | C23×D4 | C22×C4 |
| Frattini, cosocle | C22×#127 | C23 |
| prime radical | #35527 | C22 |
| LCS | G ▷ C23×D4 ▷ C24 ▷ C22 ▷ C1 | |
| UCS | C1 ◁ C22 ◁ C24 ◁ C22×#127 ◁ G | |
| LECS | G ▷ C22×#127 ▷ C24 ▷ C22 ▷ C1 | |
1600 conjugacy classes of subgroups; only the 69 normal subgroups are shown.
This group has 1600 conjugacy classes of subgroups — too many to draw. Only its 69 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) = 128 |
A minimal faithful permutation representation — 3 generators on 32 points:
(2,6,8,13)(3,9,11,14)(4,12)(15,16)(17,18)(19,25,26,31)(20,28)(21,24)(22,27,32,29)(23,30);(1,2,5,8)(3,10,11,7)(4,13)(6,12)(9,16)(14,15)(17,18)(19,22)(20,28,30,23)(21,24)(25,27,31,29)(26,32);(1,3)(2,7)(4,14)(5,11)(6,15)(8,10)(9,12)(13,16)(17,19,21,26)(18,22,24,32)(20,29,30,27)(23,31,28,25)Polycyclic presentation:
2^10|a^2=g,b^2=e,c^2=j,f^2=j,b^a=bd,c^a=cdfj,c^b=ci,d^a=di,d^b=dg,d^c=dh,e^a=eg,e^d=ei,f^a=fj,f^b=fghj,f^c=fh,f^d=fj,f^e=fj,g^b=gi,g^c=gij,h^a=hj,h^b=hij49 conjugacy classes — view the full character table.
| maximal subgroup of | #72337666, #72337668, #72337671, … |
| maximal normal subgroup of | #72337666, #72337668, #72337671, … |
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);;
gap> SetPower(coll, 2, F.5);;
gap> SetPower(coll, 3, F.10);;
gap> SetPower(coll, 6, F.10);;
gap> SetConjugate(coll, 2, 1, F.2*F.4);;
gap> SetConjugate(coll, 3, 1, F.3*F.4*F.6*F.10);;
gap> SetConjugate(coll, 3, 2, F.3*F.9);;
gap> SetConjugate(coll, 4, 1, F.4*F.9);;
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.7);;
gap> SetConjugate(coll, 5, 4, F.5*F.9);;
gap> SetConjugate(coll, 6, 1, F.6*F.10);;
gap> SetConjugate(coll, 6, 2, F.6*F.7*F.8*F.10);;
gap> SetConjugate(coll, 6, 3, F.6*F.8);;
gap> SetConjugate(coll, 6, 4, F.6*F.10);;
gap> SetConjugate(coll, 6, 5, F.6*F.10);;
gap> SetConjugate(coll, 7, 2, F.7*F.9);;
gap> SetConjugate(coll, 7, 3, F.7*F.9*F.10);;
gap> SetConjugate(coll, 8, 1, F.8*F.10);;
gap> SetConjugate(coll, 8, 2, F.8*F.9*F.10);;
gap> UpdatePolycyclicCollector(coll);;
gap> G := GroupByRws(coll);