Polya's Enumeration Theorem
- Pure Mathematics -
Algebra Dictionary
Definition
A theorem that counts inequivalent colorings or combinatorial configurations under a finite permutation group by substituting color-counting variables into the group's cycle index polynomial.