| order | 1024 |
| nilpotency class | 4 |
| automorphism | ? |
| homology | Abelianization (H1) = C23×C4 · Schur multiplier (H2) = C211 |
No aliases for this group.
| subgroup | G/H | |
|---|---|---|
| center, socle | C2 | #392109 |
| commutator | C25 | C23×C4 |
| Frattini, cosocle | C23×D4 | C24 |
| prime radical | #10586066 | C2 |
| LCS | G ▷ C25 ▷ C22 ▷ C2 ▷ C1 | |
| UCS | C1 ◁ C2 ◁ C24 ◁ C2×H(7,𝔽2) ◁ G | |
| LECS | G ▷ C23×D4 ▷ C22 ▷ C2 ▷ C1 | |
31127 conjugacy classes of subgroups.
| minimal degree | μ(G) = 32 |
| transitive degree | μt(G) = 32 |
A minimal faithful permutation representation — 4 generators on 32 points:
(1,2)(3,11)(4,8)(5,9)(6,10)(7,14)(12,18)(13,24)(15,21)(16,22)(17,23)(19,27)(20,25)(26,29)(28,31)(30,32);(1,3,6,14)(2,7,10,11)(4,12,15,25)(5,13,17,27)(8,20,21,18)(9,19,23,24)(16,26,28,32)(22,30,31,29);(4,15)(8,21)(12,25)(18,20);(1,4,5,16,6,15,17,28)(2,8,9,22,10,21,23,31)(3,12,13,26,14,25,27,32)(7,18,19,29,11,20,24,30)Polycyclic presentation:
2^10|b^2=j,d^2=e,e^2=j,b^a=bj,d^a=dg,d^b=dh,d^c=df,e^c=ei,f^d=fi,f^e=fj,g^b=gj,h^a=hj,i^d=ij106 conjugacy classes — view the full character table.
| maximal subgroup of | #72260689, #72260919 |
| maximal normal subgroup of | #72260689, #72260919 |
| maximal quotient of | #72234200 |
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.10);;
gap> SetPower(coll, 4, F.5);;
gap> SetPower(coll, 5, F.10);;
gap> SetConjugate(coll, 2, 1, F.2*F.10);;
gap> SetConjugate(coll, 4, 1, F.4*F.7);;
gap> SetConjugate(coll, 4, 2, F.4*F.8);;
gap> SetConjugate(coll, 4, 3, F.4*F.6);;
gap> SetConjugate(coll, 5, 3, F.5*F.9);;
gap> SetConjugate(coll, 6, 4, F.6*F.9);;
gap> SetConjugate(coll, 6, 5, F.6*F.10);;
gap> SetConjugate(coll, 7, 2, F.7*F.10);;
gap> SetConjugate(coll, 8, 1, F.8*F.10);;
gap> SetConjugate(coll, 9, 4, F.9*F.10);;
gap> UpdatePolycyclicCollector(coll);;
gap> G := GroupByRws(coll);