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

From MaRDI portal
Added link to MaRDI item.
Import240304020342 (talk | contribs)
Set profile property.
 
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank

Latest revision as of 00:41, 5 March 2024

scientific article
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

    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
    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

    Identifiers