A problem of enumeration of two-color bracelets with several variations
Abstract
We 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≥3.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.