Finite Group DatabasebetaFinite Group Databasebeta| order | 1024 |
| nilpotency class | 3 |
| automorphism | ? |
| homology | Abelianization (H1) = C23×C4 · Schur multiplier (H2) = C212 |
No aliases for this group.
| subgroup | G/H | |
|---|---|---|
| center, socle | C24 | C2×#120 |
| commutator | C25 | C23×C4 |
| Frattini, cosocle | C26 | C24 |
| prime radical | C22×#2403 | C2 |
| LCS | G ▷ C25 ▷ C2 ▷ C1 | |
| UCS | C1 ◁ C24 ◁ C27 ◁ G | |
| LECS | G ▷ C26 ▷ C2 ▷ C1 | |
37341 conjugacy classes of subgroups.
Polycyclic presentation:
2^10|b^2=g,b^a=bi,c^a=ch,c^b=cf,d^b=de,d^c=dej,e^b=ej,f^d=fj,g^d=gj148 conjugacy classes — view the full character table.
| maximal subgroup of | #72225711, #72258963, #72258967, … |
| maximal normal subgroup of | #72225711, #72258963, #72258967, … |
| maximal quotient of | #72219239, #72282548, #72303550, … |
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> SetConjugate(coll, 2, 1, F.2*F.9);;
gap> SetConjugate(coll, 3, 1, F.3*F.8);;
gap> SetConjugate(coll, 3, 2, F.3*F.6);;
gap> SetConjugate(coll, 4, 2, F.4*F.5);;
gap> SetConjugate(coll, 4, 3, F.4*F.5*F.10);;
gap> SetConjugate(coll, 5, 2, F.5*F.10);;
gap> SetConjugate(coll, 6, 4, F.6*F.10);;
gap> SetConjugate(coll, 7, 4, F.7*F.10);;
gap> UpdatePolycyclicCollector(coll);;
gap> G := GroupByRws(coll);