Skip to main navigation Skip to search Skip to main content

Picture-hanging puzzles

  • Erik D. Demaine
  • , Martin L. Demaine
  • , Yair N. Minsky
  • , Joseph S.B. Mitchell
  • , Ronald L. Rivest
  • , Mihai Pătraşcu
  • Massachusetts Institute of Technology
  • Yale University
  • AT&T

Research output: Contribution to journalArticlepeer-review

4 Scopus citations

Abstract

We show how to hang a picture by wrapping rope around n nails, making a polynomial number of twists, such that the picture falls whenever any k out of the n nails get removed, and the picture remains hanging when fewer than k nails get removed. This construction makes for some fun mathematical magic performances. More generally, we characterize the possible Boolean functions characterizing when the picture falls in terms of which nails get removed as all monotone Boolean functions. This construction requires an exponential number of twists in the worst case, but exponential complexity is almost always necessary for general functions.

Original languageEnglish
Pages (from-to)531-550
Number of pages20
JournalTheory of Computing Systems
Volume54
Issue number4
DOIs
StatePublished - May 2014

Keywords

  • Algorithms
  • Free group
  • Magic
  • Monotone functions
  • Topology

Fingerprint

Dive into the research topics of 'Picture-hanging puzzles'. Together they form a unique fingerprint.

Cite this