Finite Group DatabasebetaFinite Group Databasebeta| order | 2048 |
| nilpotency class | 4 |
| automorphism | ? |
| homology | Abelianization (H1) = C23×C4 · Schur multiplier (H2) = C29 |
No aliases for this group.
| subgroup | G/H | |
|---|---|---|
| center, socle | C2 | #72236815 |
| commutator | C26 | C23×C4 |
| Frattini, cosocle | C24×D4 | C24 |
| prime radical | #72234661 | C2 |
| LCS | G ▷ C26 ▷ C23 ▷ C2 ▷ C1 | |
| UCS | C1 ◁ C2 ◁ C24 ◁ C25×D4 ◁ G | |
| LECS | G ▷ C24×D4 ▷ C23 ▷ C2 ▷ C1 | |
At least 7037 conjugacy classes of subgroups; only the 498 normal subgroups are shown.
Polycyclic presentation:
2^11|a^2=e,c^2=e,b^a=bf,c^b=cfg,d^a=dh,d^b=dj,d^c=dh,e^b=ei,f^a=fi,f^c=fij,g^a=gj,g^c=gj,g^e=gk,h^b=hk,i^c=ik,j^a=jk,j^c=jk104 conjugacy classes — view the full character table.
| maximal subgroup of | #72238353, #72266839, #72266935, … |
| maximal normal subgroup of | #72238353, #72266839, #72266935, … |
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", "k");;
gap> coll := SingleCollector(F, [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2]);;
gap> SetPower(coll, 1, F.5);;
gap> SetPower(coll, 3, F.5);;
gap> SetConjugate(coll, 2, 1, F.2*F.6);;
gap> SetConjugate(coll, 3, 2, F.3*F.6*F.7);;
gap> SetConjugate(coll, 4, 1, F.4*F.8);;
gap> SetConjugate(coll, 4, 2, F.4*F.10);;
gap> SetConjugate(coll, 4, 3, F.4*F.8);;
gap> SetConjugate(coll, 5, 2, F.5*F.9);;
gap> SetConjugate(coll, 6, 1, F.6*F.9);;
gap> SetConjugate(coll, 6, 3, F.6*F.9*F.10);;
gap> SetConjugate(coll, 7, 1, F.7*F.10);;
gap> SetConjugate(coll, 7, 3, F.7*F.10);;
gap> SetConjugate(coll, 7, 5, F.7*F.11);;
gap> SetConjugate(coll, 8, 2, F.8*F.11);;
gap> SetConjugate(coll, 9, 3, F.9*F.11);;
gap> SetConjugate(coll, 10, 1, F.10*F.11);;
gap> SetConjugate(coll, 10, 3, F.10*F.11);;
gap> UpdatePolycyclicCollector(coll);;
gap> G := GroupByRws(coll);