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, socle | C24 | C23×D4 |
| commutator, Frattini, cosocle | C23×C4 | C25 |
| LCS | G ▷ C23×C4 ▷ C2 ▷ C1 | |
| UCS | C1 ◁ C24 ◁ C2×C4×#121 ◁ G | |
| LECS | G ▷ C23×C4 ▷ C2 ▷ C1 | |
10305 conjugacy classes of subgroups.
| transitive degree | μt(G) = 256 |
Polycyclic presentation:
2^10|a^2=h,c^2=h,d^2=f,e^2=i,i^2=j,d^b=df,d^c=dfh,e^a=ei,e^b=eg,e^c=ej,e^d=ej,i^a=ij124 conjugacy classes — view the full character table.
| maximal subgroup of | #72249833, #72305940, #72306043, … |
| maximal normal subgroup of | #72249833, #72305940, #72306043, … |
| maximal quotient of | #72252637, #72321614 |
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.8);;
gap> SetPower(coll, 3, F.8);;
gap> SetPower(coll, 4, F.6);;
gap> SetPower(coll, 5, F.9);;
gap> SetPower(coll, 9, F.10);;
gap> SetConjugate(coll, 4, 2, F.4*F.6);;
gap> SetConjugate(coll, 4, 3, F.4*F.6*F.8);;
gap> SetConjugate(coll, 5, 1, F.5*F.9);;
gap> SetConjugate(coll, 5, 2, F.5*F.7);;
gap> SetConjugate(coll, 5, 3, F.5*F.10);;
gap> SetConjugate(coll, 5, 4, F.5*F.10);;
gap> SetConjugate(coll, 9, 1, F.9*F.10);;
gap> UpdatePolycyclicCollector(coll);;
gap> G := GroupByRws(coll);