Finite Group DatabasebetaFinite Group Databasebeta| order | 1024 |
| nilpotency class | 4 |
| automorphism | ? |
| homology | Abelianization (H1) = C25 · Schur multiplier (H2) = C29 |
No aliases for this group.
| subgroup | G/H | |
|---|---|---|
| center, socle | C2 | C2×D82 |
| commutator, Frattini, cosocle | C4×C8 | C25 |
| LCS | G ▷ C4×C8 ▷ C2×C4 ▷ C2 ▷ C1 | |
| UCS | C1 ◁ C2 ◁ C22×C4 ◁ C2×C4×C8 ◁ G | |
| LECS | G ▷ C4×C8 ▷ C2×C4 ▷ C2 ▷ C1 | |
2884 conjugacy classes of subgroups.
Polycyclic presentation:
2^10|d^2=fh,e^2=gi,f^2=h,g^2=ij,i^2=j,c^a=cj,d^a=dg,d^b=df,e^a=eg,e^b=eg,e^c=ej,f^a=fi,f^b=fh,g^a=gi,g^b=gi,h^a=hj,i^a=ij,i^b=ij106 conjugacy classes — view the full character table.
| maximal subgroup of | #72214294, #72214534, #72214669, … |
| maximal normal subgroup of | #72214294, #72214534, #72214669, … |
| maximal quotient of | #72216420, #72226972, C3×#72214134 |
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.6*F.8);;
gap> SetPower(coll, 5, F.7*F.9);;
gap> SetPower(coll, 6, F.8);;
gap> SetPower(coll, 7, F.9*F.10);;
gap> SetPower(coll, 9, F.10);;
gap> SetConjugate(coll, 3, 1, F.3*F.10);;
gap> SetConjugate(coll, 4, 1, F.4*F.7);;
gap> SetConjugate(coll, 4, 2, F.4*F.6);;
gap> SetConjugate(coll, 5, 1, F.5*F.7);;
gap> SetConjugate(coll, 5, 2, F.5*F.7);;
gap> SetConjugate(coll, 5, 3, F.5*F.10);;
gap> SetConjugate(coll, 6, 1, F.6*F.9);;
gap> SetConjugate(coll, 6, 2, F.6*F.8);;
gap> SetConjugate(coll, 7, 1, F.7*F.9);;
gap> SetConjugate(coll, 7, 2, F.7*F.9);;
gap> SetConjugate(coll, 8, 1, F.8*F.10);;
gap> SetConjugate(coll, 9, 1, F.9*F.10);;
gap> SetConjugate(coll, 9, 2, F.9*F.10);;
gap> UpdatePolycyclicCollector(coll);;
gap> G := GroupByRws(coll);