nLab
Pólya enumeration theorem

Pólya enumeration theorem is a particular theorem in enumerative combinatorics; it serves as a basis of methods often called Pólya’s enumeration (counting) theory. It is especially used in counting of graphs, including often in applications like chemistry.

  • wikipedia Pólya enumeration theorem
  • G. Pólya, R. C. Read, Combinatorial enumeration of groups, graphs, and chemical compounds, Springer-Verlag

The Pólya “theory” can be redone in terms of Joyal species.

The theory can also be rederived from state sum identities in certain positive TQFT:

category: combinatorics

Last revised on August 26, 2018 at 08:12:42. See the history of this page for a list of all contributions to it.