| order | 46144 |
| automorphism | ? |
| homology | Abelianization (H1) = C22 · Schur multiplier (H2) = C2 |
| dihedral | D23072 |
| Fitting | C7×C32×C103 ⋊ C2 |
| Hall | C7×C103 ⋊ D32 |
| Sylow | C103 ⋊ D224 |
| Sylow | C7 ⋊ D3296 |
68 conjugacy classes of subgroups.
| minimal degree | μ(G) = 142 |
| transitive degree | μt(G) = 23072 |
A minimal faithful permutation representation — 2 generators on 142 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);(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,39)(35,38)(36,37)(41,142)(42,141)(43,140)(44,139)(45,138)(46,137)(47,136)(48,135)(49,134)(50,133)(51,132)(52,131)(53,130)(54,129)(55,128)(56,127)(57,126)(58,125)(59,124)(60,123)(61,122)(62,121)(63,120)(64,119)(65,118)(66,117)(67,116)(68,115)(69,114)(70,113)(71,112)(72,111)(73,110)(74,109)(75,108)(76,107)(77,106)(78,105)(79,104)(80,103)(81,102)(82,101)(83,100)(84,99)(85,98)(86,97)(87,96)(88,95)(89,94)(90,93)(91,92)Polycyclic presentation:
2^6,7,103|b^2=cd,c^2=de,d^2=ef,e^2=f,b^a=bc,c^a=cd,d^a=de,e^a=ef,g^a=g^6,h^a=h^10211539 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");;
gap> coll := SingleCollector(F, [2, 2, 2, 2, 2, 2, 7, 103]);;
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> 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^6);;
gap> SetConjugate(coll, 8, 1, F.8^102);;
gap> UpdatePolycyclicCollector(coll);;
gap> G := GroupByRws(coll);