Burnside's lemma

Home > Mathematics > Combinatorics > Polya Enumeration Theorem > Burnside's lemma

A simple enumeration technique that provides a way to count the number of orbits of a group action on a set.