Matches in DBpedia 2016-04 for { <http://wikidata.dbpedia.org/resource/Q1037559> ?p ?o }
Showing triples 1 to 42 of
42
with 100 triples per page.
- Q1037559 subject Q7020679.
- Q1037559 subject Q8266681.
- Q1037559 subject Q8498911.
- Q1037559 subject Q8851969.
- Q1037559 abstract "The Pólya enumeration theorem, also known as the Redfield–Pólya Theorem, is a theorem in combinatorics that both follows from 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.".
- Q1037559 wikiPageExternalLink Polya.html.
- Q1037559 wikiPageExternalLink ApplyingThePolyaBurnsideEnumerationTheorem.
- Q1037559 wikiPageExternalLink collier.pdf.
- Q1037559 wikiPageExternalLink 9021012252111875.
- Q1037559 wikiPageWikiLink Q11173.
- Q1037559 wikiPageWikiLink Q1330377.
- Q1037559 wikiPageWikiLink Q1443394.
- Q1037559 wikiPageWikiLink Q161519.
- Q1037559 wikiPageWikiLink Q176916.
- Q1037559 wikiPageWikiLink Q212130.
- Q1037559 wikiPageWikiLink Q245446.
- Q1037559 wikiPageWikiLink Q245462.
- Q1037559 wikiPageWikiLink Q2584927.
- Q1037559 wikiPageWikiLink Q2632017.
- Q1037559 wikiPageWikiLink Q272735.
- Q1037559 wikiPageWikiLink Q288465.
- Q1037559 wikiPageWikiLink Q2914964.
- Q1037559 wikiPageWikiLink Q296259.
- Q1037559 wikiPageWikiLink Q2983383.
- Q1037559 wikiPageWikiLink Q2985062.
- Q1037559 wikiPageWikiLink Q303100.
- Q1037559 wikiPageWikiLink Q343171.
- Q1037559 wikiPageWikiLink Q3886264.
- Q1037559 wikiPageWikiLink Q4457949.
- Q1037559 wikiPageWikiLink Q558339.
- Q1037559 wikiPageWikiLink Q593950.
- Q1037559 wikiPageWikiLink Q6240080.
- Q1037559 wikiPageWikiLink Q7020679.
- Q1037559 wikiPageWikiLink Q76592.
- Q1037559 wikiPageWikiLink Q8266681.
- Q1037559 wikiPageWikiLink Q849512.
- Q1037559 wikiPageWikiLink Q8498911.
- Q1037559 wikiPageWikiLink Q860609.
- Q1037559 wikiPageWikiLink Q8851969.
- Q1037559 wikiPageWikiLink Q902019.
- Q1037559 comment "The Pólya enumeration theorem, also known as the Redfield–Pólya Theorem, is a theorem in combinatorics that both follows from 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.".
- Q1037559 label "Pólya enumeration theorem".