The Pólya enumeration theorem, also known as the Redfield-Pólya theorem, is a combinatorial theorem that generalizes Burnside's lemma. It was first published by J. Howard Redfield in 1927 and later rediscovered by George Pólya in 1937. Pólya applied the theorem to various counting problems, including the enumeration of chemical compounds.
Carnegie Mellon University
Spring 2021
This advanced course reexamines traditional concepts of discrete mathematics (relations, functions, logic, graphs, algebra, automata) in the context of computation and algorithms, necessitating a strong background in discrete math.
No concepts data
+ 23 more concepts