Counting colorful necklaces and bracelets in three colors

DOI10.1007/S00010-019-00645-WMaRDI QIDQ2007630zbMATH OpenOpenAlexWikidataFDO

Authors Dennis S. Bernstein, Omran Kouba

Publication date 22 November 2019

Published in Aequationes Mathematicae (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1901.10703

zbMATH Keywords

braceletBurnside's lemmagroup actionnecklaceperiodic three color sequences

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Exact enumeration problems, generating functions (05A15)

Abstract: A necklace or bracelet is extit{colorful} if no pair of adjacent beads are the same color. In addition, two necklaces are extit{equivalent} if one results from the other by permuting its colors, and two bracelets are extit{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^{\prime }(n)$ of colorful bracelets formed with $n$-beads in at most three colors. Expressions obtained for $K^{\prime }(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.

Recommendations

• Counting symmetric bracelets
• ENUMERATING NECKLACES WITH TRANSITIONS
• Difference necklaces
• An algorithm for generating necklaces of beads in two colors
• On the number of antipodal bicolored necklaces

Cites work

• An introduction to the theory of numbers. Edited and revised by D. R. Heath-Brown and J. H. Silverman. With a foreword by Andrew Wiles
• Burnside's lemma: A historical note
• Closed rotation sequences
• scientific article; zbMATH DE number 193026 (Why is no real title available?)
• scientific article; zbMATH DE number 706263 (Why is no real title available?)

Cited in

(4)

• ENUMERATING NECKLACES WITH TRANSITIONS
• Counting symmetric bracelets
• On the number of antipodal bicolored necklaces
• On the number of bracelets whose co-periods divide a given integer

Describes a project that uses

Uses Software

• OEIS

This page was built for publication: Counting colorful necklaces and bracelets in three colors

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2007630)