Finite Group DatabasebetaFinite Group Databasebeta| order | 1024 |
| nilpotency class | 3 |
| automorphism | ? |
| homology | Abelianization (H1) = C25 · Schur multiplier (H2) = C210 |
No aliases for this group.
| subgroup | G/H | |
|---|---|---|
| center | C2×C4 | #2403 |
| commutator, Frattini, cosocle | C23×C4 | C25 |
| socle | C22 | C2×#2403 |
| LCS | G ▷ C23×C4 ▷ C2 ▷ C1 | |
| UCS | C1 ◁ C2×C4 ◁ C22×C42 ◁ G | |
| LECS | G ▷ C23×C4 ▷ C2 ▷ C1 | |
11863 conjugacy classes of subgroups.
| transitive degree | μt(G) = 64 |
Polycyclic presentation:
2^10|c^2=g,d^2=i,e^2=h,f^2=j,d^a=di,d^b=dgi,e^b=eh,e^d=ef,f^a=fj,h^d=hj,i^e=ij136 conjugacy classes — view the full character table.
| maximal subgroup of | #72257590, #72282508 |
| maximal normal subgroup of | #72257590, #72282508 |
| maximal quotient of | #72264126 |
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, 3, F.7);;
gap> SetPower(coll, 4, F.9);;
gap> SetPower(coll, 5, F.8);;
gap> SetPower(coll, 6, F.10);;
gap> SetConjugate(coll, 4, 1, F.4*F.9);;
gap> SetConjugate(coll, 4, 2, F.4*F.7*F.9);;
gap> SetConjugate(coll, 5, 2, F.5*F.8);;
gap> SetConjugate(coll, 5, 4, F.5*F.6);;
gap> SetConjugate(coll, 6, 1, F.6*F.10);;
gap> SetConjugate(coll, 8, 4, F.8*F.10);;
gap> SetConjugate(coll, 9, 5, F.9*F.10);;
gap> UpdatePolycyclicCollector(coll);;
gap> G := GroupByRws(coll);