| order | 1024 |
| nilpotency class | 3 |
| automorphism | ? |
| homology | Abelianization (H1) = C25 · Schur multiplier (H2) = C27×C4 |
No aliases for this group.
| subgroup | G/H | |
|---|---|---|
| center, socle | C2 | #2616726 |
| commutator, Frattini, cosocle | C23×C4 | C25 |
| LCS | G ▷ C23×C4 ▷ C2 ▷ C1 | |
| UCS | C1 ◁ C2 ◁ C23×C4 ◁ G | |
| LECS | G ▷ C23×C4 ▷ C2 ▷ C1 | |
5501 conjugacy classes of subgroups.
| minimal degree | μ(G) = 32 |
| transitive degree | μt(G) = 32 |
A minimal faithful permutation representation — 5 generators on 32 points:
(2,4)(3,12)(6,7)(10,27)(11,19)(14,29)(15,16)(17,26)(18,21)(20,31)(22,24)(25,30);(1,2,6,19,8,11,7,4)(3,13,12,26,16,9,15,17)(5,18,24,10,23,27,22,21)(14,28,29,30,31,32,20,25);(1,3)(2,9,11,13)(4,17,19,26)(5,20)(6,15)(7,12)(8,16)(10,28,21,32)(14,22)(18,30,27,25)(23,29)(24,31);(1,4,7,2,8,19,6,11)(3,9,15,17,16,13,12,26)(5,21,22,18,23,10,24,27)(14,28,20,30,31,32,29,25);(1,5)(2,10,11,21)(3,14,16,31)(4,18,19,27)(6,24)(7,22)(8,23)(9,25)(12,29,15,20)(13,30)(17,28)(26,32)Polycyclic presentation:
2^10|b^2=gj,c^2=h,d^2=gh,e^2=ij,f^2=j,g^2=j,b^a=bg,c^a=cf,c^b=ci,d^a=dgh,d^b=dhj,d^c=dgi,e^a=eh,e^b=eghj,e^c=egh,e^d=eghij,f^a=fj,f^b=fj,f^c=fj,f^e=fj,g^a=gj,g^c=gj,g^d=gj,h^b=hj,h^d=hj,i^b=ij,i^c=ij,i^d=ij76 conjugacy classes — view the full character table.
| maximal subgroup of | #72338567 |
| maximal normal subgroup of | #72338567 |
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.7*F.10);;
gap> SetPower(coll, 3, F.8);;
gap> SetPower(coll, 4, F.7*F.8);;
gap> SetPower(coll, 5, F.9*F.10);;
gap> SetPower(coll, 6, F.10);;
gap> SetPower(coll, 7, F.10);;
gap> SetConjugate(coll, 2, 1, F.2*F.7);;
gap> SetConjugate(coll, 3, 1, F.3*F.6);;
gap> SetConjugate(coll, 3, 2, F.3*F.9);;
gap> SetConjugate(coll, 4, 1, F.4*F.7*F.8);;
gap> SetConjugate(coll, 4, 2, F.4*F.8*F.10);;
gap> SetConjugate(coll, 4, 3, F.4*F.7*F.9);;
gap> SetConjugate(coll, 5, 1, F.5*F.8);;
gap> SetConjugate(coll, 5, 2, F.5*F.7*F.8*F.10);;
gap> SetConjugate(coll, 5, 3, F.5*F.7*F.8);;
gap> SetConjugate(coll, 5, 4, F.5*F.7*F.8*F.9*F.10);;
gap> SetConjugate(coll, 6, 1, F.6*F.10);;
gap> SetConjugate(coll, 6, 2, F.6*F.10);;
gap> SetConjugate(coll, 6, 3, F.6*F.10);;
gap> SetConjugate(coll, 6, 5, F.6*F.10);;
gap> SetConjugate(coll, 7, 1, F.7*F.10);;
gap> SetConjugate(coll, 7, 3, F.7*F.10);;
gap> SetConjugate(coll, 7, 4, F.7*F.10);;
gap> SetConjugate(coll, 8, 2, F.8*F.10);;
gap> SetConjugate(coll, 8, 4, F.8*F.10);;
gap> SetConjugate(coll, 9, 2, F.9*F.10);;
gap> SetConjugate(coll, 9, 3, F.9*F.10);;
gap> SetConjugate(coll, 9, 4, F.9*F.10);;
gap> UpdatePolycyclicCollector(coll);;
gap> G := GroupByRws(coll);