Counting colorful necklaces and bracelets in three colors
- 9 Downloads
A necklace or bracelet is colorful if no pair of adjacent beads are the same color. In addition, two necklaces are equivalent if one results from the other by permuting its colors, and two bracelets are equivalent if one results from the other by either permuting its colors or reversing the order of the beads; a bracelet is thus a necklace that can be turned over. This note counts the number K(n) of non-equivalent colorful necklaces and the number \(K'(n)\) of colorful bracelets formed with n-beads in at most three colors. Expressions obtained for \(K'(n)\) simplify expressions given by OEIS sequence A114438, while the expressions given for K(n) appear to be new and are not included in OEIS.
KeywordsGroup action Burnside’s lemma Necklace Bracelet Periodic three color sequences
Mathematics Subject Classification05A05
Unable to display preview. Download preview PDF.
- 1.Bernstein, D.S.: On feasible body, aerodynamic, and navigation Euler angles for aircraft flight. J. Guidance Control Dyn. (2019). https://doi.org/10.2514/1.G003930
- 9.Weisstein, E.W.: Cauchy–Frobenius lemma. From MathWorld—a Wolfram web resource. http://mathworld.wolfram.com/Cauchy-FrobeniusLemma.html
- 10.Weisstein, E.W.: Necklace. From MathWorld—a Wolfram web resource. http://mathworld.wolfram.com/Necklace.html