Finite Group DatabasebetaFinite Group Databasebeta| order | 1024 |
| nilpotency class | 3 |
| automorphism | ? |
| homology | Abelianization (H1) = C25×C4 · Schur multiplier (H2) = C214 |
No aliases for this group.
| subgroup | G/H | |
|---|---|---|
| center | C2×C4 | C24×D4 |
| commutator | C2×C4 | C25×C4 |
| Frattini, cosocle | C22×C4 | C26 |
| socle | C22 | C23×C4×D4 |
| prime radical | #10576068 | C2 |
| LCS | G ▷ C2×C4 ▷ C2 ▷ C1 | |
| UCS | C1 ◁ C2×C4 ◁ C2×#2929 ◁ G | |
| LECS | G ▷ C22×C4 ▷ C2 ▷ C1 | |
19899 conjugacy classes of subgroups.
| transitive degree | μt(G) = 64 |
Polycyclic presentation:
2^10|b^2=ghj,c^2=hj,d^2=hi,e^2=ij,h^2=j,i^2=j,b^a=bg,c^b=cg,d^c=di,e^c=ei,e^d=ej,f^b=fj,f^c=fj,i^c=ij208 conjugacy classes — view the full character table.
| maximal subgroup of | #72250702, #72250889, #72250936, … |
| maximal normal subgroup of | #72250702, #72250889, #72250936, … |
| maximal quotient of | #72318438, #72320264, C2×#72250686, … |
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.7*F.8*F.10);;
gap> SetPower(coll, 3, F.8*F.10);;
gap> SetPower(coll, 4, F.8*F.9);;
gap> SetPower(coll, 5, F.9*F.10);;
gap> SetPower(coll, 8, F.10);;
gap> SetPower(coll, 9, F.10);;
gap> SetConjugate(coll, 2, 1, F.2*F.7);;
gap> SetConjugate(coll, 3, 2, F.3*F.7);;
gap> SetConjugate(coll, 4, 3, F.4*F.9);;
gap> SetConjugate(coll, 5, 3, F.5*F.9);;
gap> SetConjugate(coll, 5, 4, F.5*F.10);;
gap> SetConjugate(coll, 6, 2, F.6*F.10);;
gap> SetConjugate(coll, 6, 3, F.6*F.10);;
gap> SetConjugate(coll, 9, 3, F.9*F.10);;
gap> UpdatePolycyclicCollector(coll);;
gap> G := GroupByRws(coll);