It is known that one can cut any open necklace with beads of t types in at most (k-1)t points and partition the resulting intervals into k collections, each containing the same number of beads of each type (up to 1). This number of cuts is optimal. I will discuss some recent advances in the study of this result focusing on its algorithmic aspects and on the case of random necklaces.
Based on joint work with Anrdei Graur and with Dor Elboim, Janos Pach and Gabor Tardos.
Interactive session on Zoom: September 20, 2021 at 18:00 hrs Indian time
YouTube live-stream link: https://youtu.be/ATGVMac0lA8
The joining link for the Zoom meeting will be emailed to registered participants. (register here)
Participants are requested to submit their questions for the speaker through the following form:
The above form will stop accepting responses on September 18, 2021 at 18:00 hrs Indian time.
This colloquium is part of the Distinguished Lecture Series (DLS) organized by The (Indian) Mathematics Consortium (TMC), and co-hosted by IIT-B and ICTS-TIFR. For more information about this lecture series, and to register, please visit the homepage of the TMC DLS.