Splitting necklaces
✍
Noga Alon
📂
Article
📅
1987
🏛
Elsevier Science
🌐
English
⚖ 381 KB
Let N be an opened necklace with ha, beads of color i, 1 < i $ t. We show that it is possible to cut N in (k -1). t places and partition the resulting intervals into k collections, each containing precisely ai beads of color i, 1 6 i < t. This result is best possible and solves a problem of Goldberg