Computer Science – Data Structures and Algorithms
Scientific paper
2012-03-16
Computer Science
Data Structures and Algorithms
17 pages, 7 figures, 11 puzzles. Full version of FUN 2012 paper
Scientific paper
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.
Demaine Erik D.
Demaine Martin L.
Minsky Yair N.
Mitchell Joseph S. B.
Patrascu Mihai
No associations
LandOfFree
Picture-Hanging Puzzles does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Picture-Hanging Puzzles, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Picture-Hanging Puzzles will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-349079