Finite Group DatabasebetaFinite Group Databasebeta| order | 1024 |
| nilpotency class | 2 |
| automorphism | ? |
| homology | Abelianization (H1) = C25×C8 · Schur multiplier (H2) = C213 |
No aliases for this group.
| subgroup | G/H | |
|---|---|---|
| center, Frattini, cosocle | C2×C8 | C26 |
| commutator, socle | C22 | C25×C8 |
| prime radical | #412 | C4 |
| LCS | G ▷ C22 ▷ C1 | |
| UCS | C1 ◁ C2×C8 ◁ G | |
| LECS | G ▷ C2×C8 ▷ C4 ▷ C2 ▷ C1 | |
8980 conjugacy classes of subgroups.
| transitive degree | μt(G) = 256 |
Polycyclic presentation:
2^10|d^2=g,f^2=h,g^2=i,i^2=j,b^a=bh,c^b=ch,d^b=dhj,e^a=eh,e^c=ej,e^d=ej,f^d=fj304 conjugacy classes — view the full character table.
| maximal subgroup of | #72287792, #72287813, #72287831, … |
| maximal normal subgroup of | #72287792, #72287813, #72287831, … |
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, 4, F.7);;
gap> SetPower(coll, 6, F.8);;
gap> SetPower(coll, 7, F.9);;
gap> SetPower(coll, 9, F.10);;
gap> SetConjugate(coll, 2, 1, F.2*F.8);;
gap> SetConjugate(coll, 3, 2, F.3*F.8);;
gap> SetConjugate(coll, 4, 2, F.4*F.8*F.10);;
gap> SetConjugate(coll, 5, 1, F.5*F.8);;
gap> SetConjugate(coll, 5, 3, F.5*F.10);;
gap> SetConjugate(coll, 5, 4, F.5*F.10);;
gap> SetConjugate(coll, 6, 4, F.6*F.10);;
gap> UpdatePolycyclicCollector(coll);;
gap> G := GroupByRws(coll);