| order | 1024 |
| nilpotency class | 2 |
| automorphism | ? |
| homology | Abelianization (H1) = C25×C4 · Schur multiplier (H2) = C214 |
No aliases for this group.
| subgroup | G/H | |
|---|---|---|
| center, Frattini, socle, cosocle | C24 | C26 |
| commutator | C23 | C25×C4 |
| prime radical | C2×D4×#120 | C2 |
| LCS | G ▷ C23 ▷ C1 | |
| UCS | C1 ◁ C24 ◁ G | |
| LECS | G ▷ C24 ▷ C1 | |
44619 conjugacy classes of subgroups.
| minimal degree | μ(G) = 20 |
| transitive degree | μt(G) = 128 |
A minimal faithful permutation representation — 6 generators on 20 points:
(2,4)(10,12)(14,17)(18,20);(2,4)(5,6,8,7)(9,10)(11,12)(13,14,16,17)(15,18,19,20);(15,19)(18,20);(2,4)(5,6,8,7)(13,14,16,17)(15,18,19,20);(2,4)(5,7,8,6)(13,15,16,19)(14,18,17,20);(1,2)(3,4)(13,14)(15,20)(16,17)(18,19)Polycyclic presentation:
2^10|b^2=hj,d^2=hj,e^2=hj,b^a=bh,d^a=di,e^c=ei,f^a=fg,f^b=fg,f^d=fg,f^e=fg226 conjugacy classes — view the full character table.
| maximal subgroup of | #72298072 |
| maximal normal subgroup of | #72298072 |
| maximal quotient of | #72298591, #72336080 |
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, 4, F.8*F.10);;
gap> SetPower(coll, 5, F.8*F.10);;
gap> SetConjugate(coll, 2, 1, F.2*F.8);;
gap> SetConjugate(coll, 4, 1, F.4*F.9);;
gap> SetConjugate(coll, 5, 3, F.5*F.9);;
gap> SetConjugate(coll, 6, 1, F.6*F.7);;
gap> SetConjugate(coll, 6, 2, F.6*F.7);;
gap> SetConjugate(coll, 6, 4, F.6*F.7);;
gap> SetConjugate(coll, 6, 5, F.6*F.7);;
gap> UpdatePolycyclicCollector(coll);;
gap> G := GroupByRws(coll);