Concept

Periodicity — where it appears

The repetition of a pattern across a sheet. It buys manufacture and averaging and costs determinacy, because a sheet of identical parts has symmetries that leave its folded state ambiguous.

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

at every vertexthree of one, one of the other15 interior vertices, all identicalwhat the sheet gainsone degree of freedom, not manyit opens and closes in both directions at oncea negative Poisson's ratio22 mountain and 16 valley creases · 6.2 sheet-widths of foldingmountainvalleyraw edge

One vertex, repeated

Take a single flat-foldable vertex and tile the plane with it. The sheet stops being a sheet and becomes a material — with a stiffness, a packing behaviour and a Poisson's ratio that the paper never had.

tessellation · Miura
4 corners, all alikesectors 90°, 90°, 90°, 90°two equal pairs, so no sectoris strictly the smallestthe assignment256 of 4096 fold6 mountain, 6 valleythe ring takes two lettersthe panels can be orderedwhat is checked4 interior verticesand not the tilinga twist of radius 0.17 sheet-widths12 creases, 4.70 sheet-widths of foldingmountainvalleyraw edge

A square that turns

A twist is a small polygon that rotates as the sheet closes around it. The geometry is forced rather than designed — Kawasaki fixes one sector, the big-little-big lemma forbids a strictly smallest one, and what is left is the pattern Ron Resch was drawing in the 1960s.

tessellation · Twists
polygonsectors at the twist vertexKawasakitiles the plane3-gon60.0 · 60.0 · 120.0 · 120.0180.0° = 180.0°yes — 6 round a point4-gon90.0 · 90.0 · 90.0 · 90.0180.0° = 180.0°yes — 4 round a point5-gon108.0 · 108.0 · 72.0 · 72.0180.0° = 180.0°no6-gon120.0 · 120.0 · 60.0 · 60.0180.0° = 180.0°yes — 3 round a point7-gon128.6 · 128.6 · 51.4 · 51.4180.0° = 180.0°noevery one of these twists satisfies the local theorems and folds flat on its ownthe interior angle has to divide 360° for the twists to meet, which only 3, 4 and 6 dobeyond 7 sides the assignment search runs out — 21 free creases, and the enumerator refuses above 22

Which polygons twist

Twist tessellations come in three kinds — triangle, square, hexagon — and it is natural to read that as a fact about twists. It is not. A twist can be built around any regular polygon and every one of them folds; what stops at three is the tiling, and the tiling is a fact about the plane.

tessellation · Twists
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
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
every curve is one construction grown, and the axis is the same for all threethe Miura, grownthe Yoshimura, growntwist patches00.2500.5000.7501255075100125independent closed chains of panelsshare of letterings that agree with themselvesthe horizontal axis is read off the drawing before any letter is chosen, and it is the number of interior vertices

A corrugation agrees with itself

A Miura fold of forty-eight panels and a twist tessellation patch of forty-nine have almost exactly the same number of independent closed chains for their letters to contradict themselves round — thirty-five against thirty-six. Sixty-four per cent of the Miura's drawn letterings are consistent and thirteen per cent of the patch's. A Yoshimura at thirty-three chains manages ninety-three. The room to fail sets the scale; the construction decides where in it a pattern lands.

tessellation · Miura
the 16 repeating rules that fold, written outrows first, then the two column classes — and every one of them alternates down the columnrows · columns above|below20VV · MV|MV21MV · MV|MV22VM · MV|MV23MM · MV|MV24VV · VM|MV25MV · VM|MV26VM · VM|MV27MM · VM|MV36VV · MV|VM37MV · MV|VM38VM · MV|VM39MM · MV|VM40VV · VM|VM41MV · VM|VM42VM · VM|VM43MM · VM|VMfour ways of writing the rows times four ways of alternating the columns is sixteen, and there is nothing else

Sixty-four rules, sixteen fold

The Miura fold's letters are usually given as a recipe: rows one way, columns changing at every row. Write down every rule of that shape — the letter on a crease depending only on which row and which column it is in — and there are sixty-four. Sixteen fold flat. They are exactly the ones whose columns change at every row, the row letters do not matter at all, and every one of the forty-eight refusals is the counting theorem's alone.

tessellation · Miura
the same drawing, cut out of the plane and glued upnodes, log scale, against periods across the sheet10100100010⁴10⁵1×12×23×34×4glued upcut outan open mark is a search that ran out of budget rather than a cost

What the rim was doing

One rectangle of a twist tessellation, cut out of the plane in the ordinary way, gives up a consistent lettering in forty-eight steps. Join its opposite edges so that no crease is divided and the same drawing, at the same vertices, under the same conditions, takes fifty-six thousand seven hundred and seventy-two. The edge of the paper was never the difficulty. It was the slack.

complexity · Search order
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

A loop that goes somewhere

Every crease says which of its two panels lies above the other, and a loop in those statements is a proof that the pattern has no flat folded state. On a sheet with no edge that sentence is false. The loops of a periodic pattern carry a lattice step each, and a loop that ends one cell to the right is not a contradiction — it is a stack of paper with no bottom layer.

flat-folding · Layer multiplicity
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 loopelongated ×1184 creases80 vertices · every condition holds · no forced loopelongated ×2688 creases320 vertices · every condition holds · no forced loopthe bar is the crease count; the note is what the ordinary checks said

The lettering that was proved impossible

A search closed its whole tree on a glued square tessellation and reported that no mountain-and-valley assignment of it is consistent. Written onto ordinary patches of one, four and nine periods and handed to the four vertex theorems and a folded sheet rebuilt from scratch, the assignment it says cannot exist passes every check, on four tilings, up to fifteen hundred creases.

flat-folding · Flat-foldability
one period of the square grid's twist tessellationa ring is where a crease leaves and returns on the far side40 crease pieces → 32 creases25 drawn panels → 16 panels16 vertices, every one interiorV − E + F = 0mountainvalleyraw edge

A sheet with no edge

A twist tessellation repeats, so a rectangle of it is a description of the whole plane rather than a piece of paper. Joining the rectangle's opposite sides makes that explicit and produces an object every gate in this collection can read: twenty-five drawn panels become sixteen, forty crease pieces become thirty-two, sixteen vertices are all interior, and the three counts add to nothing.

flat-folding · Boundary
what a cut adds, in letterssquare ×148 creases become 12 · 4 vertices either waysquare ×2832 creases become 40 · 16 vertices either waysquare ×31272 creases become 84 · 36 vertices either waytriangular ×11024 creases become 34 · 12 vertices either waytriangular ×22096 creases become 116 · 48 vertices either waytriangular ×330216 creases become 246 · 108 vertices either wayhexagonal ×11024 creases become 34 · 12 vertices either wayhexagonal ×22096 creases become 116 · 48 vertices either wayhexagonal ×330216 creases become 246 · 108 vertices either wayelongated ×11240 creases become 52 · 20 vertices either wayelongated ×224160 creases become 184 · 80 vertices either wayelongated ×336360 creases become 396 · 180 vertices either wayrhombille ×11248 creases become 60 · 24 vertices either wayrhombille ×224192 creases become 216 · 96 vertices either wayrhombille ×336432 creases become 468 · 216 vertices either waythe bar is how many creases the cut divides; nothing else about the two sheets differs

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.

flat-folding · Boundary
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

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.

flat-folding · Forced order
proving the glued square cell has no lettering1×1, 4 panels3proved there is none · the other test found one in 32×2, 16 panels35proved there is none · the other test found one in 93×3, 36 panels3,455proved there is none · the other test found one in 6254×4, 64 panels200,000still running at the budgeta bar at the budget is a search still running, not a proof

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.

complexity · Search order
proving the glued square cell has no lettering1×1, 4 panels3proved there is none · the other test found one in 32×2, 16 panels35proved there is none · the other test found one in 93×3, 36 panels3,455proved there is none · the other test found one in 6254×4, 64 panels200,000still running at the budgeta bar at the budget is a search still running, not a proof

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.

complexity · Hardness of folding
sliding the cut across one period of the square tessellation36 vertices at every position, and a different set of creases divided at each0102030cut at the start of a periodone period alongnodes; the axis starts at zero, and the whole spread is inside a factor of 1.32

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.

complexity · Typical instances
one similarity, five tilingslong: a cell of the flat sheet · short: where it lands foldedthe square grid ×0.41037344the triangular grid ×0.41037344the honeycomb ×0.41037344the elongated triangular tiling ×0.41037344the rhombille tiling ×0.41037344turned 36.62°, the same on every onethe scale is a property of the pleat, and the tiling does not enter it

Folding it flat is one similarity

Where a cell of paper goes when a twist tessellation collapses is a scale and a turn: multiply the plane's lattice by 0.410373441 and rotate it by 36.62°. That is the answer on the square grid, the triangular grid, the honeycomb, the elongated triangular tiling and the rhombille alike, agreeing to eight figures — while the collection's other answer to how much smaller it gets gives those five tilings five different numbers.

tessellation · Shrinkage
clipped tessellation patches, nodes per panel0.000.250.500.751.00one node a panelthe square gridthe triangular gridthe honeycombthe elongated triangular tiling0 panels413 panelsthe family the collection called hard is the one below the line

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.

design · Sheet shape
how much a cut adds to a crease count, and to a crease lengthsquare ×150.0% too many12 creases counted for 8 · length 12.675 a unit either waysquare ×225.0% too many40 creases counted for 32 · length 12.675 a unit either waysquare ×316.7% too many84 creases counted for 72 · length 12.675 a unit either waytriangular ×141.7% too many34 creases counted for 24 · length 16.938 a unit either waytriangular ×220.8% too many116 creases counted for 96 · length 16.938 a unit either waytriangular ×313.9% too many246 creases counted for 216 · length 16.938 a unit either wayhexagonal ×141.7% too many34 creases counted for 24 · length 17.691 a unit either wayhexagonal ×220.8% too many116 creases counted for 96 · length 17.691 a unit either wayhexagonal ×313.9% too many246 creases counted for 216 · length 17.691 a unit either wayelongated ×130.0% too many52 creases counted for 40 · length 14.654 a unit either wayelongated ×215.0% too many184 creases counted for 160 · length 14.654 a unit either wayelongated ×310.0% too many396 creases counted for 360 · length 14.654 a unit either wayrhombille ×125.0% too many60 creases counted for 48 · length 23.514 a unit either wayrhombille ×212.5% too many216 creases counted for 192 · length 23.514 a unit either wayrhombille ×38.3% too many468 creases counted for 432 · length 23.514 a unit either waythe length is exact because the two halves of a divided crease add back up

A count is not a length

Cut a rectangle out of a tessellation and it reports fifty per cent more creases than the pattern has, then twenty-five, then seventeen — converging on the truth from above and never reaching it. The crease length per unit area it reports is exact at every size, because the two halves of a divided crease add back up. One measurement survives the cut and the other does not.

material · Crease density
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

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.

rigid · Self-contact
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

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.

history · Rediscovery
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
the period cell of the gridone period, with its neighbours round it1 interior vertices in the cell4 crease pieces drawnperiod 1.000 × 1.000one square, because a grid repeats at every linethe cell is a rectangle of ordinary paper until somebody says its edges are one edge

A grid that will not close

Take the simplest crease pattern there is — a square grid — and join a cell of it into a torus. With an even number of squares across it folds. With an odd number it has no flat folded state at all, and the obstruction is a parity that has nothing to do with the pattern being difficult, because a grid is not difficult.

flat-folding · Two-colourability
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

The corrugation that closes on itself

A Miura cell crosses one crease per period in one direction and four in the other. So one of its two directions has a parity condition that half the sizes fail, and the other direction cannot fail at any size — the same sheet, the same drawing, and two gluings that behave completely differently.

tessellation · Miura
nodes of search per panel, as the rim goesthe grid ×1 cut1.004 nodes · 4 panels · 4 lettersthe grid ×2 cut1.009 nodes · 9 panels · 12 lettersthe grid ×2 cyl x1.177 nodes · 6 panels · 10 lettersthe grid ×2 cyl y1.177 nodes · 6 panels · 10 lettersthe grid ×2 torus1.506 nodes · 4 panels · 8 lettersthe grid ×3 cut1.0016 nodes · 16 panels · 24 lettersthe Miura ×1 cut1.006 nodes · 6 panels · 7 lettersthe Miura ×1 cyl y1.255 nodes · 4 panels · 6 lettersthe Miura ×2 cut1.0015 nodes · 15 panels · 22 lettersthe Miura ×2 cyl x1.1011 nodes · 10 panels · 18 lettersthe Miura ×2 cyl y1.0813 nodes · 12 panels · 20 lettersthe Miura ×2 torus1.2510 nodes · 8 panels · 16 lettersthe Miura ×3 cut1.0028 nodes · 28 panels · 45 lettersthe Miura ×3 cyl y1.0425 nodes · 24 panels · 42 lettersthe Yoshimura ×1 cut0.9110 nodes · 11 panels · 12 lettersthe Yoshimura ×1 cyl y1.139 nodes · 8 panels · 10 lettersthe Yoshimura ×2 cut0.9728 nodes · 29 panels · 36 lettersthe Yoshimura ×2 cyl y1.0024 nodes · 24 panels · 32 lettersthe Yoshimura ×3 cut0.9653 nodes · 55 panels · 72 lettersthe Yoshimura ×3 cyl x1.0042 nodes · 42 panels · 60 lettersthe Yoshimura ×3 cyl y0.9445 nodes · 48 panels · 66 lettersthe Yoshimura ×3 torus1.0036 nodes · 36 panels · 54 lettersfewer panels to divide by, and the same argument to settle

One node per panel, with the rim gone

A rectangle of repeating pattern cut out of the plane costs exactly one node of search per panel, on every family and at every size. Take the rim away and the total falls and the cost per panel rises, because the letters that were removed were the ones that could not be wrong.

tessellation · Miura
the folded period of the Yoshimuradrawn periods across the top123456the turnsame way upslides240°yesno120°yesnoyesyes240°yesno120°yesnoyesyesa turn of 240° comes back to nothing after three of them, and that is the folded periodthe drawing repeats every one, which is what makes it a tessellation

The turn a column costs

The Yoshimura's drawing repeats every column. Folded flat, it does not: the fold carries one column onto the next by a turn of two hundred and forty degrees, so the folded state repeats every third column and not before. A pattern has two periods and only one of them has ever been written down.

tessellation · Shrinkage
the folded period of the Yoshimuradrawn periods across the top1234567the turnsame way upslides240°yesno120°yesnoyesyes240°yesno120°yesnoyesyes240°yesnoa turn of 240° comes back to nothing after three of them, and that is the folded periodthe drawing repeats every one, which is what makes it a tessellation

The period nobody measured

Every repeating pattern in this collection has its drawn period recorded, because a drawing cannot be generated without one. Its folded period is recorded nowhere, and on one of the families measured the two differ by a factor of three — which means the number that has always been quoted is the wrong one for anything about the folded object.

tessellation · Found patterns
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
a square twist, 2×2 cellsone drawing, four sheetscutoutgluedacrossgluedalonggluedboth waysvertices16161616free letters40363632panels25202016V − 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

A tessellation on a cylinder

A twist tessellation has been drawn here as a patch and as a torus, and never as anything in between. Gluing one pair of a cell's edges gives the family its first sheet with exactly two edges — the shape every folded tube actually has, and the only object in the collection that can say whether the rim's cost is linear in how much rim there is.

tessellation · Twists
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
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
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.

biology · Surface in a volume
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.

biology · Molecular folding
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.

biology · Molecular folding
each family's dial, run, in the plane of the two directional factorsmeasured on the folded state of every pattern, not predicted from its rule1234561234along the patternacross itthe accordionthe square twistthe Miura foldthe Yoshimuraa point on the lower edge leaves one direction alone; a point on the dashed diagonal draws in equally both ways

The plane the five points were in

Five corrugations measured at one setting each gave five points, and the space between them was left as an open question: forbidden, or merely unvisited. Every one of those patterns has a dial nobody turned. Turned, they trace curves — the accordion's is a line with integers on it, the square twist's is the diagonal and nothing else, and the Miura's turns round on itself, so a steeper slant stops buying a smaller sheet.

tessellation · Shrinkage
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

Named alongside it

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

BoundaryTessellationPanelGluingAssignmentPatchUnit cellCrease assignmentConstraintInterior vertexLayer orderSearch cost

All concepts