Polya enumeration theorem

Home > Mathematics > Combinatorics > Polya Enumeration Theorem > Polya enumeration theorem

A powerful technique for counting the number of orbits of a group action on a set of combinatorial structures. The theorem is based on the computation of the cycle index polynomial of the group.