Finite Group DatabasebetaFinite Group Databasebeta| order | 1024 |
| nilpotency class | 5 |
| automorphism | ? |
| homology | Abelianization (H1) = C22×C4 · Schur multiplier (H2) = C24 |
No aliases for this group.
| subgroup | G/H | |
|---|---|---|
| center, socle | C2 | #140024 |
| commutator | #379 | C22×C4 |
| Frattini, cosocle | #2308 | C23 |
| prime radical | #485605 | C2 |
| LCS | G ▷ #379 ▷ C24 ▷ C22 ▷ C2 ▷ C1 | |
| UCS | C1 ◁ C2 ◁ C23 ◁ C25 ◁ #2308 ◁ G | |
| LECS | G ▷ #2308 ▷ C24 ▷ C22 ▷ C2 ▷ C1 | |
1291 conjugacy classes of subgroups; only the 67 normal subgroups are shown.
This group has 1291 conjugacy classes of subgroups — too many to draw. Only its 67 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,6)(4,8,17,26)(5,9,21,27)(7,10)(11,16,25,29)(12,22,18,20)(13,23)(14,28)(15,24)(19,30)(31,32);(1,3,6,2)(4,14,29,30,17,31,16,24)(5,18,22,9)(7,13,23,10)(8,15,11,28,26,19,25,32)(12,20,27,21);(1,4)(2,8)(3,11)(5,19)(6,16)(7,17)(9,24)(10,26)(12,14)(13,25)(15,21)(18,31)(20,28)(22,32)(23,29)(27,30)Polycyclic presentation:
2^10|a^2=f,b^2=ef,d^2=h,e^2=hi,b^a=be,c^a=cgj,c^b=cd,d^a=dg,d^b=dgh,d^c=dh,e^b=ehi,e^c=egj,e^d=ei,f^b=fhi,f^c=fj,f^d=fj,g^a=gj,g^b=gi,g^d=gj,g^e=gj,h^a=hj,h^b=hj,i^a=ij,i^b=ij,i^c=ij55 conjugacy classes — view the full character table.
| maximal subgroup of | #72237863, #72237880, #72237891, … |
| maximal normal subgroup of | #72237863, #72237880, #72237891, … |
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);;
gap> SetPower(coll, 2, F.5*F.6);;
gap> SetPower(coll, 4, F.8);;
gap> SetPower(coll, 5, F.8*F.9);;
gap> SetConjugate(coll, 2, 1, F.2*F.5);;
gap> SetConjugate(coll, 3, 1, F.3*F.7*F.10);;
gap> SetConjugate(coll, 3, 2, F.3*F.4);;
gap> SetConjugate(coll, 4, 1, F.4*F.7);;
gap> SetConjugate(coll, 4, 2, F.4*F.7*F.8);;
gap> SetConjugate(coll, 4, 3, F.4*F.8);;
gap> SetConjugate(coll, 5, 2, F.5*F.8*F.9);;
gap> SetConjugate(coll, 5, 3, F.5*F.7*F.10);;
gap> SetConjugate(coll, 5, 4, F.5*F.9);;
gap> SetConjugate(coll, 6, 2, F.6*F.8*F.9);;
gap> SetConjugate(coll, 6, 3, F.6*F.10);;
gap> SetConjugate(coll, 6, 4, F.6*F.10);;
gap> SetConjugate(coll, 7, 1, F.7*F.10);;
gap> SetConjugate(coll, 7, 2, F.7*F.9);;
gap> SetConjugate(coll, 7, 4, F.7*F.10);;
gap> SetConjugate(coll, 7, 5, F.7*F.10);;
gap> SetConjugate(coll, 8, 1, F.8*F.10);;
gap> SetConjugate(coll, 8, 2, F.8*F.10);;
gap> SetConjugate(coll, 9, 1, F.9*F.10);;
gap> SetConjugate(coll, 9, 2, F.9*F.10);;
gap> SetConjugate(coll, 9, 3, F.9*F.10);;
gap> UpdatePolycyclicCollector(coll);;
gap> G := GroupByRws(coll);