Finite Group DatabasebetaFinite Group Databasebeta| order | 1024 |
| nilpotency class | 3 |
| automorphism | ? |
| homology | Abelianization (H1) = C24 · Schur multiplier (H2) = C29 |
No aliases for this group.
| subgroup | G/H | |
|---|---|---|
| center, socle | C23 | #2846 |
| commutator, Frattini, cosocle | C24×C4 | C24 |
| prime radical | D4×#534 | C2 |
| LCS | G ▷ C24×C4 ▷ C22 ▷ C1 | |
| UCS | C1 ◁ C23 ◁ C24×C4 ◁ G | |
| LECS | G ▷ C24×C4 ▷ C22 ▷ C1 | |
9147 conjugacy classes of subgroups.
| transitive degree | μt(G) = 128 |
Polycyclic presentation:
2^10|c^2=fi,f^2=j,c^a=cg,c^b=cf,d^a=dh,d^c=de,e^a=ei,f^b=fj,g^d=gi100 conjugacy classes — view the full character table.
| maximal subgroup of | #72250016 |
| maximal normal subgroup of | #72250016 |
| maximal quotient of | #72250539, #72256822, #72257263, … |
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.6*F.9);;
gap> SetPower(coll, 6, F.10);;
gap> SetConjugate(coll, 3, 1, F.3*F.7);;
gap> SetConjugate(coll, 3, 2, F.3*F.6);;
gap> SetConjugate(coll, 4, 1, F.4*F.8);;
gap> SetConjugate(coll, 4, 3, F.4*F.5);;
gap> SetConjugate(coll, 5, 1, F.5*F.9);;
gap> SetConjugate(coll, 6, 2, F.6*F.10);;
gap> SetConjugate(coll, 7, 4, F.7*F.9);;
gap> UpdatePolycyclicCollector(coll);;
gap> G := GroupByRws(coll);