Field

Folding nobody designed

Leaves, wings and single strands of DNA all fold, and none of them were folded by anybody. Growth changes a sheet's own metric where a crease changes only its shape — the same geometry read in the opposite direction, and every figure here draws a fold this repository computed rather than an organism it did not measure.
00.20.40.60.8100.511.5radius on the flat sheetgrowth factor Ωhow much each ring grew00.20.40.60.81-2-112radius on the flat sheetcurvature Kclosed formthe curvature that forcesgrown more at the rim · K(0) = −4a = -2.40

A sheet that grows cannot lie flat

A leaf does not decide to buckle. Growth changes the distances between a sheet's own material points, a set of distances determines a curvature, and a curvature that is not zero cannot be laid in a plane by anything — whatever the sheet is made of and however slowly it grew.

a = 0.6K(0) = -2.40opens — a rufflearea ×1.72a = 0.25K(0) = -1.00opens — a rufflearea ×1.27a = 0K(0) = 0.00stays flatarea ×1.00a = -0.25K(0) = 1.00closes — a domearea ×0.77a = -0.4K(0) = 1.60closes — a domearea ×0.65the growth factor is the same function throughout — only the sign of one number changesΩ = 1 + a r² · rim-heavy growth opens the sheet, centre-heavy growth closes it

Which way the disc curves

A growing disc either domes or ruffles, and which one it does is not a matter of how much it grew. It is decided by where the growth was — more at the rim opens the sheet, more at the middle closes it — and one number in one formula takes it through both.

one excess of length, 4 ways to spend it2 wavesheight 0.0398∫κ² ds = 173 wavesheight 0.0266∫κ² ds = 395 wavesheight 0.0159∫κ² ds = 1088 wavesheight 0.0100∫κ² ds = 276amplitude × waves is constant, so these are one shape at four scalesexcess 6.0% of the span · every profile below has exactly that excess

The excess does not choose its waves

A rim that has grown longer than its span has to put the extra length somewhere, and two large waves and eight small ones are the same metric — identical arc length, identical excess. Geometry fixes the family and is completely indifferent about the member.

a crease — concentrated at a pointdeficit 0.5236 rad, all of it hereflat everywhere elsegrowth — spread over the areatotal 0.5236 rad, none of it anywherecurved at every pointa 30° wedge removed, against Ω = 1 − 0.0400 r² · same total curvature, 0.5236

A crease carries no curvature

A fold looks like the sharpest curvature a sheet could have, and intrinsically it has none at all. Developability — the first of the four conditions this site's checker runs — is exactly the statement that folding an uncut sheet creates no curvature anywhere, including at the creases.

18 interior vertices26 mountains · 19 valleyscolumns taper 2.44 : 1packs to 11.2% of flatmountainvalleyraw edgethe taper is in the columns, because Kawasaki does not mention their widthtapering the rows instead puts the alternating sums at 186.4° and 173.6°

A leaf packs by corrugating

A corrugation is the cheapest fold there is — parallel creases, no interior vertex to think about — and a leaf that uses one has to taper it, because a leaf is broad in the middle. Which direction the taper is allowed to run turns out not to be a matter of taste.

051015202500.511.522.5number of foldsbundle radiusthe bud, radius 1.248121624tightest at 12 foldsbud radius 1.2 · leaf area 340 · layer thickness 0.12

The bud chooses the pattern

Nothing in the geometry of a corrugation says how many folds it should have. The container does: too few folds is a strip too wide to fit, too many is a stack too thick to fit, and the window that fits at all is narrow and has a best point in the middle of it.

00.20.40.60.811.21.402468fold angle (radians)exposed spanθ = 0.06θ = 0.75θ = 1.449 panels · one parameter · the span rises at every step, so nothing has to reverse

Opening with nothing to pull

A leaf is not opened by a hand, a hinge or a motor. It opens because it keeps growing — which puts a condition on the pattern that no folder ever has to satisfy, because a person can always push.

geometrypacks tocorrugation8 panels at 0.42 rad40.8% — 2.5× smallerMiura6 × 4, 15 interior vertices16.6% — 6.0× smallerfan8 sectors about one point25.0% — 4.0× smallerroll8 turns12.5% — 8.0× smallerpacked area as a fraction of deployed, computed from each geometry — not measured from any animal

A wing that folds into nothing

A beetle stows a wing longer than its body under a case a fraction of that length, and the ratio is the whole engineering problem. What a fold achieves is computable from the pattern alone, and the four geometries available are not close to each other.

geometryfreedomsdrivers neededone degree-four vertexfour assignments, one motion each11Miura, 5 × 412 interior vertices, still one freedom11parallel corrugationno interior vertex to couple1112 vertices, uncoupledwhat a pattern costs when nothing constrains it1212or a sequencerone freedom is one actuator — the count is what makes a passive deployment possible at all

No motor in the fold

An insect's wing has muscles at its base and nothing out along its length, so the pattern has to carry the deployment by itself. The condition that makes that possible is a count: one degree of freedom means one number determines every panel, which means one thing has to pull.

010203040506000.20.40.60.81foldsshare of the sheet lost to hinges50% of the sheet64 foldshinge radius 0.08 on a 10 unit sheet · (π − 2)ρ = 0.0913 lost per fold

Nothing in a body folds on a line

A crease in an organism is not a crease. It is a compliant region — a patch of thinner material that bends — and a region has a width. The width consumes surface in exact proportion to the number of folds, which puts a ceiling on how fine a pattern can usefully get.

0204060801001200510152025foldssurface heldpeak at 64 foldsbox of side 1 · sheet thickness 0.01 · most surface at 64 folds · 128 folds fills the box with sheet alone

How much surface fits in a body

An organ whose whole job is to have area — a gut, a gill, a cortex — is solving a packing problem in reverse. Folding buys surface inside a fixed volume, and with a sheet of zero thickness it buys an unlimited amount. With a thickness the curve turns over and then falls to nothing.

a route the search found123456121110987131415161718242322212019helices 24colours 12 : 12a route is not forbiddenscaffold used 21%48 staples of 3224 helices · 1536 bases · 48 staples · colours 12 : 12

A sheet that routes itself

DNA origami folds one long strand into a shape by holding it against itself with a few hundred short ones. There is no sheet and no crease — what has to be designed is a route — and the first thing that can go wrong is a counting argument crease patterns already know under another name.

246810012345units (creases, or joints)log₁₀ statesa chain, 3 states per jointa sheet, two letters per creaseat one vertex, 4 of 16 assignments survive four local conditionsthe sheet's count has a local test that removes 75% of it · the chain's has none

Two things called folding

A protein folds and a sheet folds, and the word is the same word by accident. Both have exponentially many states and that is not the difference. The difference is that one of them can be filtered by four conditions checked at a single point, and the other cannot be filtered by anything local at all.

geometrypacks tocorrugation8 panels at 0.42 rad40.8% — 2.5× smallerMiura6 × 4, 15 interior vertices16.6% — 6.0× smallerfan8 sectors about one point25.0% — 4.0× smallerroll8 turns12.5% — 8.0× smallerpacked area as a fraction of deployed, computed from each geometry — not measured from any animal

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.

computed herenot established herethe curvature a growth field forcesthe growth solverthat any leaf grows that waythat a corrugation with tapered columns folds flatthe pattern librarythat a leaf's creases are where these arethe packed fraction of four folding geometrieswing-packingthe packed fraction of any wingthat one freedom needs one driverdof-censushow an insect actually deploys a wingthe surface a fold count fits in a boxsurface-in-volumethe surface area of any organwhich lattice shapes admit a single routethe routing modulethat any published design used this routeevery row's left side is a computation in this repository; every right side is a claim it does not make

The organism is not the model

Every figure in this field draws a fold this repository computed. Not one of them measures a leaf, a wing or a gut. That is the rule the field was built to, and it is worth stating as a table rather than as a preamble — because a field about living things is where a computed geometry is most likely to be read as an observation.

0204060801001200510152025foldssurface heldpeak at 64 foldsbox of side 1 · sheet thickness 0.01 · most surface at 64 folds · 128 folds fills the box with sheet alone

Four finders, one option

Four unrelated lineages arriving at the same corrugation is read as evidence that the corrugation is good. It is at least as much evidence that there was nothing else to arrive at: how far a folded sheet shrinks is exactly its average layer count, so a lineage choosing a packing ratio is choosing a number of layers and nothing else — and the quantity that is genuinely free turns out to be almost uncorrelated with it.

a strand of 7249 bases at 64 to a helixthe bar is the largest member of the family that is still buildablea square blockstopped by the strand's length100 helices · 88% of the stranda single rowstopped by the strand's length113 helices · 100% of the stranda comb of teethstopped by the routing5 helices · 4% of the stranda plusstopped by the routingno size works at allan L with equal armsstopped by the strand's length113 helices · 100% of the strand

Two ceilings

A DNA origami is limited by the length of one viral strand and by whether its helices can be visited once each in a single pass. Grown one step at a time, a square block runs into the first at a hundred helices and a plus runs into the second at five — so which limit a shape meets is decided by the shape and not by the chemistry.

the bar is the deepest point of the pile, in layersthe average is what an area calculation would use, and it is about half of it2 rows814 panels · average 4.15 · 1.93 times it3 rows1221 panels · average 6.23 · 1.93 times it4 rows1628 panels · average 8.31 · 1.93 times it5 rows2035 panels · average 10.38 · 1.93 times itthe footprint does not grow as rows are added; the depth does, and the ratio does not

Twice as thick where it is thickest

A folded leaf's thickness is quoted as an area calculation: so much lamina, so much footprint, so many layers on average. The average is not what has to fit in the bud. Sampling the folded state of corrugated leaf patterns of two to five rows gives a deepest point of eight, twelve, sixteen and twenty layers against averages of 4.15, 6.23, 8.31 and 10.39 — a ratio of 1.926 that does not move at all.

18 interior vertices26 mountains · 19 valleyscolumns taper 2.44 : 1packs to 11.2% of flatmountainvalleyraw edgethe taper is in the columns, because Kawasaki does not mention their widthtapering the rows instead puts the alternating sums at 186.4° and 173.6°

A leaf ends its pattern

A hornbeam leaf's corrugation does not stop at the margin by being cut off: the pleats narrow until there is nothing left of them, and the margin is where the pattern reaches zero rather than where it was interrupted. The same is available to a drawn pattern and costs nothing — a corrugation tapered by a factor of eighty-two across its columns folds with a Kawasaki residual of 4×10⁻¹⁶, exactly as an untapered one does, because the column widths never enter the condition.

18 interior vertices26 mountains · 19 valleyscolumns taper 2.44 : 1packs to 11.2% of flatmountainvalleyraw edgethe taper is in the columns, because Kawasaki does not mention their widthtapering the rows instead puts the alternating sums at 186.4° and 173.6°

The taper decides nothing

A leaf's corrugation narrows toward its margin, and the taper is what the pattern is for. It has no effect whatever on how often the pattern's letters agree with themselves: four width profiles from perfectly even to strongly tapered give a hundred and seventy-four consistent letterings of two hundred, identically. What moves the number is the count of rows, and on that measure a leaf tracks a Miura rather than the corrugation it most resembles.

the bar is how many repeating rules fold, and it is the same bar six timesthe same corrugation redrawn at six geometries, every one of them swept in fullas printed1648 refused, all by the count · 38 of them close a circle of foureven columns1648 refused, all by the count · 38 of them close a circle of foura one-sided ramp1648 refused, all by the count · 38 of them close a circle of foura violent taper1648 refused, all by the count · 38 of them close a circle of foursix taller rows1648 refused, all by the count · 38 of them close a circle of foura steeper zigzag1648 refused, all by the count · 38 of them close a circle of fourno vertex condition reads a column width, a row height or a row count, so none of them can move the table

The leaf's rules are the Miura's

A plicate leaf packs into a corrugation that is broad in the middle and narrow at both ends. Enumerate every repeating mountain-valley rule it admits and the table is the Miura fold's table, rule for rule, number for number — and it stays that table when the leaf is redrawn with even columns, a violent taper, taller rows or a steeper zigzag. The plant's geometry cannot reach its own letters.

18 interior vertices26 mountains · 19 valleyscolumns taper 2.44 : 1packs to 11.2% of flatmountainvalleyraw edgethe taper is in the columns, because Kawasaki does not mention their widthtapering the rows instead puts the alternating sums at 186.4° and 173.6°

The plant's pattern is not a hard case

A hornbeam leaf packs into its bud by corrugating, and the pattern it uses gives up a consistent lettering at nine, twelve, fifteen, eighteen, twenty and twenty-four steps on nine, twelve, fifteen, eighteen, twenty and twenty-four panels. Nothing about the plant's problem is combinatorially difficult, and saying so is worth as much as finding a case that is.

the tapered leaf: nodes against panels01020one a panel0 panels24every vertex of this family keeps 8 labellings

Nothing grown was cut out of anything

A leaf's corrugation costs twelve steps on twelve panels, sixteen on sixteen, twenty on twenty, twenty-four on twenty-four — exactly one per panel at every geometry, which is the most any pattern here costs. A tessellation patch costs half that, and the reason is that somebody cut it out of something. A leaf's creases stop at the margin because the plant stopped there.

0204060801001200510152025foldssurface heldpeak at 64 foldsbox of side 1 · sheet thickness 0.01 · most surface at 64 folds · 128 folds fills the box with sheet alone

Nothing grown has a seam

A gut is a tube and a leaf is a disc, and neither was made by joining anything. The sheets this collection builds by identifying a rectangle's edges are the same objects a body grows, reached by an operation no organism performs — and the difference shows up in where the boundary is and in what has to close.

spacing rulelayers across the folded footprintratio reacheduniform12 panels, longest 1.0012.00the only one at the topgeometric-1.112 panels, longest 2.857.5038% shortgeometric-1.312 panels, longest 17.924.1565% shortalternating-212 panels, longest 2.009.0025% shortone-long12 panels, longest 3.004.6761% short12 panels · ratio = Σℓ ⁄ max ℓ · uniform is the unique maximiser, and every other rule pays for its longest panel

The census returns one

The rung below this one asked for a census: every pattern reaching a stated packing ratio while opening from a single input, with its crease density. The census is makeable for the corrugations and it comes back with one member. A corrugation piles its panels over a footprint as wide as its longest panel, so its ratio is the total length divided by that longest one — and that equals the panel count only when every panel is the same.

050100150200250300350020406080100120foldspacking ratio deliveredρ 0.02 — 219 foldsρ 0.05 — 88 foldsρ 0.1 — 44 foldsρ 0.2 — 22 foldssheet of side 10 · D(k) = k(1 − k(π−2)ρ⁄S) · k* = S ⁄ 2(π−2)ρ, and the ceiling it reaches is k*⁄2

Four materials, four optima

The convergence argument gets its pattern and stops there. A hinge has a radius, the radius takes a fixed length of surface out of every fold, and the fold count that gets the most packing out of a sheet is inversely proportional to it — so a leaf, a wing, a gut lining and a metal array agreeing on a corrugation still disagree by an order of magnitude about how many creases to put in one.

0102030405060010203040fold half-angle from shut (degrees)packing ratioa hinge stops here — 6°corrugation, closes in one directioncapped at 10×Miura, closes in two at oncecapped at 92×a quoted 8× is 7.2° corrugation or 20.7° Miuraa quoted 15× is 3.8° corrugation or 15.0° Miuraa quoted 30× is 1.9° corrugation or 10.5° Miuraratio = 1 ⁄ sinθ for a corrugation and 1 ⁄ sin²θ for a Miura · θ is the half-angle from shut · a hinge that stops at 6° is the dashed line

The number is the angle

Every packing ratio worked out so far is computed at a fold closed all the way, and a folded wing is not closed all the way. At zero thickness the ratio runs away as the fold shuts, so the size of a quoted number says how far the fold got and not what the pattern is — and the pattern contributes only an exponent, which makes the same quoted ratio mean two quite different angles depending on which geometry produced it.

0204060801000510152025foldssurface heldno supply — 50 foldsδ = 0.01 — 25 foldsδ = 0.03 — 12 foldsδ = 0.09 — 5 foldsbox of side 1 · sheet thickness 0.01 · optimum at S ⁄ 2(t + δ), so supply and sheet are charged the same way

The surface has to be supplied

The curve that turns over does so because the sheet's own thickness fills the box it is folding into. A surface in a body has to be reached as well as fitted, and the channel that reaches it takes depth out of the same box on exactly the same terms — so the best fold count and the surface it delivers both fall by the ratio of the sheet's thickness to the sheet and its supply together.

0204060801000510152025foldssurface held1 surface — 50 folds2 surfaces — 25 folds3 surfaces — 17 folds4 surfaces — 12 foldsbox of side 1, thickness 0.01 · a ceiling goes as depth², so m sharers of one depth reach one m-th of it between them

Two surfaces in one box

A body folds several surfaces into one volume and each of them does a different job. Dividing the depth between them looks like a fair split costing nothing overall, and it is not: the area a single surface can reach goes as the square of the depth it has, so m surfaces sharing a depth reach a total of exactly one m-th of what one of them would have reached alone.

wavesamplitudefits inside2∫κ² = 170.03980.043∫κ² = 390.02660.045∫κ² = 1080.01590.04, 0.028∫κ² = 2760.01000.04, 0.02, 0.0112∫κ² = 6210.00660.04, 0.02, 0.0120∫κ² = 17240.00400.04, 0.02, 0.01depth 0.04 needs 2 waves or more · depth 0.02 needs 4 waves or more · depth 0.01 needs 8 waves or moreexcess 6.0% · amplitude × waves = 0.0797 throughout · floor = that constant ⁄ depth

The container picks the member

Two large waves and eight small ones are the same metric, and geometry has nothing to say about which. Bending has nothing to say either — it rises at every step of the family, so a least-bending rule always answers the fewest waves and never anything else. What decides is the container: amplitude times wave count is constant across the family, so a ceiling on the height is a floor on the number, exactly inversely.

growth profilelargest |K| it carries∫K dAgrown by the same factor everywhereflat — it can be laid in a plane0.0000.0e+0 — nothinggrown more at the rimnot flat at any radius1.400-3.258grown more at the centrenot flat at any radius7.8426.767the growth of a spherical capnot flat at any radius0.3911.118the growth of a hyperbolic discnot flat at any radius0.391-1.360grown so that the curvature cancelsnot flat at any radius1.4004.8e-5 — nothing∫K dA = −2πR (ln Ω)′(R) — the total is decided at the rim, so the interior cancels out of it

The test measures the rim

Flattening the specimen is the right test and the measurement anybody actually makes on a flattened specimen is a boundary one — how far the margin overruns its chord. Total curvature is a boundary quantity too: it equals minus two pi R times the growth profile's slope at the rim, and nothing else about the interior survives into it. So a sheet can be curved everywhere and integrate to nothing, and the test reports it flat.

-2.5-2-1.5-1-0.5050100150200250depth given to the inner level, log₁₀ of the boxsurface over the flat sheetone level, the whole boxreaches 250.0two levels, any splitnever above 62.5box depth 1 · sheet 0.001 · one level reaches 250.0, and a nest of two reaches 62.5 however the depth is shared

A nest pays four a level

A corrugation folded inside the panels of another looks like the arrangement that multiplies surface rather than dividing it. It multiplies the factors and divides the depths, and the depths cancel: a packed level can hold at most its depth over four times what it folds, the thing it folds is as thick as the depth the level below was given, and so a nest of L levels reaches at most the box over 4ᴸ sheet thicknesses. One level with the whole box beats any nest of two by exactly four.

02040608000.20.40.60.81half-angle from shut (degrees)share of the sheet's lengthspan, every fold countclearance, 4 foldsclearance, 8 foldsclearance, 16 foldssheet 10 · the span is S·sin θ at every fold count; the clearance is (S⁄k)·cos θ and falls as the count rises

The fold count sets the spring

A corrugation sweeps the same span at every fold count, and the count decides only how much room the zigzag needs while it does it — which was counted as a gain with nothing pushing back. Something does push back. Every hinge is a spring, a finer corrugation has proportionally more of them, and the force to hold a given span rises exactly as the clearance falls: the product of the two is the same number whatever the count, and at each material's own best count the spring goes as one over the square of the hinge radius.

the bar is how many of 200 random spring settings give two or more resting statessprings set at random fold angles, the same settings for every rowvertex 60·90·120·901982 with 1 · 198 with 2vertex 45·100·135·801964 with 1 · 196 with 2vertex 80·95·100·851964 with 1 · 126 with 2 · 62 with 3 · 8 with 4a corrugation0200 with 1a vertex's configurations are two branches through the flat state; a corrugation's are one line

A corrugation has one resting state

A folded wing held short of shut stores energy in its hinges, and a wing that could stay both open and folded with nothing holding it would need that energy to have two bottoms. A corrugation cannot provide them: every crease in it folds by one angle, so the energy of any set of crease springs is a parabola in that angle and has exactly one resting state, however much the springs disagree. A single degree-four vertex has two branches through the flat state, and the same springs give it two resting states on almost every setting tried.

the bases at which a crossover is possiblethe backbone turns 360° over a turn's worth of bases, and a crossover needs it facing the neighbourhoneycomb — three neighbours6 exact, 0 near071421283542square — four neighbours2 exact, 4 near4.3°4.3°4.3°4.3°07142128354210.5 bases to a turn · a mark is a base whose backbone faces a neighbour to within 5°, and the number under it is the miss

The helix chooses the lattice

A strand can cross to the next helix only where its backbone faces that helix, and a double helix turns about 34.3° a base. Three neighbours a third of a turn apart are faced exactly every seven bases. Four neighbours a quarter of a turn apart are never faced exactly by any whole number of bases — the nearest miss by 4.3°, and the misses do not average out, they add: 17° over thirty-two bases, 137° over two hundred and fifty-six. The lattice a design is drawn on is decided by the molecule before any shape is chosen.

which blocks a single strand can routecolumns are the block's width and rows its height, both counted in helicessquare lattice1234567891012345678honeycomb lattice12345678910a route through every helixthe count allows it, and no route existsa column the rows never reach

A row the route cannot leave

Every rectangular block of helices up to ten by eight routes on the square lattice. On the honeycomb, the lattice a double helix's pitch prefers, twenty of the eighty do not — and every block odd in both directions fails for a reason visible along one row: every second helix on the top row has no neighbour off it, the two corners have one neighbour each, and a route forced through them runs the length of the row and ends. The colour count passes all of them, and a degree count along a single row refuses them.

00.20.40.60.81-11234radius of the three marks, on the flat sheetmiss against flat (%)grown by the same factor everywhere · −0.00%grown more at the rim · +4.27%the growth of a spherical cap · −1.71%grown so that the curvature cancels · +3.52%a centre mark and three a third of a turn apart · on a flat sheet the three sit √3 times their radius apart

Three marks see nothing

The measurement a rim cannot make is an interior one, and the obvious interior measurement — two marks a known distance apart, measured again after growth — cannot detect curvature at all, because a uniformly enlarged sheet changes that distance and stays flat. Three marks cannot either: any three distances obeying the triangle inequality are the sides of a flat triangle. Four marks give six distances, and six distances are not free on a flat sheet. The growth profile a rim measurement reads as flat misses by three and a half per cent with four marks at the rim.

00.20.40.60.81-3-2-11radius of the cut, on the flat sheet∫K dA inside the cutR ⁄ √2grown by the same factor everywheregrown more at the rimthe growth of a spherical capgrown so that the curvature cancelsa cut at radius r reads the total curvature of the disc inside it, −2πr (ln Ω)′(r) — the rim measurement moved inward

A cut reads a slope

A rim measurement returns one number for a whole grown disc, and a family of growth patterns share it. Cut the disc in a circle and the piece inside has a rim of its own, and its reading is minus two pi r times the slope of the log of the growth at the cut — so a cut reads a slope, a set of cuts reads the slope at each radius, and the slopes add up to the growth profile itself. The one thing no cut can recover is how much the whole sheet was enlarged, which is the one kind of growth that curves nothing.

-40-20204060801000510152025degrees of the driven crease from the flat sheetenergy in the springsthe road from one resting state to the other · sectors 60° · 90° · 120° · 90°, springs set to mixedbranch one's stateenergy 12.40branch two's stateenergy 17.65the flat sheetenergy 26.16to leave the deeperclimb 13.76to leave the shallowerclimb 8.51left of the middle is branch one, right of it branch two; they meet only at the flat sheet

The wall is the flat sheet

A sprung degree-four vertex usually has two resting states, one on each branch of its motion, and the branches meet in one place a sheet can pass through: the flat state. So the only road from one resting state to the other crosses the flat sheet, and on every setting of the springs tried on two vertices the flat sheet is the highest point of that road. Its energy is each spring's stiffness times its rest angle squared, summed, which does not contain the vertex's sector angles at all — the same springs put on four different vertices give a wall of exactly the same height. The geometry decides only how far below the wall each state sits, and the shallower one sits a median of five per cent below it.

the bar is the size of the smallest shape the tests pass that no route reacheseach row adds one more cheap test to the ones above itsquares: the colour count, the ends and the cuts9 helices64 shapes of that size pass and have no routesquares: and the steps the ends force11 helices68 shapes of that size pass and have no routesquares: and the colour of every forced end11 helices32 shapes of that size pass and have no routehoneycomb: the colour count, the ends and the cuts12 helices18 shapes of that size pass and have no routehoneycomb: and the steps the ends force15 helices12 shapes of that size pass and have no routehoneycomb: and the colour of every forced end16 helices6 shapes of that size pass and have no routeevery shape of every smaller size is either refused by the tests or routed by the search

Every cheap test misses a shape

A strand routed through a bundle of helices has to visit each once, and whether a shape allows that is hard to decide — so the cheap tests that refuse shapes are necessary and never sufficient, and for every set of them there is a smallest shape they pass and no route reaches. Listing every connected shape and searching the ones the tests let through finds it: nine helices on the square lattice for the colour count, the ends and the cuts, eleven once the steps a route's ends force are added, and still eleven once the ends' colours are checked. On the honeycomb the same three stages give twelve, fifteen and sixteen. Each test pushes the smallest unroutable shape out or leaves it where it is; none removes it.

the bar is the median number of resting states, over the same kind of random springsa chain shares one crease between each vertex and the next1 vertex2 states2 branch combinations · 198 of 200 settings rest on every one · 197 of 198 cross at the flat sheet2 vertices4 states4 branch combinations · 193 of 200 settings rest on every one · 200 of 200 cross at the flat sheet3 vertices8 states8 branch combinations · 181 of 200 settings rest on every one · 199 of 200 cross at the flat sheet4 vertices16 states16 branch combinations · 134 of 200 settings rest on every one · 200 of 200 cross at the flat sheetevery combination of branches holds a resting state, and every switch between them goes over the whole flat sheet

A chain of vertices switches all at once

One sprung degree-four vertex rests in two states, one on each branch of its motion, and switches between them only by passing through the flat sheet. Chain vertices together by sharing a crease between each and the next, and a branch can be chosen at every vertex: two, four, eight and sixteen combinations for chains of one to four. The median spring setting rests once on every combination. And every combination's curve of configurations passes through the same single point — the whole chain flat at once — and meets no other anywhere else, so every switch, even of one vertex's branch, takes the whole chain back to flat. The wall that switch climbs is every spring's flat energy added up, growing by a crease's worth for every crease, and a chain's second state sits several times further below it than a single vertex's does.

00.20.40.60.81050100150span held, as a share of the sheetforce needed to hold it there4 folds8 folds16 foldsthe pale line under each: what it takes at flat, 4kc ⁄ Ssheet 10, hinge radius 0.05 · the corrugation springs open, and this is what has to stop it at each state

How far open is a question about the grip

A corrugation of hinges that rest flat is loaded when it is shut, so it opens by itself and the force in the held-state calculation is a restraint rather than a drive. Followed from shut to flat that restraint only ever falls, and by exactly π over two — so every partly open state a structure can occupy is squeezed into a band a third wide, and a grip that weakens by a third leaves the sheet nine tenths open.

-3-2-1123050100150turn in each hinge (radians, signed by branch)energy storedrests hereand hereflat: 179the barrier isthe flat state8 folds, hinge 0.05creased to 1.6the two branches are the same sheet folded opposite ways, and the flat sheet is the only state they share

Springs that disagree do not offer a choice

A corrugation of hinges that remember different angles was expected to have more than one position in which nothing pushes. It has exactly one, at the stiffness-weighted mean of what they remember, because a sum of parabolas in one variable is a parabola. The second resting place comes from somewhere else entirely — the mirror pattern — and the flat sheet is the barrier between them, which is also why a creased sheet cannot be pulled flat at all.

012340200400600800clearance above the basesurface, as a multiple of the basewalls: 2c ⁄ τplies: c ⁄ 4τeight times lesssheet thickness 0.01 · both lines are straight and their ratio is eight everywhere, so no clearance makes the stack competitive

Standing up beats lying down by eight

A level that fills its clearance with plies lying flat makes every ply share the clearance, and the sharing costs a factor of four. A level that fills the same clearance with walls standing on the base gives every member the whole height and charges them only for footing. The ratio is exactly eight, at every clearance and every thickness — and it is the difference between a cost charged against depth and a cost charged against the space beside it.

02468101214010203040506070clearance above the basesurface, as a multiple of the basewalls stop at 40.0sheet 0.01, channel 0.05plies keep risingthey cross at 9.40the comb saturates at twice the reciprocal of its channel's share, and the stack does not saturate at all

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.

the two things a domain has to be long enough forthe bar starts where the demand is first met and runs to the rightunique in the whole design11 bases and upstill paired at 45 degrees17 bases and upwhere a honeycomb crossover may sitfirst one inside both bands: 21 baseswhere a square-lattice crossover may sitfirst one inside both bands: 24 bases4812162024283236a domain runs between two crossovers, so its length is a whole multiple of the period

A domain too short to be unique

A staple holds the scaffold by pairing with a stretch of it, and two arguments decide how long that stretch has to be. One is combinatorics — a stretch of seven bases has about four hundred other places in a 7,249-base strand it would also match. The other is thermodynamics, and it is the one that binds: a duplex that is unique at eleven base pairs still comes apart at the temperature the design is held at, and staying paired takes seventeen. Rounded up to the crossover period, that is three periods on both lattices, and the lattice the helix prefers is the one whose three-period domain leaves some of its staples unattached.

the bar is the size of the smallest shape the tests pass that no route reacheseach row adds one more cheap test to the ones above itsquares: the colour count, the ends and the cuts9 helices64 shapes of that size pass and have no routesquares: and the steps the ends force11 helices68 shapes of that size pass and have no routesquares: and the colour of every forced end11 helices32 shapes of that size pass and have no routesquares: and the colour count on a stretch a cut has fenced off12 helices12 shapes of that size pass and have no routehoneycomb: the colour count, the ends and the cuts12 helices18 shapes of that size pass and have no routehoneycomb: and the steps the ends force15 helices12 shapes of that size pass and have no routehoneycomb: and the colour of every forced end16 helices6 shapes of that size pass and have no routehoneycomb: and the colour count on a stretch a cut has fenced off16 helices6 shapes of that size pass and have no routeevery shape of every smaller size is either refused by the tests or routed by the search

A test that only knows one lattice

The cheapest argument that refuses the smallest shape no cheap test could refuse was read off that shape: cut at one helix, find the piece with no end in it, and count the colours of the stretch the route is then forced to cross. Added to the census it refuses every one of the square lattice's thirty-two eleven-helix survivors and pushes the smallest survivor to twelve, where twelve placements of two shapes survive out of half a million. On the honeycomb it refuses none of the six at sixteen. A test inherits the lattice of the witness it was read off, and the staircase is two staircases.

a corrugation remembering 0.8 rad, held at 2.4 and later opened to 0.4torques as shares of the one total both ends of the story share; the barrier as a multiple of its creased valueheld for, τremembered turncontainer suppliesopening needsbarrier0.00.80080%20%1.00×0.51.43049%51%3.19×1.01.81129%71%5.13×2.02.18311%89%7.45×3.02.3204%96%8.41×5.02.3891%99%8.92×the container's share and the opening's share always sum to the whole, whatever the holding time

Holding a fold moves the force

A creased hinge held at an angle slowly comes to remember that angle, so a leaf or a wing packed in a bud for a season is gradually holding itself and the bud has less to do. The force is not used up in the process. The torque the container must supply falls as e^(−T⁄τ), the torque later needed to open the structure rises by exactly the same amount, and the two sum to the same total at every moment of the holding. Held for three relaxation times, a corrugation creased to 0.8 radians and packed to 2.4 needs 4 per cent of the total from its container and 96 per cent from whatever opens it — and the barrier to its mirror image has grown more than eightfold. A packing that lasts buys independence from its container with a harder unfolding.

four vertices round one panel, as a chain and as a loopa combination survives the loop only if going round it brings every fold angle back to where it startedthe faceopen chain of fourclosed loopthe same at every anglea Miura face164yesa face with no two vertices alike, seed 11161yesdriven at 0.3, 0.6, 1, 1.4, 1.8 radians · a combination counts when every crease is folded and the loop closes

A loop takes choices away

A chain of four sprung degree-four vertices has sixteen combinations of branches, each a resting state, and switches between them only through the flat sheet. Close the chain into a loop round one panel and the combinations must agree when the fold angles come back round. On a face whose four vertices all differ, one combination survives; on a Miura face, four. The count is the same at every angle the face is driven to, and two surviving assignments at the same driven angle are never closer than one and a half times that angle — so they separate as the face folds and meet only when it is flat. A loop does not create the junction a region would need to switch on its own. It removes choices and leaves the switch as global as before.

the reach, the member length and the member count, against the anglesurface counted as a multiple of the base, lengths as multiples of the clearance90°60°30°10°the angle the members stand atthe reach: 200flat, at every anglehow long each member ishow many of them there areclearance 1, sheet 0.01 · the reach is 200 at every angle; the two factors move by 57

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.

two linings of one tube, and the ceiling neither passessurface per unit length of tube, from a sheet 0.01 thickradiuslayersfins at bestthe ceilinglayers over fins0.516078.51572.040016353146282.020022526125725132.01004100785027100532.0050the ceiling is the tube's cross-section over the sheet thickness, twice over, and no arrangement of flat sheet passes it

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.

123456780.40.50.60.70.80.91how many lengths of finshare of the ceilingtips equally spacedheights halvingtwo thirdsradius 1, sheet thickness 0.01 · the share of the ceiling 2πR²/τ that fins of m lengths hold

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.

All essays