Abstract
We consider the problem of enumeration of incongruent two-color bracelets of beads, of which are black, and study several natural variations of this problem. We also give recursion formulas for enumeration of -color bracelets, $t\geq3.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.