Regular Talk
Combinatorics
Counting
Algorithms
Ranking Bracelets in Polynomial time
Ranking and unranking combinatorial objects is a well studied problem, with classical results for words, trees and partitions. More recently polynomial time algorithms have been provided for necklaces, also known as cyclic words. Despite this, the problem of ranking and unranking bracelets (also known as turnover necklaces) has remained a noted open problem. In this talk the first polynomial time algorithms for ranking and unranking bracelets are presented.