| order | 3200 |
| automorphism | ? |
| homology | Abelianization (H1) = C23×C4 · Schur multiplier (H2) = C25 |
No aliases for this group.
| Fitting | C52×#121 ⋊ C4 |
| Sylow | C52 ⋊ #2325 |
2784 conjugacy classes of subgroups.
| minimal degree | μ(G) = 22 |
| transitive degree | μt(G) = 400 |
A minimal faithful permutation representation — 4 generators on 22 points:
(2,3,4,5)(7,8,9,10)(16,20)(19,22);(6,7,10,8,9)(16,20)(17,21);(1,2,5,3,4)(12,14)(15,17,18,21)(16,19,20,22);(11,12)(13,14)(15,16)(17,19)(18,20)(21,22)Polycyclic presentation:
2^7,5^2|b^2=g,d^2=e,b^a=bf,c^a=cg,c^b=cg,d^a=dg,h^d=h^3,h^e=h^4,i^d=i^3,i^e=i^4128 conjugacy classes — view the full character table.
| maximal subgroup of | #534×#1043 |
| maximal normal subgroup of | #534×#1043 |
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");;
gap> coll := SingleCollector(F, [2, 2, 2, 2, 2, 2, 2, 5, 5]);;
gap> SetPower(coll, 2, F.7);;
gap> SetPower(coll, 4, F.5);;
gap> SetConjugate(coll, 2, 1, F.2*F.6);;
gap> SetConjugate(coll, 3, 1, F.3*F.7);;
gap> SetConjugate(coll, 3, 2, F.3*F.7);;
gap> SetConjugate(coll, 4, 1, F.4*F.7);;
gap> SetConjugate(coll, 8, 4, F.8^3);;
gap> SetConjugate(coll, 8, 5, F.8^4);;
gap> SetConjugate(coll, 9, 4, F.9^3);;
gap> SetConjugate(coll, 9, 5, F.9^4);;
gap> UpdatePolycyclicCollector(coll);;
gap> G := GroupByRws(coll);