Advertisement

Picture-Hanging Puzzles

  • Erik D. Demaine
  • Martin L. Demaine
  • Yair N. Minsky
  • Joseph S. B. Mitchell
  • Ronald L. Rivest
  • Mihai Pǎtraşcu
Part of the Lecture Notes in Computer Science book series (LNCS, volume 7288)

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.

Keywords

Boolean Function Sorting Network Borromean Ring Monotone Boolean Function Borromean Link 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Brunn, H.: Über Verkettung. Sitzungsberichte der Bayerische Akad. Wiss. 22, 77–99 (1892)Google Scholar
  2. 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
  3. 3.
    Ellul, K., Krawetz, B., Shallit, J., Wang, M.: Regular expressions: new results and open problems. J. Autom. Lang. Comb. 9(2-3), 233–256 (2005)MathSciNetGoogle Scholar
  4. 4.
    Makanin, G.S.: Decidability of the universal and positive theories of a free group. Mathematics of the USSR-Izvestiya 25(1), 75–88 (1985)MathSciNetCrossRefGoogle Scholar
  5. 5.
  6. 6.
    Rolfsen, D.: Knots and Links. Publish or Perish, Inc., Houston (1976)zbMATHGoogle Scholar
  7. 7.
  8. 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. 9.
    Spivak, A.: Brainteasers B 201: Strange painting. Quantum, 13 (May/June 1997)Google Scholar
  10. 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. 11.
    Tait, P.G.: On knots. Trans. Royal Society of Edinburgh 28, 145–190 (1876)Google Scholar
  12. 12.
    vos Savant, M.: Ask Marilyn. PARADE (2001) (Posed June 10 and solved June 17)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2012

Authors and Affiliations

  • Erik D. Demaine
    • 1
  • Martin L. Demaine
    • 1
  • Yair N. Minsky
    • 2
  • Joseph S. B. Mitchell
    • 3
  • Ronald L. Rivest
    • 1
  • Mihai Pǎtraşcu
    • 4
  1. 1.MIT Computer Science and Artificial Intelligence LaboratoryCambridgeUSA
  2. 2.Department of MathematicsYale UniversityNew HavenUSA
  3. 3.Department of Applied Mathematics and StatisticsState University of New YorkStony BrookUSA
  4. 4.AT&T Labs–ResearchFlorham ParkUSA

Personalised recommendations