Finite Group DatabasebetaFinite Group Databasebeta| order | 1024 |
| nilpotency class | 3 |
| automorphism | ? |
| homology | Abelianization (H1) = C27 · Schur multiplier (H2) = C219 |
No aliases for this group.
| subgroup | G/H | |
|---|---|---|
| center | C2×C4 | C24×D4 |
| commutator, Frattini, cosocle | C2×C4 | C27 |
| socle | C22 | C25×D4 |
| LCS | G ▷ C2×C4 ▷ C2 ▷ C1 | |
| UCS | C1 ◁ C2×C4 ◁ C22×C4×#41 ◁ G | |
| LECS | G ▷ C2×C4 ▷ C2 ▷ C1 | |
75825 conjugacy classes of subgroups.
| transitive degree | μt(G) = 64 |
Polycyclic presentation:
2^10|a^2=i,b^2=h,f^2=i,h^2=j,b^a=bh,d^b=dij,e^b=ei,e^c=ei,g^b=gi,h^a=hj196 conjugacy classes — view the full character table.
| maximal subgroup of | #72310598 |
| maximal normal subgroup of | #72310598 |
| maximal quotient of | #72313780, #72315513 |
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, 1, F.9);;
gap> SetPower(coll, 2, F.8);;
gap> SetPower(coll, 6, F.9);;
gap> SetPower(coll, 8, F.10);;
gap> SetConjugate(coll, 2, 1, F.2*F.8);;
gap> SetConjugate(coll, 4, 2, F.4*F.9*F.10);;
gap> SetConjugate(coll, 5, 2, F.5*F.9);;
gap> SetConjugate(coll, 5, 3, F.5*F.9);;
gap> SetConjugate(coll, 7, 2, F.7*F.9);;
gap> SetConjugate(coll, 8, 1, F.8*F.10);;
gap> UpdatePolycyclicCollector(coll);;
gap> G := GroupByRws(coll);