The Pólya enumeration theorem is a combinatorics theorem first published by J. Howard Redfield in 1927 and independently rediscovered by George Pólya in 1937. It follows from Burnside's lemma and has been applied to many counting problems, particularly in chemistry. It is also incorporated into symbolic combinatorics and the theory of combinatorial species.
Carnegie Mellon University
Fall 2021
This course provides a comprehensive introduction to Discrete Mathematics, emphasizing the application of these concepts in Computer Science. Topics include counting, recurrence relations, combinatorial games, Polya theory, and more.
No concepts data
+ 13 more concepts