Le théorème de Burnside sur le comptage des orbites et quelques applications. (Burnside theorem on the computation f orbits and some applications) (Q581662): Difference between revisions

This expository paper gives detailed proofs of both Polya's Enumeration Theorem and Galois' Theorem on irreducible equations of prime degree. They are based on Burnside's Lemma. It is, of course, well-known that these theorems follow from Burnside's Lemma; the author is simply interested in giving a detailed expository account of the matter.