Finite Group DatabasebetaFinite Group Databasebeta| order | 1024 |
| nilpotency class | 2 |
| automorphism | ? |
| homology | Abelianization (H1) = C26 · Schur multiplier (H2) = C216 |
No aliases for this group.
| subgroup | G/H | |
|---|---|---|
| center, commutator, Frattini, socle, cosocle | C24 | C26 |
| LCS | G ▷ C24 ▷ C1 | |
| UCS | C1 ◁ C24 ◁ G | |
| LECS | G ▷ C24 ▷ C1 | |
82349 conjugacy classes of subgroups.
| minimal degree | μ(G) = 16 |
| transitive degree | μt(G) = 128 |
A minimal faithful permutation representation — 6 generators on 16 points:
(2,4)(6,8)(9,10)(11,12)(14,15);(5,6)(7,8)(13,14,16,15);(2,4)(5,6,7,8)(9,10,11,12)(14,15);(9,10)(11,12)(13,15,16,14);(2,4)(6,8)(9,10)(11,12);(1,2)(3,4)(5,6)(7,8)Polycyclic presentation:
2^10|b^2=hj,c^2=hi,d^2=hj,b^a=bh,c^a=chi,c^b=ch,d^a=dhj,d^c=di,e^b=ej,e^c=ehi,f^a=fg,f^c=fg,f^e=fg178 conjugacy classes — view the full character table.
| maximal subgroup of | #72233580, D42×#120, #72297703, … |
| maximal normal subgroup of | #72233580, D42×#120, #72297703, … |
| maximal quotient of | #72298570, #72298583, #72298594, … |
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.8*F.10);;
gap> SetPower(coll, 3, F.8*F.9);;
gap> SetPower(coll, 4, F.8*F.10);;
gap> SetConjugate(coll, 2, 1, F.2*F.8);;
gap> SetConjugate(coll, 3, 1, F.3*F.8*F.9);;
gap> SetConjugate(coll, 3, 2, F.3*F.8);;
gap> SetConjugate(coll, 4, 1, F.4*F.8*F.10);;
gap> SetConjugate(coll, 4, 3, F.4*F.9);;
gap> SetConjugate(coll, 5, 2, F.5*F.10);;
gap> SetConjugate(coll, 5, 3, F.5*F.8*F.9);;
gap> SetConjugate(coll, 6, 1, F.6*F.7);;
gap> SetConjugate(coll, 6, 3, F.6*F.7);;
gap> SetConjugate(coll, 6, 5, F.6*F.7);;
gap> UpdatePolycyclicCollector(coll);;
gap> G := GroupByRws(coll);