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.
KeywordsBoolean Function Sorting Network Borromean Ring Monotone Boolean Function Borromean Link
Unable to display preview. Download preview PDF.
- 1.Brunn, H.: Über Verkettung. Sitzungsberichte der Bayerische Akad. Wiss. 22, 77–99 (1892)Google Scholar
- 2.Demaine, E.D., Demaine, M.L., Uehara, R.: Any monotone Boolean function can be realized by interlocked polygons. In: CCCG 2010, pp. 139–142 (2010)Google Scholar
- 5.Pegg Jr., E.: http://www.mathpuzzle.com/hangingpicture.htm
- 8.Sloane, N.J.A.: Sequence A073121. In: On-Line Encyclopedia of Integer Sequences (August 2002), http://www.research.att.com/projects/OEIS?Anum=A073121
- 9.Spivak, A.: Brainteasers B 201: Strange painting. Quantum, 13 (May/June 1997)Google Scholar
- 10.Stanford, T.: Brunnian braids and some of their generalizations. Bull. Lond. Math. Soc. To appear arXiv:math.GT/9907072, http://arXiv.org/abs/math/9907072
- 11.Tait, P.G.: On knots. Trans. Royal Society of Edinburgh 28, 145–190 (1876)Google Scholar
- 12.vos Savant, M.: Ask Marilyn. PARADE (2001) (Posed June 10 and solved June 17)Google Scholar