Finite Group DatabasebetaFinite Group Databasebeta| order | 2048 |
| nilpotency class | 5 |
| automorphism | ? |
| homology | Abelianization (H1) = C25 · Schur multiplier (H2) = C210 |
No aliases for this group.
| subgroup | G/H | |
|---|---|---|
| center, socle | C2 | #72231851 |
| commutator, Frattini, cosocle | #379 | C25 |
| LCS | G ▷ #379 ▷ C24 ▷ C22 ▷ C2 ▷ C1 | |
| UCS | C1 ◁ C2 ◁ C23 ◁ C26 ◁ C2×#2308 ◁ G | |
| LECS | G ▷ #379 ▷ C24 ▷ C22 ▷ C2 ▷ C1 | |
10552 conjugacy classes of subgroups.
| transitive degree | μt(G) = 32 |
Polycyclic presentation:
2^11|g^2=i,b^a=bg,c^b=cf,d^a=di,d^c=dj,e^b=ei,f^a=fh,f^e=fk,g^a=gi,g^b=gi,g^c=ghjk,g^f=gjk,h^b=hj,h^g=hk,i^c=ik,j^a=jk86 conjugacy classes — view the full character table.
| maximal subgroup of | #72237772, #72237814, #72237876, … |
| maximal normal subgroup of | #72237772, #72237814, #72237876, … |
| maximal quotient of | #72338805 |
| automorphism group of | #7338, #7339 |
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, 7, F.9);;
gap> SetConjugate(coll, 2, 1, F.2*F.7);;
gap> SetConjugate(coll, 3, 2, F.3*F.6);;
gap> SetConjugate(coll, 4, 1, F.4*F.9);;
gap> SetConjugate(coll, 4, 3, F.4*F.10);;
gap> SetConjugate(coll, 5, 2, F.5*F.9);;
gap> SetConjugate(coll, 6, 1, F.6*F.8);;
gap> SetConjugate(coll, 6, 5, F.6*F.11);;
gap> SetConjugate(coll, 7, 1, F.7*F.9);;
gap> SetConjugate(coll, 7, 2, F.7*F.9);;
gap> SetConjugate(coll, 7, 3, F.7*F.8*F.10*F.11);;
gap> SetConjugate(coll, 7, 6, F.7*F.10*F.11);;
gap> SetConjugate(coll, 8, 2, F.8*F.10);;
gap> SetConjugate(coll, 8, 7, F.8*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);