Constraint — where it appears
Named by 23 essays across 8 fields — each of them below, with the objects they name alongside it.
The same corrugation in four places
A leaf, a wing, a crushed cylinder and a solar array arrive at nearly the same fold, and none of them copied any of the others. Convergence stories are cheap; this one is checkable, because the constraint that forces it can be computed rather than admired.
Fenced at both ends
The twist angle of a tessellation looks like a free dial, and it is fenced twice. Turn too far and the pleats have no paper left. Turn too little and something stranger happens: every angle condition in the subject goes on holding and the pattern loses its mountain-valley assignment entirely.
How little the conditions decide
Local is not global is a statement about sufficiency: every vertex can pass and the sheet still fail. There is a sharper complaint available, and it is about strength. Fix one crease of a tessellation and propagate every condition the subject has to a fixed point: three creases out of a hundred and fifty-eight follow, and sixty-six vertices are still holding more than one answer.
The shapes the optimum has
Requiring a circle packing to be its own mirror image halves the number of coordinates a search has to find, so the same effort covers a much smaller space. Whether that helps depends on something the search cannot know in advance — whether the best packing was symmetric — and measured flap count by flap count the answer alternates without a pattern anybody could use.
The rim is four letters a cell
Cut a rectangle out of a tessellation and it asks exactly the vertices the tessellation asks, exactly the same questions. What it adds is four free letters for every period of edge — the creases the cut divides, which become two independently answerable creases instead of one. Eight letters on a two-period square, sixteen on a four-period one, and nothing else about the two objects differs at all.
The bottom layer is at the rim
A hundred and sixty-nine panels of folded tessellation, and three of them have nothing underneath. All three touch the paper's edge, and the same is true on every tiling at every size measured. Which panel is at the bottom of a stack turns out to be a fact about where the sheet was cut rather than about the pattern, and the pattern itself has no bottom at all.
A knife edge nine decimals wide
Draw the Yoshimura with its rows 1.7320508 half-columns tall and each vertex admits thirty labellings and the pattern costs fifty-seven steps. Draw it at 1.7320509 and each admits eight and it costs nineteen. The number between them is √3, which is the proportion everybody draws — and below it the sectors are unequal and the lemma is still silent, because the small ones sit next to each other.
Pruning on proofs alone
A search that discards a branch it cannot prove wrong is not a search. Deciding whether a periodic pattern's layer relations really contradict themselves is far dearer than the disc's one-pass test, so the cheap test is asked first — it is sufficient, so it settles almost everything — and the expensive one runs only on what the cheap one rejects. Five of nine steps on a small cell, fifty thousand of fifty-seven on a large one.
The cost of proving something false
A search closing its whole tree is the strongest result this collection can produce, and on a glued tessellation it produces one that is wrong. What it costs to reach is three steps at one period, thirty-five at four, three thousand four hundred and fifty-five at nine, and more than two hundred thousand at sixteen — growing far faster than the cost of finding the lettering it says does not exist.
Where you cut hardly matters
Slide the same rectangle across one whole period of the same tessellation and every position gives a different patch: different creases divided, different half-panels round the edge, panel counts from forty-nine to sixty-one. The cost of lettering them runs from twenty-five steps to thirty-three. Whether a cut is made changes the answer by three orders of magnitude; where it falls changes it by a third.
The most decided vertex here
Sixteen ways to letter four creases; Maekawa allows eight; the big-little-big lemma allows four. A twist polygon's corner is one of the few vertices in this collection where the second cut applies, so it keeps four labellings where a grid, a leaf, a Miura and a crumple all keep eight — and the family the collection long called difficult turns out to be the one whose conditions decide the most.
The edge was not what made it hard
Five families of pattern searched at one step per panel and a tessellation patch did not, and the property left standing after four alternatives were killed was having a rim. Measured under a fixed letter order the patches cost between a half and two-thirds of a step per panel, at every tiling and every size — below the line rather than above it, and the rim is why.
An order with no least element
Enumerating every way a folded pattern can be stacked works by building upward from a panel with nothing below it. The smallest square twist patch has exactly one such stacking and takes eleven thousand steps to find it. The pattern that patch was cut from has no panel with nothing below it at all, so the enumeration has nothing to start from — and the sheet is perfectly well stacked anyway.
A test imported without its hypothesis
The rule that a loop in a folded sheet's layer relations proves the pattern cannot fold arrives from the layer-ordering literature, where the sheet is a disc and the panels are finitely many. This collection took the rule and not the sentence that says which sheets it is about, then applied it for years to patterns whose whole interest is that they repeat.
A mechanism that closes on itself
A rigid-foldable pattern is a mechanism: panels as rigid plates, creases as hinges, and a motion counted by degrees of freedom at each vertex. Close the sheet into a tube and the mechanism has to come back to itself after a circuit — a constraint that is not at any vertex and that the degree-of-freedom count does not see.
The channel grows with what it feeds
A comb of standing walls beats a stack of plies by eight because its members do not share the clearance that pays them. Supply takes that back, and asymmetrically: a wall's channel has to be sized for the surface the wall carries, so it grows with the wall's height and is charged against the pitch, while a ply's channel is a constant charged against the clearance. The comb then saturates at twice the reciprocal of the channel's share, the stack does not saturate at all, and the two cross at a clearance the model gives in closed form.
Every pair, not every circle
A uniaxial base is designed by packing a circle for each flap, and the circles are not the condition. The condition is that every pair of the subject's extremities be separated on the sheet by the distance between them through the tree — which for two flaps meeting at one point is the sum of their lengths, and for two flaps across a body is more. Circles are the case with no body in it, so a design read off circles alone is promised a base sixteen to thirty per cent larger than the sheet can give.
What the condition does not decide
A tree of seven leaves imposes twenty-one separations and eight of them bind. The rest are slack, the eight pin six of the seven leaves against the sheet's own edges, and the seventh can be moved half a per cent of the sheet for nothing. The requirement that looks quadratic is doing linear work, and what it leaves undecided is the part a designer is actually choosing.
The price of a limb is not its length
Lengthening an edge of a subject's tree costs the design some of its scale, and the amount can be measured by re-solving the arrangement. It is not proportional to the edge, and it is not the body that is dearest. On a bird whose wings are twice its legs, the head — nine tenths of a unit against the wings' one and six — costs three times what a wing costs, and two edges of a lizard cost nothing at all.
Where a ring of divisions belongs
A pattern that divides the circle everywhere as finely as its rim requires is over-divided for most of its radius, because the excess grows from nothing. Putting a ring of new divisions in wherever the residual would otherwise pass what the material takes gives seven rings on a hemisphere at five per cent of stretch, at 0.35, 0.50, 0.62, 0.72, 0.81, 0.90 and 0.98 of the way out — and the first of those sits where a completely different criterion put its first tuck start.
The angle the eight does not know
A comb's members are always drawn standing square to the base, and nothing has asked why. Lean one to an angle and it must be longer to reach the same clearance, which is more surface; it also takes more of the base to stand on, which is fewer members. The two are reciprocal and cancel exactly — the surface a comb holds is the same number from a right angle down to one degree, where each member is fifty-seven times the clearance long and there are two of them where there were a hundred.
In a tube the standing members lose
Members standing across a clearance beat layers lying along it by eight, and every drawing of that argument has a flat base under it. Curve the base into a tube and the ranking inverts: radial fins converge, so the room they need is the room at their tips, and their best arrangement fills exactly half the cross-section. Concentric layers fill all of it. The eight becomes a half, and the half is exact.
The wedge belongs to one length
Radial fins inside a tube reach at best half of what any lining of sheet could hold, because converging fins leave empty wedges behind their tips. Tapering the fins cannot help: the tip already sets the count, and a fin cannot be thinner there than the sheet it is made of. Fins of several lengths can. Counted along the radius they are a staircase under a straight line, and the staircase with m steps is best with its steps equally spaced, where it holds exactly m ⁄ (m + 1) of the ceiling. The factor of two belonged to fins of one length, not to fins.
Named alongside it
The objects these essays reach for when they reach for this one.
TessellationAssignmentPanelPeriodicityBoundarySearch costLayer orderTrade-offThe big-little-big lemmaConstraint propagationDegrees of freedomDesign