Constructibility — where it appears
Named by 14 essays across one field — each of them below, with the objects they name alongside it.
Two creases at once
The seven axioms describe what one fold can do, and the restriction to one fold is a rule somebody imposed rather than a property of paper. Allow two creases to be made simultaneously and the reachable degree rises — and the hendecagon nobody could fold becomes foldable.
The largest triangle in a square
The biggest equilateral triangle a square sheet holds is tilted by exactly fifteen degrees and uses 46.4% of the paper. Both numbers come out of a quadratic — which means a compass reaches this optimum too, and folding's advantage is not needed here at all.
The biggest one that can also be folded
Which regular polygon uses a square sheet best, and which of them a fold can actually construct, are two questions with completely different pedigrees. Answered side by side over sixteen polygons, they turn out to agree — and the reason is that both are questions about the arithmetic of the same number.
A fold needs something to align
Every axiom names things that must already be on the paper — a point to fold onto a point, a line to bring to a line. So what a folder can build is bounded by what they can refer to, and that set is finite at every depth: nine references after one fold, several hundred after two, and every one of them computable in advance.
Seven, and then twenty-two
The seven axioms are not seven useful folds somebody collected; they are the number of ways to spend a fold line's two degrees of freedom, and the count can be derived. Run the same derivation for two folds made at once and it gives twenty-two, for three fifty, for five a hundred and sixty-one — while the number of coincidences a pair of hands has to achieve in the same instant goes two, four, six, ten.
A hole is an edge
A folder's first fold has to be specified by aligning things that are already there, and what is already there is the sheet's outline. Cut a square hole in the middle and the outline doubles: one round of alignments reaches nine references on a plain square and two hundred and twelve on a holed one — more than the plain square reaches in two rounds.
Which of the seven survive
The seven axioms are the complete list of ways one fold can be specified by aligning marked things. Every one of them names points and lines on a sheet, three of them quietly assume that a line has two sides, and on a closed sheet a line need not — so the list is complete for a disc and shorter for anything else.
The proportion a band asks for
√2 is a shape: a rectangle either has it or does not, and what it buys is that halving returns the same shape. √3 is what a Möbius band needs, and it is a different kind of number — a minimum rather than a shape, with every longer strip working and no shorter one.
Every even polygon beats every odd one
Crossed with what each tool can build, the census of the largest regular polygon a sheet holds gives the same verdict on every proportion from a square to three to one: the best polygon is one a compass already builds, and the best polygon only a fold can build places fourth at best. The ranking itself stops moving at a proportion of 1.1284, where the hexagon overtakes the octagon. On every longer sheet only the short side holds a polygon, each polygon's share is a fixed constant divided by the length, and the constant — its area over the square of its least width — comes down to the circle's π⁄4 for even polygons and climbs up to it for odd ones. So every even polygon beats every odd one.
Counting operations is not counting power
The catalogue of simultaneous-fold operations runs from seven to nearly ten million between one fold and five. What a construction can reach does not: each fold admits at most three lines, because two parabolas have three proper common tangents and not four, so m folds admit at most three to the m — and the largest polynomial degree they actually settle is smaller again, at twice m plus one. Three counts of the same subject, growing at three speeds.
A crease that does not exist yet
Simultaneous folding is usually described as a problem of dexterity — several coincidences to be achieved in the same instant. The reference graph says otherwise: of the hundred and five two-fold operations, twenty-eight need no simultaneity and forty-nine can be done in an order, leaving twenty-eight whose folds each name the other. Those are not hard to hold. They are hard to know, and a loop that guesses and re-solves finds them at eight per cent of the error a pass.
The crossing is as hard as the polygon
Lengthen a square sheet and the largest hexagon it holds turns, pressed against all four edges, until it overtakes the polygons held by the short side alone. Every one of those overtakings happens at a proportion with a closed form, √3⁄2 + ½√(8K⁄3√3 − 1), and the number that comes out is exactly as hard to mark as the polygon being overtaken is to build. The octagon's 1.1284 is a compass number of degree eight. The heptagon's 1.0696 has degree twenty-four and needs a fold. The hendecagon's 1.0853 has degree forty and needs two folds at once.
The sheet a polygon fits exactly
A regular polygon with 4k + 2 sides has flat edges along one axis and corners along the other, so there is one sheet, 1⁄cos(π⁄n) long, that it touches on all four edges at once. On that sheet it is beaten only by the multiples of four with fewer sides, and so it ranks exactly (n − 2)⁄4. That puts the fourteen-gon, which only a fold builds, third rather than fourth; the twenty-two-gon, which needs two folds at once, fifth rather than ninth; and the forty-six-gon, beyond two folds, eleventh. Seven sheets from a square to three to one had missed all three.
Turning is uphill all the way
A regular polygon of 4k + 2 sides on a sheet a little longer than a square cannot lie flat: it turns, pressed against all four edges, until the sheet is exactly its own. Its share on the way has a closed form, and the closed form's slope is proportional to h² − 1 for every such polygon — flat on the square, rising all the way to the own sheet, and falling after it. So the own sheet is exactly the peak, the gain from the square to it is the average of one and the sheet's length, and the rank the census measured for polygons of this kind, (n − 2)⁄4, is now a theorem.
Named alongside it
The objects these essays reach for when they reach for this one.
Inscribed polygonOptimalitySheet shapeTotientThe Huzita–Hatori axiomsMultifoldEnumerationOperation setAxiomAxiomsCubicDegrees of freedom