Finite Group DatabasebetaFinite Group Databasebeta| order | 1024 |
| nilpotency class | 4 |
| automorphism | ? |
| homology | Abelianization (H1) = C24 · Schur multiplier (H2) = C26 |
No aliases for this group.
| subgroup | G/H | |
|---|---|---|
| center | C2×C4 | #2011 |
| commutator, Frattini, cosocle | C2×C4×C8 | C24 |
| socle | C22 | C2×#2011 |
| LCS | G ▷ C2×C4×C8 ▷ C2×C4 ▷ C2 ▷ C1 | |
| UCS | C1 ◁ C2×C4 ◁ C22×C42 ◁ C2×#1744 ◁ G | |
| LECS | G ▷ C2×C4×C8 ▷ C2×C4 ▷ C2 ▷ C1 | |
2962 conjugacy classes of subgroups.
Polycyclic presentation:
2^10|b^2=i,d^2=g,e^2=hj,f^2=ij,h^2=j,b^a=be,c^a=cj,d^a=df,d^b=dg,e^a=eh,e^b=eh,e^d=ei,f^a=fij,f^b=fj,g^a=gij,h^a=hj,h^b=hj100 conjugacy classes — view the full character table.
| maximal subgroup of | C2×#72213530, #72213847, #72216677, … |
| maximal normal subgroup of | C2×#72213530, #72213847, #72216677, … |
| maximal quotient of | #72213539, C2×#72213530 |
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, 2, F.9);;
gap> SetPower(coll, 4, F.7);;
gap> SetPower(coll, 5, F.8*F.10);;
gap> SetPower(coll, 6, F.9*F.10);;
gap> SetPower(coll, 8, F.10);;
gap> SetConjugate(coll, 2, 1, F.2*F.5);;
gap> SetConjugate(coll, 3, 1, F.3*F.10);;
gap> SetConjugate(coll, 4, 1, F.4*F.6);;
gap> SetConjugate(coll, 4, 2, F.4*F.7);;
gap> SetConjugate(coll, 5, 1, F.5*F.8);;
gap> SetConjugate(coll, 5, 2, F.5*F.8);;
gap> SetConjugate(coll, 5, 4, F.5*F.9);;
gap> SetConjugate(coll, 6, 1, F.6*F.9*F.10);;
gap> SetConjugate(coll, 6, 2, F.6*F.10);;
gap> SetConjugate(coll, 7, 1, F.7*F.9*F.10);;
gap> SetConjugate(coll, 8, 1, F.8*F.10);;
gap> SetConjugate(coll, 8, 2, F.8*F.10);;
gap> UpdatePolycyclicCollector(coll);;
gap> G := GroupByRws(coll);