Finite Group DatabasebetaFinite Group Databasebeta| order | 2048 |
| nilpotency class | 5 |
| automorphism | ? |
| homology | Abelianization (H1) = C23 · Schur multiplier (H2) = C27 |
No aliases for this group.
| subgroup | G/H | |
|---|---|---|
| center, socle | C2 | #72210565 |
| commutator, Frattini, cosocle | C2×#2846 | C23 |
| LCS | G ▷ C2×#2846 ▷ C25 ▷ C23 ▷ C2 ▷ C1 | |
| UCS | C1 ◁ C2 ◁ C23 ◁ C25 ◁ C2×#2846 ◁ G | |
| LECS | G ▷ C2×#2846 ▷ C25 ▷ C23 ▷ C2 ▷ C1 | |
60014 conjugacy classes of subgroups; only the 70 normal subgroups are shown.
This group has 60014 conjugacy classes of subgroups — too many to draw. Only its 70 normal subgroups are shown.
Dotted edges: containments with no intermediate normal subgroup — omitted non-normal subgroups may lie between.
Polycyclic presentation:
2^11|b^2=f,c^2=ghijk,d^2=k,e^2=ik,b^a=be,c^a=cd,c^b=cfhk,d^a=dk,d^b=dg,d^c=di,e^a=eik,e^b=eh,e^c=eghk,e^d=ei,f^a=fhi,f^c=fj,f^d=fj,f^e=fj,g^a=gi,g^b=gj,g^c=gj,h^b=hj,h^c=hjk,h^d=hk,h^e=hk,i^b=ik,i^c=ik,j^a=jk74 conjugacy classes — view the full character table.
| maximal subgroup of | #72216213, #72258916, #72316542, … |
| maximal normal subgroup of | #72216741, C2×#72210568, #72316542, … |
| maximal quotient of | C2×#72210568, #72241330, #72252413, … |
| automorphism group of | #534 |
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, 2, F.6);;
gap> SetPower(coll, 3, F.7*F.8*F.9*F.10*F.11);;
gap> SetPower(coll, 4, F.11);;
gap> SetPower(coll, 5, F.9*F.11);;
gap> SetConjugate(coll, 2, 1, F.2*F.5);;
gap> SetConjugate(coll, 3, 1, F.3*F.4);;
gap> SetConjugate(coll, 3, 2, F.3*F.6*F.8*F.11);;
gap> SetConjugate(coll, 4, 1, F.4*F.11);;
gap> SetConjugate(coll, 4, 2, F.4*F.7);;
gap> SetConjugate(coll, 4, 3, F.4*F.9);;
gap> SetConjugate(coll, 5, 1, F.5*F.9*F.11);;
gap> SetConjugate(coll, 5, 2, F.5*F.8);;
gap> SetConjugate(coll, 5, 3, F.5*F.7*F.8*F.11);;
gap> SetConjugate(coll, 5, 4, F.5*F.9);;
gap> SetConjugate(coll, 6, 1, F.6*F.8*F.9);;
gap> SetConjugate(coll, 6, 3, F.6*F.10);;
gap> SetConjugate(coll, 6, 4, F.6*F.10);;
gap> SetConjugate(coll, 6, 5, F.6*F.10);;
gap> SetConjugate(coll, 7, 1, F.7*F.9);;
gap> SetConjugate(coll, 7, 2, F.7*F.10);;
gap> SetConjugate(coll, 7, 3, F.7*F.10);;
gap> SetConjugate(coll, 8, 2, F.8*F.10);;
gap> SetConjugate(coll, 8, 3, F.8*F.10*F.11);;
gap> SetConjugate(coll, 8, 4, F.8*F.11);;
gap> SetConjugate(coll, 8, 5, F.8*F.11);;
gap> SetConjugate(coll, 9, 2, F.9*F.11);;
gap> SetConjugate(coll, 9, 3, F.9*F.11);;
gap> SetConjugate(coll, 10, 1, F.10*F.11);;
gap> UpdatePolycyclicCollector(coll);;
gap> G := GroupByRws(coll);