Finite Group DatabasebetaFinite Group Databasebeta| order | 1024 |
| nilpotency class | 3 |
| automorphism | ? |
| homology | Abelianization (H1) = C25 · Schur multiplier (H2) = C211 |
No aliases for this group.
| subgroup | G/H | |
|---|---|---|
| center, socle | C22 | C2×#2403 |
| commutator, Frattini, cosocle | C23×C4 | C25 |
| LCS | G ▷ C23×C4 ▷ C22 ▷ C1 | |
| UCS | C1 ◁ C22 ◁ C24×C4 ◁ G | |
| LECS | G ▷ C23×C4 ▷ C22 ▷ C1 | |
25172 conjugacy classes of subgroups.
Polycyclic presentation:
2^10|d^2=g,g^2=j,c^a=ch,d^a=di,d^b=dg,d^c=df,e^d=ej,f^a=fi,g^b=gj,h^d=hi106 conjugacy classes — view the full character table.
| maximal subgroup of | #72231110, #72231230, #72231312, … |
| maximal normal subgroup of | #72214923, #72231110, #72231230, … |
| maximal quotient of | #72231803, C2×#72214295, #72240600, … |
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, 4, F.7);;
gap> SetPower(coll, 7, F.10);;
gap> SetConjugate(coll, 3, 1, F.3*F.8);;
gap> SetConjugate(coll, 4, 1, F.4*F.9);;
gap> SetConjugate(coll, 4, 2, F.4*F.7);;
gap> SetConjugate(coll, 4, 3, F.4*F.6);;
gap> SetConjugate(coll, 5, 4, F.5*F.10);;
gap> SetConjugate(coll, 6, 1, F.6*F.9);;
gap> SetConjugate(coll, 7, 2, F.7*F.10);;
gap> SetConjugate(coll, 8, 4, F.8*F.9);;
gap> UpdatePolycyclicCollector(coll);;
gap> G := GroupByRws(coll);