Concept

Patch — where it appears

A region of a crease pattern considered on its own, with its boundary treated as the sheet's edge. A patch can fold when the pattern containing it does not, which is why the boundary matters.

Named by 30 essays across 6 fields — each of them below, with the objects they name alongside it.

1 row0 interior verticespasses every condition2 rows4 interior verticesfails Kawasaki4 rows12 interior verticesfails Kawasakia pattern that folds is not a pattern whose enlargement folds — the conditions arrive with the interior

Where the paper stops

Every flat-folding theorem is a statement about a full turn of paper, so a vertex at the edge of the sheet is subject to none of them. Cutting a patch out of a pattern removes conditions rather than preserving them, and a small enough patch has almost none left.

flat-folding · Boundary
562 × 24 cells323 × 39 cells324 × 416 cells325 × 525 cellsrepeating rules that pass every condition, out of 51224 rules pass on the smallest patch and on none of the others

A unit that folds is not a tessellation

Of the 512 repeating rules for the waterbomb tessellation, 56 pass every condition on a two-by-two patch and 32 pass on every larger one. The twenty-four that die were never foldable — the small patch simply contained one of the four kinds of vertex the pattern makes, and the failures were at the other three.

tessellation · Waterbomb
shaded is every panel that lies on some loop49 panels · 1 tangle · biggest 3535 panels on some loop — 71.4% of the patch52 of 84 arcs run inside it, so one cut removes one of them

The loop is not the tangle

A search that finds a contradiction in a pattern's letters reports the first circle it meets, and on a tessellation patch that is eight to twelve panels of forty-nine. It reads as a local fault. Decompose the same arrows a second way and the set of panels that lie on some circle is thirty-five of forty-nine on the square patch and ninety-nine of a hundred and fifty-seven on the rhombille — which is why the smallest available repair does not reach it, and cannot be tried on most of the creases at all.

flat-folding · Forced order
the bar is the share of draws that agree with themselvesthe rows are ordered by panel count, which is the only thing changing along them49 panels26 of 200square · 84 creases · 26 of 20062 panels5 of 200elongated · 106 creases · 5 of 20077 panels2 of 200hexagonal · 142 creases · 2 of 20083 panels0 of 200triangular · 142 creases · 0 of 200157 panels0 of 200rhombille · 282 creases · 0 of 200a zero is a zero of the draws taken and not a proof that no consistent lettering exists

Letters that agree get rarer

Two hundred letterings drawn independently from a square twist tessellation patch, and twenty-six of them have letters that do not contradict themselves. On the next patch up it is five, then two, then none, then none. What the share falls with is not the size of the patch and not the angle of its twist: it is the number of independent closed chains its panels form, which is Euler's relation on the drawing and is fixed before a single letter is chosen.

tessellation · Twists
a lettering of the patch that agrees with itselffound by testing the arcs while the letters were chosen, not after561 nodes · 246 backtracks · verified against a rebuilt folded sheet157 panels · 282 creasesits own lettering sends its panels round in a circle0 of 200 random letterings agree with themselvesthis one was found in 561 nodes and 246 backtracksit differs from the drawn lettering on 155 of 282 creasesthe drawing is the pattern; nothing here is a picture of the folded object

The lettering nobody could draw

Two hundred letterings drawn at random from the rhombille tessellation patch, and not one of them agrees with itself. Two thousand, and still not one. The patch was left as an open question — and it has an answer, found in five hundred and sixty-one steps by a search that tests the arcs while it is choosing the letters instead of after it has chosen them all.

flat-folding · Forced order
the bar is the shortest crease in the pattern, on a scale of powers of tenthe hexagonal patch at four turns of its polygons, everything else heldturn 0.21.4e-2130 creases · every one carries an arc · 2.25 mm on a 160 mm sheetturn 0.357.9e-6142 creases · 12 of them carry no arc · 1.3 µm on a 160 mm sheetturn 0.57.5e-3154 creases · every one carries an arc · 1.20 mm on a 160 mm sheetturn 0.72.8e-2154 creases · every one carries an arc · 4.53 mm on a 160 mm sheetone turn of one patch drops four orders of magnitude below the others, and it is the turn this collection prints

Twelve creases a micrometre long

A patch this collection has drawn for a long time carries a hundred and forty-two creases and a hundred and thirty arcs, and nobody had asked what the other twelve were. They are fragments left where the clip caught a pleat almost exactly at a corner — between one and nine micrometres long on a printed sheet, at one turn angle out of four, and it is the turn the collection prints.

flat-folding · Boundary
the bar is the middle run of a hundred and twentysame pattern, same code — only the order the letters are tried in differsthe square patch2725 at best · 27 at the middle · 36 at worstthe elongated patch3432 at best · 34 at the middle · 39 at worstthe hexagonal patch4339 at best · 43 at the middle · 51 at worstthe triangular patch4539 at best · 45 at the middle · 53 at worstthe rhombille patch16684 at best · 166 at the middle · 48 of 120 unfinished at 20000an unfinished run is left out of the middle rather than counted as its budget

Four easy patches and one that is not

Run the same search a hundred and twenty times on each of five tessellation patches, changing nothing but the order the letters are tried in. Four of them answer in between twenty-five and fifty-three steps every single time. The fifth answers in eighty-four steps at best, a hundred and sixty-six in the middle, and does not answer at all in forty-eight runs of the hundred and twenty.

tessellation · Twists
the bar is the second-smallest sector at a typical vertexthe triangular patch at seven turns, with the same panels and the same creases at all of themturn 0.261.92°smallest sector 60.00° · next 61.92° · no lettering exists, proved by exhaustionturn 0.2160.71°smallest sector 60.00° · next 60.71° · no lettering exists, proved by exhaustionturn 0.215560.06°smallest sector 60.00° · next 60.06° · no lettering exists, proved by exhaustionturn 0.21660.00°smallest sector 60.00° · next 60.00° · a lettering existsturn 0.2260.00°smallest sector 59.52° · next 60.00° · a lettering existsturn 0.2560.00°smallest sector 56.10° · next 60.00° · a lettering existsturn 0.3560.00°smallest sector 46.15° · next 60.00° · a lettering existsthe verdict changes exactly where that sector passes sixty degrees and stops being the second smallest

Where a sector crosses sixty

Turn the twist polygons of a tessellation patch a hundredth of a radian further and the pattern goes from having no mountain-valley labelling at all to having one immediately. Nothing about its graph changes across the transition — the same eighty-three panels, the same hundred and forty-two creases, the same four labellings at every one of its sixty vertices. What changes is which sector at a vertex is the smallest one.

flat-folding · Genericity
the dot is one run's cost, ranked; the rule is the constant order1001e+31e+4nodes visited40 seeds, ranked by cost80 nodes, every seed15 unfinished at 20,000same pattern, same conditions, same test at every node — the only difference is which letter is tried first

The difficulty was in the coin

One tessellation patch, one search, one test at every node — and a cost that runs from eighty-six steps to fifteen thousand depending on nothing but the starting seed. The heavy tail is real, it was measured carefully, and it was made by a single line of the search that nobody had thought of as a choice at all.

flat-folding · Forced order
the Miura, 2×2 cellsone drawing, four sheetscutoutgluedacrossgluedalonggluedboth waysvertices8888free letters22182016panels1510128V − E + F1000the vertex row is the control: identifying edges can neither make nor destroy a vertexand Euler's number is the cheapest check that the gluing did what it says

Half a rim

A rectangle of tessellation cut out of the plane has four edges; glued into a torus it has none. Gluing one pair and leaving the other gives the middle of the scale — the same drawing, the same vertices, the same conditions asked of them, and exactly half the rim. What the rim costs turns out to be measurable per edge rather than only at the ends.

flat-folding · Boundary
letters saved by gluing, and the two halves of itthe grid ×121 across + 1 along = 2 · 4 letters cut, 2 gluedthe grid ×242 across + 2 along = 4 · 12 letters cut, 8 gluedthe Miura ×132 across + 1 along = 3 · 7 letters cut, 4 gluedthe Miura ×264 across + 2 along = 6 · 22 letters cut, 16 gluedthe Yoshimura ×164 across + 2 along = 6 · 12 letters cut, 6 gluedthe Yoshimura ×2128 across + 4 along = 12 · 36 letters cut, 24 gluedone comparison says the rim costs something; four say the price is per edge

The rim adds up

What one glued pair of a cell's edges saves in free letters is what the other pair saves, and gluing both saves the sum. That is a rate rather than an observation, it is the form of the claim two objects could never support, and it is what makes 'the rim costs four letters a cell' a statement about tessellations rather than about one drawing.

flat-folding · Boundary
the Yoshimura, 2×2 cellsone drawing, four sheetscutoutgluedacrossgluedalonggluedboth waysvertices8888free letters36283224panels29202416V − E + F1000the vertex row is the control: identifying edges can neither make nor destroy a vertexand Euler's number is the cheapest check that the gluing did what it says

Euler counts the gluing

Vertices minus creases plus panels comes to one on a rectangle of paper and nought on any gluing of it. That is the cheapest check that an identification did what it says, it costs three counts already being made, and it is what found a crease running exactly through the corner of a cell — a case the corner search could not see and no other check would have noticed.

flat-folding · Boundary
what each sheet costs, per panel — a square twistcut out ×10.5565 nodes on 9 panels · 12 lettersglued across ×10.6674 nodes on 6 panels · 10 lettersglued along ×10.6674 nodes on 6 panels · 10 lettersglued both ways ×10.7503 nodes on 4 panels · 8 letterscut out ×20.52013 nodes on 25 panels · 40 lettersglued across ×20.55011 nodes on 20 panels · 36 lettersglued along ×20.55011 nodes on 20 panels · 36 lettersglued both ways ×20.5639 nodes on 16 panels · 32 letterscut out ×30.61230 nodes on 49 panels · 84 lettersglued across ×32.02485 nodes on 42 panels · 78 lettersglued along ×30.57124 nodes on 42 panels · 78 lettersglued both ways ×317.361625 nodes on 36 panels · 72 lettersthe letters go down as the rim goes and the cost per panel goes up

Half the slack

Gluing one pair of a cell's edges removes half the free letters and costs almost nothing. Gluing the second pair removes the other half and costs three orders of magnitude. The letters go linearly and the search does not, and the reason is that the last free letter is worth more than all the others.

complexity · Search order
the Yoshimura, 2×2 cellsone drawing, four sheetscutoutgluedacrossgluedalonggluedboth waysvertices8888free letters36283224panels29202416V − E + F1000the vertex row is the control: identifying edges can neither make nor destroy a vertexand Euler's number is the cheapest check that the gluing did what it says

Which pair is glued

A cell's two cylinders have the same Euler number, the same amount of rim and the same name. On a symmetric drawing they have identical counts of letters, panels and vertices — and searching them costs twenty-four nodes one way and eighty-five the other. Half the rim is a description of the topology and not of the object.

complexity · Search order
what each sheet's shape costs in conditionsa square0 loopsχ = 1 · no loop that cannot be shrunka slit from the rim0 loopsχ = 1 · the same paper, topologicallyone hole1 loopχ = 0 · one parity conditiona cylinder1 loopχ = 0 · the same sheet as one holetwo holes2 loopsχ = -1 · two independent conditionsa torus2 loopsχ = 0 · two conditions, no rim at alla slit inward from the rim changes nothing, and a closed cut changes everything

A cut is surgery

Two cuts that look identical on the paper do completely different things to the sheet. A slit run inward from the rim changes nothing at all; a closed cut in the middle removes a disc and leaves a sheet carrying a condition it did not have before. What separates them is not the length of the cut or how much paper it removes.

material · Kirigami
two holes, two conditionsone loop is odd — the sheet refuses2 out to the left, 1 to the right, 1 betweenround the left hole: 3 creases, oddround the right hole: 2, evenround both: 3, oddno two-colouring exists0 interior verticesa loop round one hole says nothing about a loop round the other

Two holes are two conditions

One hole in a sheet of paper gives one loop that cannot be shrunk and one parity to satisfy. Two holes give two, and they are independent: an arrangement of creases can satisfy the condition round one hole and fail the condition round the other, and the sheet refuses on the strength of the one it failed.

material · Kirigami
the same 2×2 glued cell, searched under two rulesa cycle is a contradictiona cycle whose steps add to zero isand what the loops dothe square gridnothing, in 359 nodesevery loop travels (2 directions)the triangular gridnothing, in 12,143455 nodesevery loop travels (2 directions)the honeycombnothing, in 9,6191,043 nodesevery loop travels (3 directions)the elongated triangular tilingnothing, in 9,123162 nodesevery loop travels (5 directions)the rhombille tilingunfinished at 200,000unfinished at 200,000“nothing, in n” is an exhausted search: a proof that the pattern has no consistent lettering, which is false

The cost of asking the wrong sheet

A test written for a sheet with an edge, run on a sheet without one, does not fail. It exhausts — proving, at three, thirty-five and three thousand four hundred and fifty-five nodes, that no lettering exists — and the letterings it proved impossible fold, on the collection's own machinery, at every size they were tried at.

complexity · Hardness of folding
the grid, 2×2 cellsone drawing, four sheetscutoutgluedacrossgluedalonggluedboth waysvertices4444free letters1210108panels9664V − E + F1000the vertex row is the control: identifying edges can neither make nor destroy a vertexand Euler's number is the cheapest check that the gluing did what it says

One population, four sheets

A population of patterns is a way of asking what is typical, and it has always been a population of drawings. Put the same drawings on four different sheets and the verdicts move — not because the drawings changed but because the sheet did, which means a population has two halves and only one of them was ever chosen.

complexity · Typical instances
the case the corner search cannot seeedges clear of every vertex, and a crease through a corner anywaythe corner is where four edges meeta crease piece ending there has no partneron any one of themand Euler's count comes out −1the cure is a nudge along a gap the vertex search had already cleared

The seam that is not a symmetry

Gluing a cell's edges looks like a symmetry of the drawing and is not. It is an instruction about which points of the paper are the same point, the drawing has to agree with it along the whole of a glued edge, and a rectangle that is not a period of the pattern does not glue at all — which turns out to be the only real restriction on which cylinders exist.

tessellation · Twists
the period cell of the Miuraone period, with its neighbours round it2 interior vertices in the cell7 crease pieces drawnperiod 1.000 × 2.000one column wide and two rows high, because the zigzag returns after twothe cell is a rectangle of ordinary paper until somebody says its edges are one edge

A metamaterial with no edge

A folded metamaterial's properties are quoted per unit cell, because a material is supposed to be the same everywhere and a cell is supposed to stand for the whole of it. Every cell this collection has measured has been cut out of a patch, with a rim round it — and a rim is the one place a repeating material is not like itself.

tessellation · Mechanical metamaterials
panels with nothing below them, and where they aresquare ×1125 panels, 16 of them touching the edge · all 1 at the edgesquare ×2281 panels, 32 of them touching the edge · all 2 at the edgesquare ×33169 panels, 48 of them touching the edge · all 3 at the edgetriangular ×1369 panels, 39 of them touching the edge · all 3 at the edgetriangular ×25233 panels, 79 of them touching the edge · all 5 at the edgehexagonal ×1469 panels, 39 of them touching the edge · all 4 at the edgehexagonal ×27233 panels, 79 of them touching the edge · all 7 at the edgehexagonal ×310493 panels, 119 of them touching the edge · all 10 at the edgeelongated ×12105 panels, 48 of them touching the edge · all 2 at the edgeelongated ×23369 panels, 96 of them touching the edge · all 3 at the edgethe sheet these letters belong to has no such panel at all

A bottom layer on half a rim

The bottom of a folded stack lives at the paper's edge, which is why a sheet with no edge has an order with no least element. A cylinder has half a rim, so it has a bottom — and the count of panels that could be it falls with the rim, which makes the claim a measurement rather than a boundary case.

flat-folding · Forced order
one rectangle, glued four waysa disc, two cylinders and a torus — from one drawing4 edges lefta disc2 edges lefta cylinder, across2 edges lefta cylinder, alongno edges lefta torusthe same rectangle and the same creases in all four, and nothing in the drawing says which is whichmatching arrowheads mean the two edges are one edge of the paper

The drawing does not say what is glued

One crease pattern, four sheets, four different answers to whether it folds — and nothing in the drawing distinguishes them. The identification is data the picture cannot carry, and the picture is the object this collection has been treating as complete.

flat-folding · As drawn
one rectangle, glued four waysa disc, two cylinders and a torus — from one drawing4 edges lefta disc2 edges lefta cylinder, across2 edges lefta cylinder, alongno edges lefta torusthe same rectangle and the same creases in all four, and nothing in the drawing says which is whichmatching arrowheads mean the two edges are one edge of the paper

A sheet with two edges

Design in this subject starts from a square, and the square's four edges are where every flap ends and every construction begins. A cylinder has two edges instead of four, and what a designer loses turns out to be measurable in the same letters a search counts — and what they gain is that the sheet is what gets manufactured.

design · Sheet shape
the impossible lettering, on ordinary patchessquare ×140 creases16 vertices · every condition holds · no forced loopsquare ×2144 creases64 vertices · every condition holds · no forced loopsquare ×3312 creases144 vertices · every condition holds · no forced looptriangular ×1116 creases48 vertices · every condition holds · no forced looptriangular ×2424 creases192 vertices · every condition holds · no forced loophexagonal ×1116 creases48 vertices · every condition holds · no forced loophexagonal ×2424 creases192 vertices · every condition holds · no forced loophexagonal ×3924 creases432 vertices · every condition holds · no forced loopthe bar is the crease count; the note is what the ordinary checks said

The symmetry a gluing adds

A patch of a tessellation has whatever symmetry its outline allows — a few reflections, a rotation or two. Glue its edges and it acquires translations, and a lettering of the glued sheet has to be invariant under them. That is a much stronger requirement than a lettering of the patch, and it is why one answer covers every patch at once.

design · Symmetry
what each sheet's shape costs in conditionsa square0 loopsχ = 1 · no loop that cannot be shrunka slit from the rim0 loopsχ = 1 · the same paper, topologicallyone hole1 loopχ = 0 · one parity conditiona cylinder1 loopχ = 0 · the same sheet as one holetwo holes2 loopsχ = -1 · two independent conditionsa torus2 loopsχ = 0 · two conditions, no rim at alla slit inward from the rim changes nothing, and a closed cut changes everything

The cut that changes nothing

A slit goes right through the material and leaves the sheet exactly the object it was. A closed cut removes almost no paper and produces a different sheet with a condition it did not have. Kirigami is made almost entirely of the first kind, which is why every result about it survives the distinction untouched.

material · Kirigami
the cost of one lettering, by size and by how the cell is gluednodes of search, under one fixed branch orderperiodsfree lettersa discone cylinderthe othera torustorus over discthe square grid1×11254430.62×240131212131.03×384262428532.04×4144456244116926.05×52207066209292741.8the honeycomb1×1341291080.72×2116403439952.43×324676285386418655.1the triangular grid1×13412101080.72×2116373134166845.13×324691570524!12000131.9the rhombille tiling1×160226218160.72×2216!12000!120001009!120001.0a plus sign is a search that ran out of budget rather than out of possibilities; the free letters are the cut sheet's

Each drawing has its own threshold

Gluing a cell's edges was measured once, at one size, and found to cost three orders of magnitude — which cannot tell a threshold from a slope, nor say whether a cut sheet has one further out. Swept from one period to five on four tilings, every sheet starts at about a third of a node per free letter and every drawing leaves that behaviour at a size of its own: four periods on the square grid, three on the honeycomb, two on the triangular grid and two on the rhombille, where even the cut sheet crosses.

complexity · Search order
what ten branch orders cost on the same four sheetsnodes of search; the sheets are the same drawings as the sweep abovethe square grid, 4×4, glued69 to 24636, 1 gave upthe square grid, 4×4, cut42 to 55the square grid, 3×3, glued20 to 731the square grid, 3×3, cut25 to 32each bar runs from the cheapest of 8 branch orders to the dearest, on a logarithmic scale; a dot is the middle one

The route, not the sheet

Every cost measured for a glued sheet has been one number from one branch order, and a backtracking search's cost belongs to the pair. Asked under eight orders instead of one, a cut cell's cost barely moves — 42 to 55 nodes — while the torus over the same drawing runs from 69 to 24,636, with one order giving up entirely. The glued sheet's best order costs less than twice the cut sheet's, so most of what a single order charged to the gluing belongs to the route through it.

complexity · Search order
the other fault a drawing can have, counted and measureda stub is a crease with a free end; the distance is how far from the rim it stoppedpatcheswith a crossingwith a stubstubsdistinct depthsshallowestdeepest120761566270.27 mm35.1 mm0.27 mm35.09 mm66 stubs27 depthsdistances at the 150 mm these patterns print at; the scale is logarithmic because the range is a factor of 128

A stub is never alone

A crossing is a crease running past another and it has a depth. A stub is a crease that simply stops, and it has one too — how far from the rim it stopped, which is also how much shorter than a crease it is. Measured across a hundred and twenty drawings: sixty-six stubs, from 0.27 mm to 35 mm at printed size, every one of them paired with another at exactly the same distance, and not one on a drawing that did not already have a crossing.

rigid · Tolerance
drawings carrying each fault, of those drawna junction is split in two: the fault, and the rim ending the reading also calls a junctionextended, of 120clipped, of 120a crossing760two creases pass through each othera stub150a crease stops in the middle of the papera crease ending on a crease00the junction as a faulta crease ending on the rim120120the junction as the reading counts ita fragment25a crease too short to seeevery stub is on a drawing with a crossing; every clipped fragment is on a drawing with nothing else wrong

Two faults, not four

A drawing departs from its crease list in four named ways — a crossing, a stub, a junction and a fragment — and a checker tests for all four. Counted side by side on two hundred and forty drawings, two of the tests find nothing the others do not. No crease anywhere ends on another crease: every junction the reading finds is a crease meeting the rim, which is where creases are meant to end. Every stub is on a drawing that already has a crossing. What is left is two independent faults, and the clipped construction, which makes no crossings, still makes the second — creases a thousandth of a millimetre long, in pairs.

rigid · Tolerance
nodes per free letter, cheapest route against the middle onecheapest of eightmiddle of eight× where no route of that kind finished · periods along the bottom0.3110100×2345the square grid, glued×123the triangular grid, glued××1234the honeycomb, glued0.3110100×123the elongated triangular tiling, glued××12the rhombille tiling, glued×123the rhombille tiling, cut

The cheapest route crosses later

A search for a consistent lettering has a threshold: below it the letters propagate and the cost is a third of a node per crease, above it the search backtracks and the cost explodes. The threshold was measured with one branch order. Measured with eight, the cheapest route never starts searching before the typical one, and on most sheets it starts a period or two later — so part of every threshold on the record belongs to the route. And the one cut sheet past its threshold, the rhombille's, spreads across nearly three orders of magnitude of cost, which moves the spread off the gluing and onto the threshold.

complexity · Search order

Named alongside it

The objects these essays reach for when they reach for this one.

BoundaryGluingPeriodicityPanelSearch costSearchTessellationMeasurementCountingCrease assignmentCrease patternFlat-foldability

All concepts