Mathematics of Paper Folding - Related Problems

Related Problems

The problem of rigid origami, treating the folds as hinges joining two flat, rigid surfaces, such as sheet metal, has great practical importance. For example, the Miura map fold is a rigid fold that has been used to deploy large solar panel arrays for space satellites.

The napkin folding problem is the problem of whether a square or rectangle of paper can be folded so the perimeter of the flat figure is greater than that of the original square.

Curved origami also poses a (very different) set of mathematical challenges. Curved origami allows the paper to form developable surfaces that are not flat.

Wet-folding origami allows an even greater range of shapes.

The maximum number of times an incompressible material can be folded has been derived. With each fold a certain amount of paper is lost to potential folding. The loss function for folding paper in half in a single direction was given to be, where L is the minimum length of the paper (or other material), t is the material's thickness, and n is the number of folds possible. The distances L and t must be expressed in the same units, such as inches. This function was derived by Britney Gallivan in 2001 (then only a high school student) who then folded a sheet of paper in half 12 times, contrary to the popular belief that paper of any size could be folded at most eight times. She also derived the equation for folding in alternate directions.

The fold-and-cut problem asks what shapes can be obtained by folding a piece of paper flat, and making a single straight complete cut. The solution, known as the Fold and Cut Theorem, states that any shape with straight sides can be obtained.