Random necklaces require fewer cuts

Noga Alon, Dor Elboim, János Pach +1

It is known that any open necklace with beads of $t$ types in which the number of beads of each type is divisible by $k$, can be partitioned by at most $(k-1)t$ cuts into intervals…