Series

Simple foldability — the series

12 essays on one idea, from the one that introduces it to the one that assumes the rest.
  1. creases at 0.40, 0.50 — assignment MVflat1 layerno sequence of all-layers folds finishes this pattern — the search exhausted 5 states

    The fold a machine can make

    A theorem that says a folded state exists says nothing about getting there. A machine that folds every layer at once is stopped by a strip with two creases in it — one that folds flat perfectly well, and that a pair of hands folds in about four seconds.

    part 1 · complexity
  2. evenly spaced — 4 creasesany flat folding16 of 16some-layers16 of 16all-layers16 of 16one-layer2 of 16crimping only6 of 16uneven — 4 creasesany flat folding8 of 16some-layers8 of 16all-layers0 of 16one-layer2 of 16crimping only0 of 16a machine that takes fewer layers is weaker, not more patientthe paper is joined, so what it declines to hold it also cannot move

    The patient machine is the weak one

    A machine that folds one layer at a time sounds like a machine with more freedom, not less. It has less, and the reason is the most ordinary fact about paper there is: it is joined, so whatever a machine declines to hold it also cannot move.

    part 2 · complexity
  3. 4 creases, assignment MVMVthe strip0.200.200.200.200.20MVMV3 availableafter crimp 10.200.200.20MV1 availableafter crimp 20.20nothing left2 crimps, each removing two creases4 creases is an even number, and that is not a coincidencethe merged segment measures outer minus middle plus outer

    A machine that can only crimp

    Change the atom and the whole picture changes. A machine whose single move folds two adjacent creases at once reaches strips no simple-fold machine reaches, is defeated by strips they handle easily, and cannot fold an odd number of creases at all — for reasons that are pure arithmetic.

    part 3 · complexity
  4. evenly spaced — 4 creasesany flat folding16 of 16some-layers16 of 16all-layers16 of 16one-layer2 of 16crimping only6 of 16one short segment — 4 creasesany flat folding4 of 16some-layers4 of 16all-layers0 of 16one-layer2 of 16crimping only4 of 16uneven — 4 creasesany flat folding8 of 16some-layers8 of 16all-layers0 of 16one-layer2 of 16crimping only0 of 16a machine that takes fewer layers is weaker, not more patientthe paper is joined, so what it declines to hold it also cannot move

    The machine that may choose

    Three restricted machines lose patterns that fold perfectly well. Give one of them a choice — any block of layers, top or bottom — and the loss vanishes: over a hundred and seventeen spacings, every flat folding of every strip became reachable. Being forced was the whole problem.

    part 4 · complexity
  5. the pale bar is every folded state; the dark one is the states the machine reachescounted over every marking of the strip that folds at all3 equal stamps12 of 12 reached4 equal stamps32 of 32 reached5 equal stamps100 of 100 reached6 equal stamps288 of 288 reachedcreases at .13 .31 .62 .780 of 24 reached — 24 missedcreases at .08 .24 .28 .35 .720 of 48 reached — 48 missed

    Where the machine catches up

    The weakest machine in the subject folds every layer at once and is stopped by a strip with two creases in it. On a strip of equal stamps it is stopped by almost nothing: every one of the 288 folded states a six-stamp strip has is reachable by a sequence of all-layers folds, and on every unevenly creased strip tried it reaches none of them. At seven stamps the completeness ends, and finding out where it ended is what checking it past six was for.

    part 5 · complexity
  6. the pale bar is every folded state the strip has; the dark one is what the machine reachesthree machines on the same strips, and none of them is the flat-folding theorem3 equal stamps · takes every layerall 123 equal stamps · takes one layer4 of 123 equal stamps · takes any block reaching an edgeall 124 equal stamps · takes every layerall 324 equal stamps · takes one layer4 of 324 equal stamps · takes any block reaching an edgeall 325 equal stamps · takes every layerall 1005 equal stamps · takes one layer4 of 1005 equal stamps · takes any block reaching an edgeall 1006 equal stamps · takes every layerall 2886 equal stamps · takes one layer4 of 2886 equal stamps · takes any block reaching an edgeall 288counted over every marking of the strip that folds flat at all

    Deciding is not making

    Four earlier essays here ask which machines can flatten a strip at all, and the answer sorts them into a lattice with one column full and three with holes in it. Asked instead what each machine can produce, the three sort completely differently: the machine that may choose its block reaches every folded state of every strip tried, the machine that takes one layer reaches exactly four whatever the strip is and however long, and the machine that takes the whole pile is the only one whose answer depends on the spacing at all.

    part 6 · complexity
  7. how deep into the pile the machine has to be allowed to reach before it reaches every stateone layer is the patient machine and the full depth is the machine that may choose3 equal stamps22 of a possible 3 · 12 states4 equal stamps33 of a possible 4 · 32 states5 equal stamps44 of a possible 5 · 100 states6 equal stamps55 of a possible 6 · 288 statescreases at .20 .55 .7022 of a possible 4 · 8 statescreases at .15 .40 .50 .8522 of a possible 5 · 16 statescreases at .13 .31 .62 .7844 of a possible 5 · 24 statescreases at .40 .50 .62 .7233 of a possible 5 · 12 statescreases at .08 .24 .28 .35 .7255 of a possible 6 · 48 statesthe even strips are the ones that need the most, and they are the ones the machine that takes everything does best on

    The easiest strip needs the deepest reach

    The patient machine and the machine that may choose are the two ends of one number: how many layers of the pile a machine is allowed to hold. At one it reaches four states whatever the strip; at the pile's full depth it reaches everything. In between it is a machine nobody has defined, and measuring where completeness arrives inverts these essays' own ordering — the evenly creased strip, which the machine that takes everything folds perfectly, needs the deepest reach of all, and one uneven strip is complete at two.

    part 7 · complexity
  8. the shortest sequence of folds to each state, for the machine that may choose its blockfewest, mean and most over every state of every marking; the last column compares the machine that takes everythingstripstatescreasesfewestmeanmostall layers4 equal stamps32322.753the same5 equal stamps100433.404the same6 equal stamps288534.045the samecreases at .20 .55 .708333.003reaches nonecreases at .15 .40 .50 .8516444.004reaches nonecreases at .13 .31 .62 .7824444.004reaches nonecreases at .40 .50 .62 .7212444.004reaches nonecreases at .08 .24 .28 .35 .7248555.005reaches nonea fold uses at least one crease, so no sequence is longer than the crease count

    A shallow machine pays in states, not folds

    A machine allowed to take only a few layers of the pile at a time reaches fewer folded states, and the natural fear is that it also reaches the ones it does by much longer sequences. Walked breadth first, so that every state's shortest sequence is found, it does not. On unevenly creased strips every state takes exactly one fold per crease at every depth, because no two creases ever lie on one line. On strips of equal stamps a shallower machine needs one fold more for a minority of states and two more for eight of the 924 states at seven stamps — and never more than the crease count, which no machine can exceed.

    part 8 · complexity
  9. the pile 0 6 1 2 3 4 5 and its turns, which the all-layers machine cannot foldMVMVMMVVMVMMMMVMVMVVVMVMVMMMVMVMVVVMVMVMMM

    Fourteen states are one pile

    A machine that folds every layer at once reaches every folded state of a strip of six equal stamps and misses fourteen piles at seven. The fourteen are not fourteen things. Taking a pile's bottom stamp and putting it on top maps foldings to foldings, so the 462 piles of seven stamps fall into 33 classes of exactly fourteen, and the missed piles are one whole class: the pile 0 6 1 2 3 4 5 — an accordion of five stamps with the last stamp wrapped round it and slid into the fold that holds the first — seen from each of its seven stamps. At eight stamps the machine misses 64 piles, and they are exactly the piles that leave that one when an end stamp is removed.

    part 9 · complexity
  10. equal stamps to nine: what the all-layers machine misses, and where the misses come frominherited: taking an end stamp off leaves a pile missed one size down; turning moves the bottom stamp to the topstampsfoldingsreachedmissedinheritednewclasses missedturning a pile41616000—keeps the machine's reach55050000—keeps the machine's reach6144144000—keeps the machine's reach7462448140141 whole, 0 in partkeeps the machine's reach813921328646404 whole, 0 in partkeeps the machine's reach94536405248432416024 whole, 8 in part52 reached turn missedto eight stamps every miss is a whole class and every miss past seven is inherited; at nine neither holds

    Nine stamps have piles of their own

    A machine that folds every layer at once reaches every folding of six equal stamps, misses one class of fourteen piles at seven, and at eight misses exactly the piles that shrink to that class when an end stamp is taken off. The prediction was that nine would do the same. Counted directly, nine equal stamps have 4,536 foldings and the machine reaches 4,052. Of the 484 it misses, 324 are inherited from eight and 160 are new — among them the nine-stamp tucked pile. And the symmetry that made the misses whole classes breaks: at nine stamps, turning a pile's bottom stamp to the top takes 52 piles the machine reaches to piles it cannot.

    part 10 · complexity
  11. the share of a strip's foldings the all-layers machine can makeevery pile counted; a share is the piles the machine finishes over the piles that exist00.2500.5000.75014681012stampsshare of the foldings reachedfoldings: ×3.20 a stamp from nine onreached: ×2.99 a stamp from nine on7 stamps: 448 of 4628 stamps: 1328 of 13929 stamps: 4052 of 453610 stamps: 12040 of 1406011 stamps: 36152 of 4631012 stamps: 106816 of 146376the reach grows by just under three a stamp and the foldings faster; while that holds, the share keeps falling

    The machine's misses have no short list

    A machine that folds every layer at once misses fourteen piles of seven equal stamps, sixty-four of eight and 484 of nine, and the question left at nine was whether its failures could be described by a short list of forbidden piles. Counted to twelve stamps, and to thirteen by the same method, they cannot. What the machine reaches is closed under taking an end stamp away, for a reason that fits in a sentence, so every miss contains a smallest one, and the smallest ones keep arriving: 14, 0, 160, 12, 1,194, 116 and 7,786 from seven stamps to thirteen, the tucked pile among them at every odd length. Meanwhile the machine's reach grows by just under three a stamp and the foldings by more, so the share it can make falls from all of them at six stamps to under two thirds at thirteen.

    part 11 · complexity
  12. a smallest miss of 9 stamps with both ends hooked, and the piles an end stamp leavesstamp 0 dashed in one colour, the last stamp in the other; a crease holding a hooked end is heavy1 8 0 7 6 5 4 3 2missed1 0 7 6 5 4 3 2stamp 8 off: reached0 7 6 5 4 3 2 1stamp 0 off: reached

    An odd strip can hook its own ends

    A machine that folds every layer at once has smallest misses by the thousand on strips of an odd number of equal stamps and by the hundred on even ones, and the alternation had no explanation. Most of it is one arrangement. On an odd strip each end stamp's free edge faces the crease at the other end, so an end can lie inside the far end's fold with its edge pointing in: a hook. Nine in ten of the odd strips' smallest misses carry one, an even strip cannot carry one at all, and the misses without a hook — 12, 12, 82, 116, 442 and 740 from nine stamps to fourteen — stop jumping by a factor of a hundred between neighbouring lengths.

    part 12 · complexity

All series