A Problem of Enumeration of Two-color Bracelets with Several Variations
Keywords:Two-color and multi-color bracelets, Convex $k$-gons, Generalized Fibonacci numbers
AbstractWe consider the problem of enumeration of incongruent two-color bracelets of $n$ beads, $k$ of which are black, and study several natural variations of this problem. We also give recursion formulas for enumeration of $t$-color bracelets, $t\geq3$.
Download data is not yet available.
How to Cite
Shevelev, V. (2011). A Problem of Enumeration of Two-color Bracelets with Several Variations. Journal of Informatics and Mathematical Sciences, 3(3), 241–256. https://doi.org/10.26713/jims.v3i3.55
LicenseAuthors who publish with this journal agree to the following terms:
- Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a CCAL that allows others to share the work with an acknowledgement of the work's authorship and initial publication in this journal.
- Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgement of its initial publication in this journal.
- Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work.