Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.
DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.
We give a new, combinatorial proof for the necklace splitting problem for two thieves using only Tucker's lemma (a combinatorial version of the Borsuk-Ulam theorem). We show how this method can be applied to obtain a related recent result of Simonyi and even generalize it.
Ardemis Anoush Boghossian, Yahya Rabbani, Shang-Jung Wu, Vitalijs Zubkovs, Sayyed Hashem Sajjadi
Volkan Cevher, Efstratios Panteleimon Skoulakis, Leello Tadesse Dadi, Ioannis Mavrothalassitis