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)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Le théorème de Burnside sur le comptage des orbites et quelques applications. (Burnside theorem on the computation f orbits and some applications) |
scientific article; zbMATH DE number 4129057
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Le théorème de Burnside sur le comptage des orbites et quelques applications. (Burnside theorem on the computation f orbits and some applications) |
scientific article; zbMATH DE number 4129057 |
Statements
Le théorème de Burnside sur le comptage des orbites et quelques applications. (Burnside theorem on the computation f orbits and some applications) (English)
0 references
1989
0 references
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.
0 references
Polya's Enumeration Theorem
0 references
Galois' Theorem
0 references
irreducible equations of prime degree
0 references
Burnside's Lemma
0 references
