Paper by Erik D. Demaine

Reference:

Erik D. Demaine, Martin L. Demaine, Yair N. Minsky, Joseph S. B. Mitchell, Ronald L. Rivest, and Mihai Pǎtraşcu, “Picture-Hanging Puzzles”, Theory of Computing Systems, volume 54, number 4, May 2014, pages 531–550.

BibTeX

@Article{PictureHanging_TOCS,
  AUTHOR        = {Erik D. Demaine and Martin L. Demaine and Yair N. Minsky and Joseph S. B. Mitchell and Ronald L. Rivest and Mihai P\v{a}tra\c{s}cu},
  TITLE         = {Picture-Hanging Puzzles},
  JOURNAL       = {Theory of Computing Systems},
  VOLUME        = 54,
  NUMBER        = 4,
  MONTH         = {May},
  YEAR          = 2014,
  PAGES         = {531--550},

  length        = {18 pages},
  doi           = {https://dx.doi.org/10.1007/s00224-013-9501-0},
  dblp          = {https://dblp.org/rec/journals/mst/DemaineDMMRP14},
  comments      = {This paper is also available from <A HREF="http://dx.doi.org/10.1007/s00224-013-9501-0">SpringerLink</A>,
                   and as
                   <A HREF="http://arXiv.org/abs/1203.3602">
                   arXiv.org:1203.3602</A> of the
                   <A HREF="http://arXiv.org/archive/cs/intro.html">
                   Computing Research Repository (CoRR)</A>.},
  replaces      = {PictureHanging_FUN2012},
  papers        = {PictureHanging_FUN2012},
  updates       = {Open Problem 1 was in fact previously solved by <A HREF="http://dx.doi.org/10.4064/fm193-3-3">Gartside and Greenwood's paper "Brunnian links" (2007)</A>.  The length of the shortest solution to the 1-out-of-<I>n</I> puzzle is &Theta;(<I>n</I>^2); in fact, the exact bound matches the 2002 Chris Lusby Taylor construction we present.},
}

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.

Comments:

This paper is also available from SpringerLink, and as arXiv.org:1203.3602 of the Computing Research Repository (CoRR).

Updates:

Open Problem 1 was in fact previously solved by Gartside and Greenwood's paper "Brunnian links" (2007). The length of the shortest solution to the 1-out-of-n puzzle is Θ(n^2); in fact, the exact bound matches the 2002 Chris Lusby Taylor construction we present.

Length:

The paper is 18 pages.

Availability:

The paper is available in PDF (6884k).

See information on file formats.

[Google Scholar search]

Related papers:

PictureHanging_FUN2012 (Picture-Hanging Puzzles)