Vladimir Shevelev
Published 2007-10-06, updated 2011-05-05Version 4
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\geq3.
The enumeration of fully commutative affine permutations
Enumeration of Graded (3+1)-Avoiding Posets
Enumeration of chord diagrams
![QR code for arXiv:0710.1370 [math.CO]](http://oss.arxitics.com/images/favicon.svg)