Burnside's Lemma and Polya Counting
A technique for counting how many genuinely different arrangements exist once you agree that rotations or reflections of the same arrangement don't count as different — used for puzzles like coloring a necklace's beads or a cube's faces.
Prerequisites: Permutations and Combinations
If you naively count the ways to color the four beads of a bracelet with two colors, you get colorings. But a bracelet can be rotated freely, so a coloring and its rotated version aren't really "different" bracelets — they're the same object viewed differently. Just dividing 16 by the number of rotations (4) doesn't work in general, because some colorings are symmetric under rotation and get overcounted less than others. Burnside's Lemma gives the correct way to count "distinct up to symmetry" objects.
The lemma states that the number of genuinely distinct arrangements equals the average, over every symmetry operation in the group (including "do nothing"), of the number of arrangements left completely unchanged by that operation:
In plain English: instead of one flat division, you check each possible rotation or reflection separately, count how many colorings look identical before and after that specific move, and average those counts across all the moves in the symmetry group.
For the four-bead, two-color bracelet with rotations only (): rotating by 0° fixes all 16 colorings; rotating by 90° or 270° fixes only the 2 colorings where all beads are the same color; rotating by 180° fixes the 4 colorings where opposite beads match. The average is — there are 6 genuinely distinct bracelets, not 16 and not 4.
Burnside's Lemma counts objects "up to symmetry" as the average number of arrangements fixed by each symmetry operation (rotations, reflections) in the relevant group, correctly handling the fact that some arrangements are more symmetric than others and would otherwise be over- or under-counted by naive division.
Related concepts
Practice in interviews
Further reading
- Cameron, Combinatorics: Topics, Techniques, Algorithms, ch. 15