Napkin folding problem

Last updated

The napkin folding problem is a problem in geometry and the mathematics of paper folding that explores whether folding a square or a rectangular napkin can increase its perimeter. The problem is known under several names, including the Margulis napkin problem, suggesting it is due to Grigory Margulis, and the Arnold's rouble problem referring to Vladimir Arnold and the folding of a Russian ruble bank note. Some versions of the problem were solved by Robert J. Lang, Svetlana Krat, Alexey S. Tarasov, and Ivan Yaschenko. One form of the problem remains open.

Contents

Formulations

There are several way to define the notion of folding, giving different interpretations. By convention, the napkin is always a unit square.

Folding along a straight line

Considering the folding as a reflection along a line that reflects all the layers of the napkin, the perimeter is always non-increasing, thus never exceeding 4. [1] [2]

By considering more general foldings that possibly reflect only a single layer of the napkin (in this case, each folding is a reflection of a connected component of folded napkin on one side of a straight line), it is still open if a sequence of these foldings can increase the perimeter. [3] In other words, it is still unknown if there exists a solution that can be folded using some combination of mountain folds, valley folds, reverse folds, and/or sink folds (with all folds in the latter two cases being formed along a single line). Also unknown, of course, is whether such a fold would be possible using the more-restrictive pureland origami.

Folding without stretching

One can ask for a realizable construction within the constraints of rigid origami where the napkin is never stretched whilst being folded. In 2004 A. Tarasov showed that such constructions can indeed be obtained. This can be considered a complete solution to the original problem. [4]

Where only the result matters

One can ask whether there exists a folded planar napkin (without regard as to how it was folded into that shape).

Robert J. Lang showed in 1997 [2] that several classical origami constructions give rise to an easy solution. [5] In fact, Lang showed that the perimeter can be made as large as desired by making the construction more complicated, while still resulting in a flat folded solution. However his constructions are not necessarily rigid origami because of their use of sink folds and related forms. Although no stretching is needed in sink and unsink folds, it is often (though not always) necessary to curve facets and/or sweep one or more creases continuously through the paper in intermediate steps before obtaining a flat result. Whether a general rigidly foldable solution exists based on sink folds is an open problem.[ citation needed ]

In 1998, I. Yaschenko constructed a 3D folding with projection onto a plane which has a bigger perimeter. [6] This indicated to mathematicians that there was probably a flat folded solution to the problem.[ citation needed ]

The same conclusion was made by Svetlana Krat. [7] Her approach is different, she gives very simple construction of a "rumpling" which increase perimeter and then proves that any "rumpling" can be arbitrarily well approximated by a "folding". In essence she shows that the precise details of the how to do the folds don't matter much if stretching is allowed in intermediate steps.[ citation needed ]

Solutions

Lang's solutions

Crease pattern for Lang's sea urchin-like solution with N = 5 Napkin folding problem Lang N 5.svg
Crease pattern for Lang's sea urchin-like solution with N = 5

Lang devised two different solutions. [5] [8] Both involved sinking flaps and so were not necessarily rigidly foldable. The simplest was based on the origami bird base and gave a solution with a perimeter of about 4.12 compared to the original perimeter of 4.

The second solution can be used to make a figure with a perimeter as large as desired. He divides the square into a large number of smaller squares and employs the 'sea urchin' type origami construction described in his 1990 book, Origami Sea Life. [8] The crease pattern shown is the n = 5 case and can be used to produce a flat figure with 25 flaps, one for each of the large circles, and sinking is used to thin them. When very thin the 25 arms will give a 25 pointed star with a small center and a perimeter approaching N2/(N  1). In the case of N = 5 this is about 6.25, and the total length goes up approximately as N.

History

Arnold states in his book that he formulated the problem in 1956, but the formulation was left intentionally vague. [1] [9] He called it 'the rumpled rouble problem', and it was the first of many interesting problems he set at seminars in Moscow over 40 years. In the West, it became known as Margulis napkin problem after Jim Propp's newsgroup posting in 1996. [2] Despite attention, it received folklore status and its origin is often referred as "unknown". [6]

Related Research Articles

<i>Origami</i> Traditional Japanese art of paper folding

Origami is the art of paper folding, which is often associated with Japanese culture. In modern usage, the word "origami" is used as an inclusive term for all folding practices, regardless of their culture of origin. The goal is to transform a flat square sheet of paper into a finished sculpture through folding and sculpting techniques. Modern origami practitioners generally discourage the use of cuts, glue, or markings on the paper. Origami folders often use the Japanese word kirigami to refer to designs which use cuts.

Yoshizawa–Randlett system

The Yoshizawa–Randlett system is a diagramming system used to describe the folds of origami models. Many origami books begin with a description of basic origami techniques which are used to construct the models. There are also a number of standard bases which are commonly used as a first step in construction. Models are typically classified as requiring low, intermediate or high skill depending on the complexity of the techniques involved in the construction.

Mathematics of paper folding Overview of the mathematics of paper folding

The discipline of origami or paper folding has received a considerable amount of mathematical study. Fields of interest include a given paper model's flat-foldability, and the use of paper folds to solve up-to cubic mathematical equations.

The Huzita–Justin axioms or Huzita–Hatori axioms are a set of rules related to the mathematical principles of origami, describing the operations that can be made when folding a piece of paper. The axioms assume that the operations are completed on a plane, and that all folds are linear. These are not a minimal set of axioms but rather the complete set of possible single folds.

Modular origami

Modular origami or unit origami is a paperfolding technique which uses two or more sheets of paper to create a larger and more complex structure than would be possible using single-piece origami techniques. Each individual sheet of paper is folded into a module, or unit, and then modules are assembled into an integrated flat shape or three-dimensional structure, usually by inserting flaps into pockets created by the folding process. These insertions create tension or friction that holds the model together.

In mathematics, singularity theory studies spaces that are almost manifolds, but not quite. A string can serve as an example of a one-dimensional manifold, if one neglects its thickness. A singularity can be made by balling it up, dropping it on the floor, and flattening it. In some places the flat string will cross itself in an approximate "X" shape. The points on the floor where it does this are one kind of singularity, the double point: one bit of the floor corresponds to more than one bit of string. Perhaps the string will also touch itself without crossing, like an underlined "U". This is another kind of singularity. Unlike the double point, it is not stable, in the sense that a small push will lift the bottom of the "U" away from the "underline".

Net (polyhedron)

In geometry, a net of a polyhedron is an arrangement of non-overlapping edge-joined polygons in the plane which can be folded to become the faces of the polyhedron. Polyhedral nets are a useful aid to the study of polyhedra and solid geometry in general, as they allow for physical models of polyhedra to be constructed from material such as thin cardboard.

Robert J. Lang American physicist (born 1961)

Robert J. Lang is an American physicist who is also one of the foremost origami artists and theorists in the world. He is known for his complex and elegant designs, most notably of insects and animals. He has studied the mathematics of origami and used computers to study the theories behind origami. He has made great advances in making real-world applications of origami to engineering problems.

Kawasakis theorem Result about crease patterns with a single vertex that may be folded to form a flat figure

Kawasaki's theorem is a theorem in the mathematics of paper folding that describes the crease patterns with a single vertex that may be folded to form a flat figure. It states that the pattern is flat-foldable if and only if alternatingly adding and subtracting the angles of consecutive folds around the vertex gives an alternating sum of zero. Crease patterns with more than one vertex do not obey such a simple criterion, and are NP-hard to fold.

Rigid origami is a branch of origami which is concerned with folding structures using flat rigid sheets joined by hinges. That is, unlike with paper origami, the sheets cannot bend during the folding process; they must remain flat at all times. However, there is no requirement that the structure start as a single flat sheet – for instance shopping bags with flat bottoms are studied as part of rigid origami.

In the mathematics of paper folding, map folding and stamp folding are two problems of counting the number of ways that a piece of paper can be folded. In the stamp folding problem, the paper is a strip of stamps with creases between them, and the folds must lie on the creases. In the map folding problem, the paper is a map, divided by creases into rectangles, and the folds must again lie only along these creases.

Napkin folding

Napkin folding is a type of decorative folding done with a napkin. It can be done as art or as a hobby. Napkin folding is most commonly encountered as a table decoration in fancy restaurants. Typically, and for best results, a clean, pressed, and starched square cloth napkin is used. There are variations in napkin folding in which a rectangular napkin, a napkin ring, a glass, or multiple napkins may be used.

Yoshimura buckling

In mechanical engineering, Yoshimura buckling is a triangular mesh buckling pattern found in thin-walled cylinders under compression along the axis of the cylinder, producing a corrugated shape resembling the Schwarz lantern. The same pattern can be seen on the sleeves of Mona Lisa.

Developable mechanisms are a special class of mechanisms that can be placed on developable surfaces.

Geometric Folding Algorithms: Linkages, Origami, Polyhedra is a monograph on the mathematics and computational geometry of mechanical linkages, paper folding, and polyhedral nets, by Erik Demaine and Joseph O'Rourke. It was published in 2007 by Cambridge University Press (ISBN 978-0-521-85757-4). A Japanese-language translation by Ryuhei Uehara was published in 2009 by the Modern Science Company (ISBN 978-4-7649-0377-7).

In the mathematics of paper folding, the big-little-big lemma is a necessary condition for a crease pattern with specified mountain folds and valley folds to be able to be folded flat. It differs from Kawasaki's theorem, which characterizes the flat-foldable crease patterns in which a mountain-valley assignment has not yet been made. Together with Maekawa's theorem on the total number of folds of each type, the big-little-big lemma is one of the two main conditions used to characterize the flat-foldability of mountain-valley assignments for crease patterns that meet the conditions of Kawasaki's theorem. Mathematical origami expert Tom Hull calls the big-little-big lemma "one of the most basic rules" for flat foldability of crease patterns.

Origami Polyhedra Design is a book on origami designs for constructing polyhedra. It was written by origami artist and mathematician John Montroll, and published in 2009 by A K Peters.

Tomohiro Tachi is a Japanese academic who studies origami from an interdisciplinary perspective, combining approaches from the mathematics of paper folding, structural rigidity, computational geometry, architecture, and materials science. His work was profiled in "The Origami Revolution" (2017), part of the Nova series of US science documentaries. He is an associate professor at the University of Tokyo.

Blooming (geometry)

In the geometry of convex polyhedra, blooming or continuous blooming is a continuous three-dimensional motion of the surface of the polyhedron, cut to form a polyhedral net, from the polyhedron into a flat and non-self-overlapping placement of the net in a plane. As in rigid origami, the polygons of the net must remain individually flat throughout the motion, and are not allowed to intersect or cross through each other. A blooming, reversed to go from the flat net to a polyhedron, can be thought of intuitively as a way to fold the polyhedron from a paper net without bending the paper except at its designated creases.

References

  1. 1 2 Arnold, Vladimir Igorevich (2005). Arnold's Problems. Berlin: Springer. ISBN   3-540-20748-1.
  2. 1 2 3 "The Margulis Napkin Problem, newsgroup discussion of 1996". Geometry Junkyard.
  3. Petrunin, Anton (2008). "Arnold's problem on paper folding". Zadachi Sankt-peterburgskoj Matematicheskoj Olimpiady Shkol'nikov Po Matematike (in Russian). arXiv: 1004.0545 . Bibcode:2010arXiv1004.0545P.
  4. Tarasov, A. S. (2004). "Solution of Arnold's "folded ruble" problem". Chebyshevskii Sbornik (in Russian). 5 (1): 174–187. Archived from the original on 2007-08-25.
  5. 1 2 Lang, Robert J. (2003). Origami Design Secrets: Mathematical Methods for an Ancient Art . A K Peters. pp.  315–319.
  6. 1 2 Yaschenko, I. (1998). "Make your dollar bigger now!!!". Math. Intelligencer . 20 (2): 38–40. doi:10.1007/BF03025296. S2CID   124667472.
  7. S. Krat, Approximation Problems in Length Geometry, Ph.D. thesis, Pennsylvania State University, 2005
  8. 1 2 Montroll, John and Robert J. Lang (1990). Origami Sea Life. Dover Publications. pp. 195–201.
  9. Tabachnikov, Sergei (2007). "Book review of "Arnold's problems"" (PDF). Math. Intelligencer . 29 (1): 49–52. doi:10.1007/BF02984760. S2CID   120833539.