Finite Group DatabasebetaFinite Group Databasebeta| order | 1024 |
| nilpotency class | 3 |
| automorphism | ? |
| homology | Abelianization (H1) = C26 · Schur multiplier (H2) = C217 |
No aliases for this group.
| subgroup | G/H | |
|---|---|---|
| center, socle | C23 | C24×D4 |
| commutator, Frattini, cosocle | C22×C4 | C26 |
| LCS | G ▷ C22×C4 ▷ C2 ▷ C1 | |
| UCS | C1 ◁ C23 ◁ C24×#41 ◁ G | |
| LECS | G ▷ C22×C4 ▷ C2 ▷ C1 | |
229111 conjugacy classes of subgroups.
| transitive degree | μt(G) = 128 |
Polycyclic presentation:
2^10|g^2=j,b^a=bg,c^b=cj,e^a=ei,f^a=fh,f^d=fj,g^a=gj,g^b=gj184 conjugacy classes — view the full character table.
| maximal subgroup of | #72256907, #72263895, #72263972, … |
| maximal normal subgroup of | #72256907, #72263895, #72263972, … |
| maximal quotient of | #72264610, #72307023, #72318029, … |
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, 7, F.10);;
gap> SetConjugate(coll, 2, 1, F.2*F.7);;
gap> SetConjugate(coll, 3, 2, F.3*F.10);;
gap> SetConjugate(coll, 5, 1, F.5*F.9);;
gap> SetConjugate(coll, 6, 1, F.6*F.8);;
gap> SetConjugate(coll, 6, 4, F.6*F.10);;
gap> SetConjugate(coll, 7, 1, F.7*F.10);;
gap> SetConjugate(coll, 7, 2, F.7*F.10);;
gap> UpdatePolycyclicCollector(coll);;
gap> G := GroupByRws(coll);