| order | 54000 |
| automorphism | ? |
| homology | Abelianization (H1) = C22 · Schur multiplier (H2) = C2 |
| dihedral | D27000 |
| Fitting | C8×C27×C125 ⋊ C2 |
| Hall | C27×C125 ⋊ D8 |
| Sylow | C125 ⋊ D216 |
| Sylow | C27 ⋊ D1000 |
176 conjugacy classes of subgroups; only the 67 normal subgroups are shown.
This group has 176 conjugacy classes of subgroups — too many to draw. Only its 67 normal subgroups are shown.
Dotted edges: containments with no intermediate normal subgroup — omitted non-normal subgroups may lie between.
| minimal degree | μ(G) = 160 |
| transitive degree | μt(G) = 27000 |
A minimal faithful permutation representation — 2 generators on 160 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,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,151,152,153,154,155,156,157,158,159,160);(2,8)(3,7)(4,6)(10,35)(11,34)(12,33)(13,32)(14,31)(15,30)(16,29)(17,28)(18,27)(19,26)(20,25)(21,24)(22,23)(37,160)(38,159)(39,158)(40,157)(41,156)(42,155)(43,154)(44,153)(45,152)(46,151)(47,150)(48,149)(49,148)(50,147)(51,146)(52,145)(53,144)(54,143)(55,142)(56,141)(57,140)(58,139)(59,138)(60,137)(61,136)(62,135)(63,134)(64,133)(65,132)(66,131)(67,130)(68,129)(69,128)(70,127)(71,126)(72,125)(73,124)(74,123)(75,122)(76,121)(77,120)(78,119)(79,118)(80,117)(81,116)(82,115)(83,114)(84,113)(85,112)(86,111)(87,110)(88,109)(89,108)(90,107)(91,106)(92,105)(93,104)(94,103)(95,102)(96,101)(97,100)(98,99)Polycyclic presentation:
2^4,3,5,3,5,3,5|b^2=cd,c^2=d,e^3=g,f^5=h,g^3=i,h^5=j,b^a=bc,c^a=cd,e^a=e^2g^2i^2,f^a=f^4h^4j^4,g^a=g^2i^2,h^a=h^4j^4,i^a=i^2,j^a=j^413503 conjugacy classes. The character table is too large to display.
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");;
gap> coll := SingleCollector(F, [2, 2, 2, 2, 3, 5, 3, 5, 3, 5]);;
gap> SetPower(coll, 2, F.3*F.4);;
gap> SetPower(coll, 3, F.4);;
gap> SetPower(coll, 5, F.7);;
gap> SetPower(coll, 6, F.8);;
gap> SetPower(coll, 7, F.9);;
gap> SetPower(coll, 8, F.10);;
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.9^2);;
gap> SetConjugate(coll, 6, 1, F.6^4*F.8^4*F.10^4);;
gap> SetConjugate(coll, 7, 1, F.7^2*F.9^2);;
gap> SetConjugate(coll, 8, 1, F.8^4*F.10^4);;
gap> SetConjugate(coll, 9, 1, F.9^2);;
gap> SetConjugate(coll, 10, 1, F.10^4);;
gap> UpdatePolycyclicCollector(coll);;
gap> G := GroupByRws(coll);