| order | 25920 |
| automorphism | ? |
| homology | Abelianization (H1) = C22 · Schur multiplier (H2) = C1 |
| dicyclic | Dic6480 |
| Hall | C5×C81 ⋊ Q64 |
| Sylow | C81 ⋊ Dic80 |
| Sylow | C5 ⋊ Dic1296 |
150 conjugacy classes of subgroups; only the 63 normal subgroups are shown.
This group has 150 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) = 150 |
| transitive degree | μt(G) = 25920 |
A minimal faithful permutation representation — 2 generators on 150 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,64,63,62,61,60,59,58,57,56,55,54,53,52,51,50,49,48,47,46,45,44,43,42,41,40,39,38,37,36,35,34)(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,119,120,121,122,123,124,125,126,127,128,129,130,131,132,133,134,135,136,137,138,139,140,141,142,143,144,145)(146,147,148,149,150);(1,33,17,49)(2,34,18,50)(3,35,19,51)(4,36,20,52)(5,37,21,53)(6,38,22,54)(7,39,23,55)(8,40,24,56)(9,41,25,57)(10,42,26,58)(11,43,27,59)(12,44,28,60)(13,45,29,61)(14,46,30,62)(15,47,31,63)(16,48,32,64)(66,145)(67,144)(68,143)(69,142)(70,141)(71,140)(72,139)(73,138)(74,137)(75,136)(76,135)(77,134)(78,133)(79,132)(80,131)(81,130)(82,129)(83,128)(84,127)(85,126)(86,125)(87,124)(88,123)(89,122)(90,121)(91,120)(92,119)(93,118)(94,117)(95,116)(96,115)(97,114)(98,113)(99,112)(100,111)(101,110)(102,109)(103,108)(104,107)(105,106)(147,150)(148,149)Polycyclic presentation:
2^6,3,5,3^3|a^2=f,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 | Dic12960 |
| maximal normal subgroup of | Dic12960 |
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, 1, F.6);;
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);