A problem of enumeration of two-color bracelets with several variations
Combinatorics
2011-05-06 v4
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.
Keywords
Cite
@article{arxiv.0710.1370,
title = {A problem of enumeration of two-color bracelets with several variations},
author = {Vladimir Shevelev},
journal= {arXiv preprint arXiv:0710.1370},
year = {2011}
}
Comments
16 pages