Group Actions and Burnside's Lemma
Pรณlya enumeration theory counts distinct objects under symmetry by combining group actions with generating functions. The starting point is Burnside's lemma, which counts orbits of a group action by averaging fixed points.
Group Actions on Sets
A group action of a finite group on a finite set is a homomorphism . For and , we write . The action satisfies and .
For , the orbit of is and the stabilizer is . The orbit-stabilizer theorem states .
For , the fixed point set is . The number of orbits of on is related to fixed points by Burnside's lemma.
Burnside's Lemma
Count distinct necklaces with beads and colors under rotation (the cyclic group ). With and colors: the group acts on colorings. Fixed points: , (all same color), (period-2 patterns), . Total: distinct necklaces.
Although commonly called "Burnside's lemma," the result was known earlier to Cauchy and Frobenius. Burnside himself attributed it to Frobenius. It is sometimes called the "Cauchy-Frobenius lemma" or "the lemma that is not Burnside's."
Cycle Index
For a permutation group acting on , the cycle index is the polynomial: where is the number of -cycles in the disjoint cycle decomposition of . The cycle index encodes the full orbit structure of the group action.
For the cyclic group acting on 4 positions:
- :
- :
- :
- :
So .