| order | 1024 |
| nilpotency class | 4 |
| automorphism | ? |
| homology | Abelianization (H1) = C25 · Schur multiplier (H2) = C29 |
No aliases for this group.
| subgroup | G/H | |
|---|---|---|
| center, socle | C22 | C22×B(4,𝔽2) |
| commutator, Frattini, cosocle | C2×C22⋊C4 | C25 |
| LCS | G ▷ C2×C22⋊C4 ▷ C23 ▷ C2 ▷ C1 | |
| UCS | C1 ◁ C22 ◁ C2×C42 ◁ C2×C4×#41 ◁ G | |
| LECS | G ▷ C2×C22⋊C4 ▷ C23 ▷ C2 ▷ C1 | |
5616 conjugacy classes of subgroups.
| minimal degree | μ(G) = 32 |
| transitive degree | μt(G) = 128 |
A minimal faithful permutation representation — 5 generators on 32 points:
(2,6)(3,9)(4,12)(7,13)(8,15)(10,14)(17,18,22,25)(19,26,21,24)(20,28,30,32)(23,27,31,29);(1,2)(3,10)(4,13)(5,7)(6,12)(8,9)(11,14)(15,16)(24,26)(28,32);(2,7)(3,9)(6,13)(11,16)(17,19)(20,29)(21,22)(23,31)(27,30)(28,32);(1,3)(2,8)(4,11)(5,9)(6,14)(7,10)(12,16)(13,15)(17,20)(18,23)(19,27)(21,29)(22,30)(24,28)(25,31)(26,32);(3,9)(8,10)(11,16)(14,15)(18,24,25,26)(19,21)(23,32,31,28)(27,29)Polycyclic presentation:
2^10|a^2=j,e^2=hj,f^2=i,g^2=ij,b^a=bf,c^a=cfgij,c^b=ci,d^a=dfg,d^b=di,d^c=dij,e^a=efgi,e^b=ehj,e^c=eh,e^d=ehij,f^a=fi,f^b=fi,f^c=fh,f^d=fh,f^e=fhj,g^a=gi,g^b=ghij,g^c=gh,g^d=gh,g^e=gh,g^f=gj,h^a=hj76 conjugacy classes — view the full character table.
| maximal subgroup of | #72308157, #72316995 |
| maximal normal subgroup of | #72308157, #72316995 |
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, 5, F.8*F.10);;
gap> SetPower(coll, 6, F.9);;
gap> SetPower(coll, 7, F.9*F.10);;
gap> SetConjugate(coll, 2, 1, F.2*F.6);;
gap> SetConjugate(coll, 3, 1, F.3*F.6*F.7*F.9*F.10);;
gap> SetConjugate(coll, 3, 2, F.3*F.9);;
gap> SetConjugate(coll, 4, 1, F.4*F.6*F.7);;
gap> SetConjugate(coll, 4, 2, F.4*F.9);;
gap> SetConjugate(coll, 4, 3, F.4*F.9*F.10);;
gap> SetConjugate(coll, 5, 1, F.5*F.6*F.7*F.9);;
gap> SetConjugate(coll, 5, 2, F.5*F.8*F.10);;
gap> SetConjugate(coll, 5, 3, F.5*F.8);;
gap> SetConjugate(coll, 5, 4, F.5*F.8*F.9*F.10);;
gap> SetConjugate(coll, 6, 1, F.6*F.9);;
gap> SetConjugate(coll, 6, 2, F.6*F.9);;
gap> SetConjugate(coll, 6, 3, F.6*F.8);;
gap> SetConjugate(coll, 6, 4, F.6*F.8);;
gap> SetConjugate(coll, 6, 5, F.6*F.8*F.10);;
gap> SetConjugate(coll, 7, 1, F.7*F.9);;
gap> SetConjugate(coll, 7, 2, F.7*F.8*F.9*F.10);;
gap> SetConjugate(coll, 7, 3, F.7*F.8);;
gap> SetConjugate(coll, 7, 4, F.7*F.8);;
gap> SetConjugate(coll, 7, 5, F.7*F.8);;
gap> SetConjugate(coll, 7, 6, F.7*F.10);;
gap> SetConjugate(coll, 8, 1, F.8*F.10);;
gap> UpdatePolycyclicCollector(coll);;
gap> G := GroupByRws(coll);