##  [Polya's Enumeration Theorem](/polyas-enumeration-theorem) 

  ##  [Polya's Enumeration Theorem](https://algebra.quantumdictionary.io/polyas-enumeration-theorem-0) 

  

 [![Algebra](/sites/default/files/styles/large/public/2026-01/Algebra.png.webp?itok=3pHxBnUF)](/topic-specific-dictionaries/pure-mathematics/algebra)

- 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.