| order | 2160 |
| automorphism | Aut(G) order 311040 |
| homology | Abelianization (H1) = C22 · Schur multiplier (H2) = C1 |
| dicyclic | Dic540 |
| Hall | C5×C27 ⋊ Q16 |
| Sylow | C27 ⋊ Dic20 |
| Sylow | C5 ⋊ Dic108 |
72 conjugacy classes of subgroups.
| minimal degree | μ(G) = 48 |
| transitive degree | μt(G) = 2160 |
A minimal faithful permutation representation — 2 generators on 48 points:
(1,2,3,4,5,6,7,8)(9,16,15,14,13,12,11,10)(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);(1,9,5,13)(2,10,6,14)(3,11,7,15)(4,12,8,16)(18,43)(19,42)(20,41)(21,40)(22,39)(23,38)(24,37)(25,36)(26,35)(27,34)(28,33)(29,32)(30,31)(45,48)(46,47)Polycyclic presentation:
2^4,3,5,3^2|a^2=d,b^2=cd,c^2=d,e^3=g,g^3=h,b^a=bc,c^a=cd,e^a=e^2g^2h^2,f^a=f^4,g^a=g^2h^2,h^a=h^2543 conjugacy classes — view the full character table.
| maximal subgroup of | Dic1080, Dic1620, Dic2700, … |
| maximal normal subgroup of | Dic1080 |
| maximal quotient of | Dic1620, Dic2700, Dic3780, … |
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");;
gap> coll := SingleCollector(F, [2, 2, 2, 2, 3, 5, 3, 3]);;
gap> SetPower(coll, 1, F.4);;
gap> SetPower(coll, 2, F.3*F.4);;
gap> SetPower(coll, 3, F.4);;
gap> SetPower(coll, 5, F.7);;
gap> SetPower(coll, 7, F.8);;
gap> SetConjugate(coll, 2, 1, F.2*F.3);;
gap> SetConjugate(coll, 3, 1, F.3*F.4);;
gap> SetConjugate(coll, 5, 1, F.5^2*F.7^2*F.8^2);;
gap> SetConjugate(coll, 6, 1, F.6^4);;
gap> SetConjugate(coll, 7, 1, F.7^2*F.8^2);;
gap> SetConjugate(coll, 8, 1, F.8^2);;
gap> UpdatePolycyclicCollector(coll);;
gap> G := GroupByRws(coll);