Finite Group DatabasebetaFinite Group Databasebeta| order | 2048 |
| nilpotency class | 3 |
| automorphism | ? |
| homology | Abelianization (H1) = C25 · Schur multiplier (H2) = C213 |
No aliases for this group.
| subgroup | G/H | |
|---|---|---|
| center, socle | C23 | C2×#2403 |
| commutator, Frattini, cosocle | C26 | C25 |
| LCS | G ▷ C26 ▷ C22 ▷ C1 | |
| UCS | C1 ◁ C23 ◁ C27 ◁ G | |
| LECS | G ▷ C26 ▷ C22 ▷ C1 | |
At least 10136 conjugacy classes of subgroups; only the 1054 normal subgroups are shown.
Polycyclic presentation:
2^11|b^a=bf,c^b=ck,d^c=dg,e^a=eh,e^c=ei,g^e=gk,h^c=hj,i^a=ij,i^d=ik149 conjugacy classes — view the full character table.
| maximal subgroup of | #72266027, #72266145, #72266218, … |
| maximal normal subgroup of | #72266027, #72266145, #72266218, … |
| maximal quotient of | #72266839, #72271151, #72312661 |
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> SetConjugate(coll, 2, 1, F.2*F.6);;
gap> SetConjugate(coll, 3, 2, F.3*F.11);;
gap> SetConjugate(coll, 4, 3, F.4*F.7);;
gap> SetConjugate(coll, 5, 1, F.5*F.8);;
gap> SetConjugate(coll, 5, 3, F.5*F.9);;
gap> SetConjugate(coll, 7, 5, F.7*F.11);;
gap> SetConjugate(coll, 8, 3, F.8*F.10);;
gap> SetConjugate(coll, 9, 1, F.9*F.10);;
gap> SetConjugate(coll, 9, 4, F.9*F.11);;
gap> UpdatePolycyclicCollector(coll);;
gap> G := GroupByRws(coll);