Régularisation numérique d'orbites (Q2266118): Difference between revisions

Let \(X\) be a finite set of cardinality \(n\) and \(G\) a group of permutations of \(X\). If \(| G| >1\) then let \(k(G)\) denote the largest number \(k\), \(0\le k<1\), such that every \(g\in G\setminus \{1\}\) fixes exactly \(kn\) points in \(X\). In addition, \(k(\{1\})=0\) is defined. The action of \(G\) extends in a natural way to the power set \(\mathcal P(X)\). It is proved in Théorème 1 that the number \(| O|\) of \(G\)-orbits in \(\mathcal P(X)\) satisfies \(| O| =2^n/| G| +\varepsilon\), where \(0\le \varepsilon \le 2^{n(1+k(G))/2}\). A similar result is Théorème 2 which deals with the action of \(G\) on the set of all \(i\)-element subsets of \(X\). The proofs rely on calculations with Pólya's cycle indicator polynomials.