Finite Group DatabasebetaFinite Group Databasebeta| order | 25920 |
| automorphism | ? |
| homology | Abelianization (H1) = C22 · Schur multiplier (H2) = C2 |
| dihedral | D12960 |
| Fitting | C5×C32×C81 ⋊ C2 |
| Hall | C5×C81 ⋊ D32 |
| Sylow | C81 ⋊ D160 |
| Sylow | C5 ⋊ D2592 |
170 conjugacy classes of subgroups; only the 63 normal subgroups are shown.
This group has 170 conjugacy classes of subgroups — too many to draw. Only its 63 normal subgroups are shown.
Dotted edges: containments with no intermediate normal subgroup — omitted non-normal subgroups may lie between.
| minimal degree | μ(G) = 118 |
| transitive degree | μt(G) = 12960 |
A minimal faithful permutation representation — 2 generators on 118 points:
(1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30,31,32)(33,34,35,36,37,38,39,40,41,42,43,44,45,46,47,48,49,50,51,52,53,54,55,56,57,58,59,60,61,62,63,64,65,66,67,68,69,70,71,72,73,74,75,76,77,78,79,80,81,82,83,84,85,86,87,88,89,90,91,92,93,94,95,96,97,98,99,100,101,102,103,104,105,106,107,108,109,110,111,112,113)(114,115,116,117,118);(2,32)(3,31)(4,30)(5,29)(6,28)(7,27)(8,26)(9,25)(10,24)(11,23)(12,22)(13,21)(14,20)(15,19)(16,18)(34,113)(35,112)(36,111)(37,110)(38,109)(39,108)(40,107)(41,106)(42,105)(43,104)(44,103)(45,102)(46,101)(47,100)(48,99)(49,98)(50,97)(51,96)(52,95)(53,94)(54,93)(55,92)(56,91)(57,90)(58,89)(59,88)(60,87)(61,86)(62,85)(63,84)(64,83)(65,82)(66,81)(67,80)(68,79)(69,78)(70,77)(71,76)(72,75)(73,74)(115,118)(116,117)Polycyclic presentation:
2^6,3,5,3^3|b^2=cd,c^2=de,d^2=ef,e^2=f,g^3=i,i^3=j,j^3=k,b^a=bc,c^a=cd,d^a=de,e^a=ef,g^a=g^2i^2j^2k^2,h^a=h^4,i^a=i^2j^2k^2,j^a=j^2k^2,k^a=k^26483 conjugacy classes. The character table is too large to display.
| maximal subgroup of | D25920 |
| maximal normal subgroup of | D25920 |
| maximal quotient of | Dic12960, D25920 |
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", "k");;
gap> coll := SingleCollector(F, [2, 2, 2, 2, 2, 2, 3, 5, 3, 3, 3]);;
gap> SetPower(coll, 2, F.3*F.4);;
gap> SetPower(coll, 3, F.4*F.5);;
gap> SetPower(coll, 4, F.5*F.6);;
gap> SetPower(coll, 5, F.6);;
gap> SetPower(coll, 7, F.9);;
gap> SetPower(coll, 9, F.10);;
gap> SetPower(coll, 10, F.11);;
gap> SetConjugate(coll, 2, 1, F.2*F.3);;
gap> SetConjugate(coll, 3, 1, F.3*F.4);;
gap> SetConjugate(coll, 4, 1, F.4*F.5);;
gap> SetConjugate(coll, 5, 1, F.5*F.6);;
gap> SetConjugate(coll, 7, 1, F.7^2*F.9^2*F.10^2*F.11^2);;
gap> SetConjugate(coll, 8, 1, F.8^4);;
gap> SetConjugate(coll, 9, 1, F.9^2*F.10^2*F.11^2);;
gap> SetConjugate(coll, 10, 1, F.10^2*F.11^2);;
gap> SetConjugate(coll, 11, 1, F.11^2);;
gap> UpdatePolycyclicCollector(coll);;
gap> G := GroupByRws(coll);