| order | 1024 |
| nilpotency class | 4 |
| automorphism | ? |
| homology | Abelianization (H1) = C24 · Schur multiplier (H2) = C26×C4 |
No aliases for this group.
| subgroup | G/H | |
|---|---|---|
| center, socle | C22 | #23984 |
| commutator, Frattini, cosocle | C23×D4 | C24 |
| prime radical | #347042 | C2 |
| LCS | G ▷ C23×D4 ▷ C23 ▷ C2 ▷ C1 | |
| UCS | C1 ◁ C22 ◁ C24 ◁ C22×#120 ◁ G | |
| LECS | G ▷ C23×D4 ▷ C23 ▷ C2 ▷ C1 | |
3306 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,13,7)(4,15)(5,9)(6,8)(10,17)(12,26,28,20)(14,27,30,21)(16,24)(18,22)(19,29,25,32)(23,31);(1,3)(2,7)(4,12)(5,13)(6,14)(8,21)(9,11)(10,20)(15,19)(16,28)(17,29)(18,30)(22,27)(23,26)(24,25)(31,32);(2,8)(3,12)(7,19)(9,22)(10,15)(11,25)(13,28)(14,29)(20,21)(23,24)(26,27)(30,32);(4,16)(10,23)(12,28)(15,24)(17,31)(19,25)(20,26)(29,32)Polycyclic presentation:
2^10|a^2=g,b^a=be,c^a=cj,c^b=cf,d^c=dg,e^a=ei,e^c=eh,f^a=fhj,f^d=fi,f^e=fj,g^b=gi,h^b=hj58 conjugacy classes — view the full character table.
| maximal subgroup of | #72266711, #72266715, #72266717 |
| maximal normal subgroup of | #72266711, #72266715, #72266717 |
| maximal quotient of | #72337753 |
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, 1, F.7);;
gap> SetConjugate(coll, 2, 1, F.2*F.5);;
gap> SetConjugate(coll, 3, 1, F.3*F.10);;
gap> SetConjugate(coll, 3, 2, F.3*F.6);;
gap> SetConjugate(coll, 4, 3, F.4*F.7);;
gap> SetConjugate(coll, 5, 1, F.5*F.9);;
gap> SetConjugate(coll, 5, 3, F.5*F.8);;
gap> SetConjugate(coll, 6, 1, F.6*F.8*F.10);;
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.9);;
gap> SetConjugate(coll, 8, 2, F.8*F.10);;
gap> UpdatePolycyclicCollector(coll);;
gap> G := GroupByRws(coll);