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 | C22 | C2×#2403 |
| commutator, Frattini, cosocle | C23×C4 | C25 |
| LCS | G ▷ C23×C4 ▷ C2 ▷ C1 | |
| UCS | C1 ◁ C22 ◁ C22×C42 ◁ G | |
| LECS | G ▷ C23×C4 ▷ C2 ▷ C1 | |
11328 conjugacy classes of subgroups.
| transitive degree | μt(G) = 64 |
Polycyclic presentation:
2^10|b^2=g,e^2=i,i^2=j,c^b=cg,d^c=dh,e^a=ei,e^c=egj,e^d=ef,f^c=fj,h^e=hj,i^a=ij112 conjugacy classes — view the full character table.
| maximal subgroup of | #72252521, #72310675, C2×#72252512, … |
| maximal normal subgroup of | #72252521, #72310675, C2×#72252512, … |
| maximal quotient of | C2×#72252512 |
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);;
gap> SetPower(coll, 5, F.9);;
gap> SetPower(coll, 9, F.10);;
gap> SetConjugate(coll, 3, 2, F.3*F.7);;
gap> SetConjugate(coll, 4, 3, F.4*F.8);;
gap> SetConjugate(coll, 5, 1, F.5*F.9);;
gap> SetConjugate(coll, 5, 3, F.5*F.7*F.10);;
gap> SetConjugate(coll, 5, 4, F.5*F.6);;
gap> SetConjugate(coll, 6, 3, F.6*F.10);;
gap> SetConjugate(coll, 8, 5, F.8*F.10);;
gap> SetConjugate(coll, 9, 1, F.9*F.10);;
gap> UpdatePolycyclicCollector(coll);;
gap> G := GroupByRws(coll);