Finite Group DatabasebetaFinite Group Databasebeta| order | 1024 |
| nilpotency class | 5 |
| automorphism | ? |
| homology | Abelianization (H1) = C82 · Schur multiplier (H2) = C2×C4 |
No aliases for this group.
| subgroup | G/H | |
|---|---|---|
| center | C2×C4 | #1368 |
| commutator | C16 | C82 |
| Frattini, cosocle | C4×#346 | C22 |
| socle | C22 | #7156 |
| prime radical | C23 | #1383 |
| LCS | G ▷ C16 ▷ C8 ▷ C4 ▷ C2 ▷ C1 | |
| UCS | C1 ◁ C2×C4 ◁ C2×C42 ◁ C42×C8 ◁ C4×#346 ◁ G | |
| LECS | G ▷ C4×#346 ▷ C22×C8 ▷ C4 ▷ C2 ▷ C1 | |
308 conjugacy classes of subgroups.
Polycyclic presentation:
2^10|a^2=c,b^2=d,c^2=f,d^2=g,e^2=hij,f^2=i,h^2=i,i^2=j,b^a=be,c^b=ch,d^a=di,d^c=dj,e^b=ehi,e^d=ej,f^b=fi,g^a=gj,h^b=hi,i^b=ij136 conjugacy classes — view the full character table.
| maximal subgroup of | #72223654, #72223670, C8×#7457, … |
| maximal normal subgroup of | #72223654, #72223670, C8×#7457, … |
| maximal quotient of | C2×#72223652, #72227251 |
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.3);;
gap> SetPower(coll, 2, F.4);;
gap> SetPower(coll, 3, F.6);;
gap> SetPower(coll, 4, F.7);;
gap> SetPower(coll, 5, F.8*F.9*F.10);;
gap> SetPower(coll, 6, F.9);;
gap> SetPower(coll, 8, F.9);;
gap> SetPower(coll, 9, F.10);;
gap> SetConjugate(coll, 2, 1, F.2*F.5);;
gap> SetConjugate(coll, 3, 2, F.3*F.8);;
gap> SetConjugate(coll, 4, 1, F.4*F.9);;
gap> SetConjugate(coll, 4, 3, F.4*F.10);;
gap> SetConjugate(coll, 5, 2, F.5*F.8*F.9);;
gap> SetConjugate(coll, 5, 4, F.5*F.10);;
gap> SetConjugate(coll, 6, 2, F.6*F.9);;
gap> SetConjugate(coll, 7, 1, F.7*F.10);;
gap> SetConjugate(coll, 8, 2, F.8*F.9);;
gap> SetConjugate(coll, 9, 2, F.9*F.10);;
gap> UpdatePolycyclicCollector(coll);;
gap> G := GroupByRws(coll);