How a topological theorem solves the puzzle of stolen necklaces

Using topology for discrete problems | The Borsuk-Ulam theorem and stolen necklaces · 19:22 · Video: 3Blue1Brown · Watch at the source

In short: Can you restore a stolen necklace by making only a few cuts? This video explores how the Borsuk-Ulam theorem, a concept from continuous topology, provides a surprising solution to a discrete mathematical problem.

The video examines a mathematical challenge involving the fair division of items, specifically looking at how to solve discrete math puzzles using topological principles. It focuses on the logic behind the 1986 paper by Alon and West, which utilized ideas related to the Borsuk-Ulam theorem to address the problem of how many cuts are required to restore a broken necklace.

Opens the Intellect+ feed with this card first. Swipe up for the next one.

Sources

To cite this card, link to https://intellectplus.co.uk/app/science-using-topology-for-discrete-problems-the-borsuk-ulam-theorem.

How we source, check and correct cards: Editorial standards.

General information, not professional advice. Spotted an error? Flag the card or see corrections and complaints.

Intellect Plus is a visual educational discovery platform for exploring fascinating facts and ideas. Brain Food, Not Brain Rot. What is Intellect Plus?

Related

Finding something worth knowing…