Matches in DBpedia 2015-04 for { <http://dbpedia.org/resource/P%C3%B3lya_enumeration_theorem> ?p ?o }
Showing triples 1 to 31 of
31
with 100 triples per page.
- P%C3%B3lya_enumeration_theorem abstract "The Pólya enumeration theorem, also known as the Redfield–Pólya Theorem, is a theorem in combinatorics that both follows and ultimately generalizes Burnside's lemma on the number of orbits of a group action on a set. The theorem was first published by John Howard Redfield in 1927. In 1937 it was independently rediscovered by George Pólya, who then greatly popularized the result by applying it to many counting problems, in particular to the enumeration of chemical compounds.The Pólya enumeration theorem can also be incorporated into symbolic combinatorics and the theory of combinatorial species.".
- P%C3%B3lya_enumeration_theorem wikiPageExternalLink Polya.html.
- P%C3%B3lya_enumeration_theorem wikiPageExternalLink ApplyingThePolyaBurnsideEnumerationTheorem.
- P%C3%B3lya_enumeration_theorem wikiPageExternalLink collier.pdf.
- P%C3%B3lya_enumeration_theorem wikiPageExternalLink 9021012252111875.
- P%C3%B3lya_enumeration_theorem wikiPageID "4396962".
- P%C3%B3lya_enumeration_theorem wikiPageRevisionID "635181848".
- P%C3%B3lya_enumeration_theorem hasPhotoCollection Pólya_enumeration_theorem.
- P%C3%B3lya_enumeration_theorem title "Polya Enumeration Theorem".
- P%C3%B3lya_enumeration_theorem urlname "PolyaEnumerationTheorem".
- P%C3%B3lya_enumeration_theorem subject Category:Articles_containing_proofs.
- P%C3%B3lya_enumeration_theorem subject Category:Enumerative_combinatorics.
- P%C3%B3lya_enumeration_theorem subject Category:Graph_enumeration.
- P%C3%B3lya_enumeration_theorem subject Category:Theorems_in_combinatorics.
- P%C3%B3lya_enumeration_theorem type Abstraction100002137.
- P%C3%B3lya_enumeration_theorem type Communication100033020.
- P%C3%B3lya_enumeration_theorem type Message106598915.
- P%C3%B3lya_enumeration_theorem type Proposition106750804.
- P%C3%B3lya_enumeration_theorem type Statement106722453.
- P%C3%B3lya_enumeration_theorem type Theorem106752293.
- P%C3%B3lya_enumeration_theorem type TheoremsInCombinatorics.
- P%C3%B3lya_enumeration_theorem type TheoremsInDiscreteMathematics.
- P%C3%B3lya_enumeration_theorem comment "The Pólya enumeration theorem, also known as the Redfield–Pólya Theorem, is a theorem in combinatorics that both follows and ultimately generalizes Burnside's lemma on the number of orbits of a group action on a set. The theorem was first published by John Howard Redfield in 1927.".
- P%C3%B3lya_enumeration_theorem label "Pólya enumeration theorem".
- P%C3%B3lya_enumeration_theorem label "Théorème de dénombrement de Pólya".
- P%C3%B3lya_enumeration_theorem label "Теорема Редфилда — Пойа".
- P%C3%B3lya_enumeration_theorem label "포여 열거 정리".
- P%C3%B3lya_enumeration_theorem sameAs m.0c0081.
- P%C3%B3lya_enumeration_theorem sameAs Pólya_enumeration_theorem.
- P%C3%B3lya_enumeration_theorem wasDerivedFrom Pólya_enumeration_theorem?oldid=635181848.
- P%C3%B3lya_enumeration_theorem isPrimaryTopicOf Pólya_enumeration_theorem.