Burnside's Lemma Counter

Abstract Algebra · Axiom Academy

Count unique necklace designs using group theory—discover how symmetries reduce seemingly different patterns to the same fundamental design. Imagine you're designing necklaces with colored beads. You have 6 beads and 3 colors to choose from. How many truly different necklaces can you make? Click any bead to color it with the selected color The Key Question: If you rotate or flip the necklace, should it count as a different design? Most would say no—the pattern is what matters, not the orientation! A necklace has two types of symmetries: rotations (turning it) and reflections (flipping it over). These symmetries form what mathematicians call a dihedral group . Color a pattern, then try the symmetries! Do you get the same pattern back? Without considering symmetries, there are 3^6 = 729 ways to color 6 beads with 3 colors. But many of these are just rotations or reflections of each other! Each bead can be any of 3 colors independently. Many colorings are equivalent under rotation and reflection. Which colorings below are equivalent? Burnside's Lemma (also called the Cauchy-Frobenius Lemma) provides an elegant formula to count distinct objects under group actions: |X/G| = number of distinct colorings (orbits) |G| = number of symmetries in the group |X^g| = number of colorings fixed by symmetry g For a 6-bead necklace, the dihedral group D_6 has 12 symmetries : 6 rotations and 6 reflections. The key is counting how many colorings remain unchanged under each symmetry:

This is the written version of the interactive lesson above. See the full Abstract Algebra course.