Finite Group DatabasebetaFinite Group Databasebeta| order | 1024 |
| nilpotency class | 3 |
| automorphism | ? |
| homology | Abelianization (H1) = C23×C4 · Schur multiplier (H2) = C212 |
No aliases for this group.
| subgroup | G/H | |
|---|---|---|
| center | C2×C4 | #2403 |
| commutator | C25 | C23×C4 |
| Frattini, cosocle | C24×C4 | C24 |
| socle | C22 | #13867 |
| prime radical | C2×#62811 | C2 |
| LCS | G ▷ C25 ▷ C2 ▷ C1 | |
| UCS | C1 ◁ C2×C4 ◁ C24×C4 ◁ G | |
| LECS | G ▷ C24×C4 ▷ C2 ▷ C1 | |
33217 conjugacy classes of subgroups.
| transitive degree | μt(G) = 64 |
Polycyclic presentation:
2^10|b^2=hj,d^2=ehi,i^2=j,b^a=bh,c^b=chj,d^a=dg,d^b=de,d^c=df,e^b=ej,e^c=ej,e^d=ej,g^b=gj,h^d=hj,i^c=ij136 conjugacy classes — view the full character table.
| maximal subgroup of | #72249800, #72281237, #72281539, … |
| maximal normal subgroup of | #72249800, #72281237, #72281539, … |
| maximal quotient of | #72252108 |
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*F.10);;
gap> SetPower(coll, 4, F.5*F.8*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*F.10);;
gap> SetConjugate(coll, 4, 1, F.4*F.7);;
gap> SetConjugate(coll, 4, 2, F.4*F.5);;
gap> SetConjugate(coll, 4, 3, F.4*F.6);;
gap> SetConjugate(coll, 5, 2, F.5*F.10);;
gap> SetConjugate(coll, 5, 3, F.5*F.10);;
gap> SetConjugate(coll, 5, 4, F.5*F.10);;
gap> SetConjugate(coll, 7, 2, F.7*F.10);;
gap> SetConjugate(coll, 8, 4, F.8*F.10);;
gap> SetConjugate(coll, 9, 3, F.9*F.10);;
gap> UpdatePolycyclicCollector(coll);;
gap> G := GroupByRws(coll);