Finite Group DatabasebetaFinite Group Databasebeta| order | 3200 |
| automorphism | ? |
| homology | Abelianization (H1) = C24 · Schur multiplier (H2) = C25×C4 |
No aliases for this group.
| Fitting | C22×C52×D4 ⋊ C22 |
| Sylow | C52 ⋊ #3027 |
1878 conjugacy classes of subgroups; only the 204 normal subgroups are shown.
This group has 1878 conjugacy classes of subgroups — too many to draw. Only its 204 normal subgroups are shown.
Dotted edges: containments with no intermediate normal subgroup — omitted non-normal subgroups may lie between.
| minimal degree | μ(G) = 26 |
| transitive degree | μt(G) = 80 |
A minimal faithful permutation representation — 4 generators on 26 points:
(1,2,4,5,3)(6,7,9,10,8)(11,14,15,22)(12,17,18,21)(13,19,20,26)(16,24,23,25);(2,3)(4,5)(7,8)(9,10)(11,13)(12,16)(14,19)(15,20)(17,24)(18,23)(21,25)(22,26);(14,22)(16,23)(17,21)(19,26);(7,8)(9,10)(11,12,15,18)(13,16,20,23)(14,21,22,17)(19,25,26,24)Polycyclic presentation:
2^7,5^2|a^2=g,d^2=g,b^a=be,c^b=cef,d^a=dg,d^b=dg,e^c=eg,f^a=fg,f^c=fg,h^a=h^4,h^c=h^4,i^a=h^3i,i^c=i^4197 conjugacy classes — view the full character table.
| maximal subgroup of | #72226514 |
| maximal normal subgroup of | #72226514 |
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, 1, F.7);;
gap> SetPower(coll, 4, F.7);;
gap> SetConjugate(coll, 2, 1, F.2*F.5);;
gap> SetConjugate(coll, 3, 2, F.3*F.5*F.6);;
gap> SetConjugate(coll, 4, 1, F.4*F.7);;
gap> SetConjugate(coll, 4, 2, F.4*F.7);;
gap> SetConjugate(coll, 5, 3, F.5*F.7);;
gap> SetConjugate(coll, 6, 1, F.6*F.7);;
gap> SetConjugate(coll, 6, 3, F.6*F.7);;
gap> SetConjugate(coll, 8, 1, F.8^4);;
gap> SetConjugate(coll, 8, 3, F.8^4);;
gap> SetConjugate(coll, 9, 1, F.8^3*F.9);;
gap> SetConjugate(coll, 9, 3, F.9^4);;
gap> UpdatePolycyclicCollector(coll);;
gap> G := GroupByRws(coll);