A problem of enumeration of two-color bracelets with several variations

arXiv0710.1370MaRDI QIDQ6207057FDOQ6207057

Authors: Vladimir Shevelev 

Publication date: 6 October 2007

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, $tgeq3.

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Fibonacci and Lucas numbers and polynomials and generalizations (11B39)

This page was built for publication: A problem of enumeration of two-color bracelets with several variations

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