| order | 1024 |
| nilpotency class | 4 |
| automorphism | ? |
| homology | Abelianization (H1) = C26 · Schur multiplier (H2) = C213 |
No aliases for this group.
| subgroup | G/H | |
|---|---|---|
| center | C4 | C2×#3109 |
| commutator, Frattini, cosocle | C2×C8 | C26 |
| socle | C2 | C22×#3109 |
| LCS | G ▷ C2×C8 ▷ C4 ▷ C2 ▷ C1 | |
| UCS | C1 ◁ C4 ◁ C23×C4 ◁ C2×#2875 ◁ G | |
| LECS | G ▷ C2×C8 ▷ C4 ▷ C2 ▷ C1 | |
11173 conjugacy classes of subgroups.
| transitive degree | μt(G) = 64 |
Polycyclic presentation:
2^10|b^2=h,c^2=h,e^2=g,f^2=i,g^2=i,i^2=j,b^a=bh,d^b=dhj,e^a=eh,e^b=eg,e^c=ei,e^d=ehj,f^b=fi,f^c=fj,g^a=gj,g^b=gi,g^c=gj,g^d=gj,h^e=hj,i^b=ij130 conjugacy classes — view the full character table.
| maximal subgroup of | #72249843, #72307129, #72307482, … |
| maximal normal subgroup of | #72249843, #72307129, #72307482, … |
| maximal quotient of | #72250155, C2×#72249762 |
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.8);;
gap> SetPower(coll, 3, F.8);;
gap> SetPower(coll, 5, F.7);;
gap> SetPower(coll, 6, F.9);;
gap> SetPower(coll, 7, F.9);;
gap> SetPower(coll, 9, F.10);;
gap> SetConjugate(coll, 2, 1, F.2*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, 2, F.5*F.7);;
gap> SetConjugate(coll, 5, 3, F.5*F.9);;
gap> SetConjugate(coll, 5, 4, F.5*F.8*F.10);;
gap> SetConjugate(coll, 6, 2, F.6*F.9);;
gap> SetConjugate(coll, 6, 3, F.6*F.10);;
gap> SetConjugate(coll, 7, 1, F.7*F.10);;
gap> SetConjugate(coll, 7, 2, F.7*F.9);;
gap> SetConjugate(coll, 7, 3, F.7*F.10);;
gap> SetConjugate(coll, 7, 4, F.7*F.10);;
gap> SetConjugate(coll, 8, 5, F.8*F.10);;
gap> SetConjugate(coll, 9, 2, F.9*F.10);;
gap> UpdatePolycyclicCollector(coll);;
gap> G := GroupByRws(coll);