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
Importer (talk | contribs)
Created a new Item
 
Importer (talk | contribs)
Changed an Item
Property / review text
 
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.
Property / review text: 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. / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 20B05 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 4129057 / rank
 
Normal rank
Property / zbMATH Keywords
 
Polya's Enumeration Theorem
Property / zbMATH Keywords: Polya's Enumeration Theorem / rank
 
Normal rank
Property / zbMATH Keywords
 
Galois' Theorem
Property / zbMATH Keywords: Galois' Theorem / rank
 
Normal rank
Property / zbMATH Keywords
 
irreducible equations of prime degree
Property / zbMATH Keywords: irreducible equations of prime degree / rank
 
Normal rank
Property / zbMATH Keywords
 
Burnside's Lemma
Property / zbMATH Keywords: Burnside's Lemma / rank
 
Normal rank

Revision as of 17:57, 1 July 2023

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