Concept

Tessellation — where it appears

A crease pattern that repeats a unit across the sheet. Its behaviour is not the unit's behaviour: a unit that folds can tile into a pattern that does not, and the difference is a condition on the tiling rather than on the unit.

Named by 51 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
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
two kinds of vertex, both forced16 of degree 490°, 90°, 90°, 90°9 of degree 690°, 45°, 45°, 90°, 45°, 45°40 mountain and 36 valley creases14.3 sheet-widths of foldingmountainvalleyraw edge

The base that tiles

The waterbomb base is the first thing most people fold and the last thing they think about. Repeat it across a sheet and it becomes a tessellation with two kinds of vertex, an assignment that has to be searched for rather than remembered, and a folded state thirty-two times smaller than the paper.

tessellation · Waterbomb
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
what the construction produced9 twists, 36 interior verticesturned 24.1° from the tiling's edgespleats 0.118 to 0.118 wide2.20× smaller once the pleats are taken upevery vertex passes all four conditionsmountainvalleyraw edge

Any tiling makes a twist

A twist tessellation is usually drawn, admired and copied. It can be derived instead: hand the construction any tiling of the plane and it returns a crease pattern that folds flat, with the twist polygons' shapes forced by the tiling's own angles and nothing left to choose but how large and how turned.

tessellation · Twists
what the construction produced23 twists, 122 interior verticesturned 24.1° from the tiling's edgespleats 0.068 to 0.068 wide1.58× smaller once the pleats are taken upevery vertex passes all four conditionsmountainvalleyraw edge

Where two twists share a pleat

Every twist tessellation the tradition draws has one size of twist, because every tiling it is drawn on has one kind of vertex. Hand the construction a tiling with two, and the pleat between a large twist and a small one turns out to fix their sizes exactly — three to one, and nothing else folds.

tessellation · Resch
30°60°90°0.250.400.550.700.85how much of the room between two vertices the twists takeno paper leftno assignment existstwist angleboth curves are measured rather than plotted from a formula

Fenced at both ends

The twist angle of a tessellation looks like a free dial, and it is fenced twice. Turn too far and the pleats have no paper left. Turn too little and something stranger happens: every angle condition in the subject goes on holding and the pattern loses its mountain-valley assignment entirely.

tessellation · Twists
parallelstraight creases spread 0.0°flat, they spread 0.0°fan 5.2°straight creases spread 25.5°flat, they spread 30.9°fan 9.2°straight creases spread 46.6°flat, they spread 55.0°fan 13.8°straight creases spread 72.4°flat, they spread 82.5°

The corrugation that curves

A Miura is a flat sheet that becomes a flat slab. Open its straight creases into a fan and the same construction gives a corrugation that wraps a cone — exactly a cone, with every straight crease passing through one point to fifteen decimal places, at every moment of the fold, with the apex travelling as the sheet closes.

tessellation · Miura
deepest pile on the shelf: 60 layersin office copier paper, that is 18.5 mm of paper to find at one creaseThe Yoshimura pattern60 layers · 18.5 mm · 59× the two-layer allowanceThe waterbomb tessellation32 layers · 9.7 mm · 31× the two-layer allowanceThe Miura fold16 layers · 4.7 mm · 15× the two-layer allowanceThe tapered corrugation16 layers · 4.7 mm · 15× the two-layer allowanceThe square twist9 layers · 2.5 mm · 8× the two-layer allowanceThe preliminary base8 layers · 2.2 mm · 7× the two-layer allowanceThe hexagon twist7 layers · 1.9 mm · 6× the two-layer allowanceFold and cut — the triangle7 layers · 1.9 mm · 6× the two-layer allowancetwo layers

The pile, not the panel

Every technique for building a fold out of panels with depth is drawn, described and priced at one crease between two panels. A folded model has two layers nowhere except at its last fold: the printed patterns here reach eight, sixteen, thirty-two and sixty, and the length a thick panel has to find at those creases is not the published allowance but fifty-nine times it.

rigid · Thickness
counting rules and counting objects are different measurementsrepeating rulesnine binary choices, one per crease of the repeating unit512pass on a small patchevery vertex of a two-by-two patch satisfies every condition56pass on a larger oneand on a patch that contains all four kinds of vertex32folded objectscounted by comparing the folded panels, not the letters1

Thirty-two rules, one object

Five hundred and twelve repeating rules for the waterbomb tessellation, fifty-six that pass on a small patch, thirty-two that pass on one containing every kind of vertex. Fold all thirty-two and compare their panels: the same panels, in the same places, with the same areas, every time. The rules are thirty-two labels on one object, and a count of them has counted the labels.

tessellation · Waterbomb
each row is an exhaustive count over the patterns that construction producedon the edgedeepest piletimes smallercrease densitythe printed patterns8 patterns62%19.415.5×7.9twist tessellations12 patterns52%10.02.7×12.9quadrilateral meshes6 patterns67%8.74.8×5.2fold-and-cut patterns7 patterns86%10.41.2×2.2

Four ways to draw a pattern

Every sentence here of the form over some crease patterns is a statement about a construction nobody declared, and it is worse than the same problem at a vertex because a pattern has a shape as well as angles. Four ways of producing a pattern that satisfies every condition disagree about how far it shrinks by a factor of twelve, about how much creasing it costs by a factor of six, and about how much of it is edge by a factor of two.

complexity · Typical instances
a 3 × 3 patch: 42 creases, 18 of them buriedthe bar is on a log scale, because the two numbers differ by four orders of magnitudepieces the 3×3 patch has262,144pieces containing a repeating rule32, one eachevery one of the 32 rules is in a piece no other rule is in

Thirty-two rules, thirty-two pieces

The waterbomb tessellation's surviving repeating rules fold to one object — same panels, same places, same areas. Put them in the space of letterings the patch admits and they occupy thirty-two different pieces of a quarter of a million, so no two of them can be reached from one another without unfolding the sheet.

tessellation · Waterbomb
the bar is the share of draws whose letters agree among themselvesa draw that disagrees is a proof that the pattern has no flat folded state with those lettersthe preliminary base200 of 2008 panels · 8 creases · 0 contradict themselvesthe square twist198 of 2009 panels · 12 creases · 2 contradict themselvesthe Yoshimura190 of 20065 panels · 86 creases · 10 contradict themselvesthe Miura fold181 of 20024 panels · 38 creases · 19 contradict themselvesa square twist patch26 of 20049 panels · 84 creases · 174 contradict themselvesa hexagonal patch2 of 20077 panels · 142 creases · 198 contradict themselvesa rhombille patch0 of 200157 panels · 282 creases · 200 contradict themselvesthe sampler returns solutions rather than a uniform draw over them, so these are shares of what it found

A proof in one pass

Deciding whether a crease pattern has a flat folded state is hard, and the search that decides it gives up at twenty-four panels. One line of the same machinery does not search at all: each crease says which of the two panels it joins lies above the other, and a circle in what those statements demand is a proof that no folded state exists. It costs one pass over the crease list, and on a tessellation patch of a hundred and fifty-seven panels it answers in milliseconds.

flat-folding · Forced order
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
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
two kinds of vertex, both forced16 of degree 490°, 90°, 90°, 90°9 of degree 690°, 45°, 45°, 90°, 45°, 45°40 mountain and 36 valley creases14.3 sheet-widths of foldingmountainvalleyraw edge

The rule that breaks the count

The waterbomb tessellation has five hundred and twelve repeating rules for its letters and thirty-two of them fold. A hundred and twenty of the other four hundred and eighty send four panels round in a circle — the shortest circle a crease pattern can have — and every single one of those hundred and twenty has broken Maekawa's count at the very vertex the circle goes round. The theorem that closes the shortest circle, caught doing it, a hundred and twenty times.

tessellation · Waterbomb
each circle holds a crease shorter than a thousandth of the sheet12 fragments7.9·10⁻⁶ of a sheet · M5.9·10⁻⁵ of a sheet · M7.9·10⁻⁶ of a sheet · M5.9·10⁻⁵ of a sheet · V7.9·10⁻⁶ of a sheet · V5.9·10⁻⁵ of a sheet · Mand 6 more1018× to draw the longest142 creases and 60 interior vertices, 12 of the first and six of the second invisible

The crease the drawing cannot show

Twelve creases on a printed crease pattern are eight millionths of a sheet long. They are in every count the collection takes of that patch, they pass every theorem, and no printer resolves them and no hand folds them. They are also the only thing holding the folded sheet together.

flat-folding · As drawn
one row per pitch, with the printed setting markeda fragment is a crease shorter than a thousandth of the sheetpitchcreasesinterior verticesfragments0.320154660.330154660.335142600.34014260120.345130540.350130540.36013054130 creases and 54 vertices is what deleting the fragments was expected to give, and one step of pitch gives it with a sheet that folds

A patch on a knife edge

The tessellation patch this collection prints has twelve creases nobody can see. Move the pitch of its tiling by five thousandths and they are gone — and so is a whole ring of twists. The patch sits exactly on the moment a ring of the pattern passes through the edge of the sheet, and the blemish is what that moment looks like.

flat-folding · Boundary
each cell is one patch, searched to a verdictgreen: a lettering exists · magenta: none exists, by exhaustion0.150.250.350.50.70.91.11.3turn angle, in radianssquare2626262626262626elongated1515323231313232hexagonal1515394545464545triangular1515393939373737the number in a cell is the nodes the search visited; 6 of 32 patches have no lettering at all

A region with no lettering

One turn angle at which a tessellation patch has no consistent lettering was found by sweeping a dial. Sweeping two dials finds nine patches with none, across three tilings, filling a corner of the parameter space — and never touching the square tiling, whose sectors have no sixty degrees to cross.

flat-folding · Genericity
each cell is one patch, searched to a verdictgreen: a lettering exists · magenta: none exists, by exhaustion0.150.250.350.50.70.91.11.3turn angle, in radianssquare2626262626262626elongated1515323231313232hexagonal1515394545464545triangular1515393939373737the number in a cell is the nodes the search visited; 6 of 32 patches have no lettering at all

A population nobody chose

Five crease patterns were measured over and over because somebody had drawn five. Ninety-six drawn from a stated grid of tiling, turn and pleat width say something the five could not: nine of them have no consistent lettering at all, and the phenomenon the collection had spent so long measuring belongs to the one tiling the grid leaves out.

complexity · Typical instances
each cell is one patch, searched to a verdictgreen: a lettering exists · magenta: none exists, by exhaustion0.150.250.350.50.70.91.11.3turn angle, in radianssquare2626262626262626elongated1515323231313232hexagonal1515394545464545triangular1515393939373737the number in a cell is the nodes the search visited; 6 of 32 patches have no lettering at all

The dial and the tiling that is not alike

Four of the five tilings a twist tessellation can be built on behave identically under every dial the construction has. The fifth has two kinds of vertex, and everything about it is different: it is the only one whose search has a tail, the only one whose shallow patches take minutes to draw, and the only one where a distance has to be solved rather than assumed.

tessellation · Twists
each mark is one crease, ranked shortest to longest10⁻⁵10⁻⁴0.0010.010.1a factor of 498, and no crease in itlength, as a fraction of the sheet's side142 creases, rankedthe 12 in magenta are drawn, counted, lettered and put through every theorem, and none of them is visible

The shortest crease is not a crease

A crease pattern's density is usually quoted as total crease length over sheet area, which treats a metre of folding as a metre whether it arrives as one long line or ten thousand short ones. Reading the lengths individually instead finds twelve creases on a printed patch that are shorter than a wavelength of light.

material · Crease density
the bar is the share of the twists on the paper that the paper's edge cuts0.5 of the sheet86%1 whole · 6 cut by the edge0.42 of the sheet55%5 whole · 6 cut by the edge0.34 of the sheet59%7 whole · 10 cut by the edge0.28 of the sheet70%7 whole · 16 cut by the edge0.22 of the sheet37%17 whole · 10 cut by the edge0.18 of the sheet49%23 whole · 22 cut by the edgea patch is a picture of a tessellation, and the smaller the unit the less of the picture is edge

The edge is what makes it hard

Grids, crumples, leaves, corrugations and fold-and-cut patterns all give up a consistent lettering at one step per panel with no wrong guess anywhere. The one family that does not is a tessellation clipped to a square, and what separates it from the others is not disorder, not size and not irregularity. It is having a rim.

design · Sheet shape
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
the twist patches: nodes against panels050100150one a panel0 panels157every vertex of this family keeps 4 labellings

The most decided vertex here

Sixteen ways to letter four creases; Maekawa allows eight; the big-little-big lemma allows four. A twist polygon's corner is one of the few vertices in this collection where the second cut applies, so it keeps four labellings where a grid, a leaf, a Miura and a crumple all keep eight — and the family the collection long called difficult turns out to be the one whose conditions decide the most.

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

biology · Leaf folding
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
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
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
do the pleat equations close round every loop, as drawn and under three linear mapstrivially means every edge's equation is one at both ends; otherwise the largest disagreement round a loopas drawnshearedstretchedgeneralthe square gridcloses, triviallycloses, triviallycloses, triviallycloses, triviallythe triangular gridcloses, triviallycloses, triviallycloses, triviallycloses, triviallythe honeycombcloses, triviallycloses, triviallycloses, triviallycloses, triviallythe rhombille tilingclosesoff by 1.76off by 2.18off by 2.96the elongated triangular tilingcloses, triviallyoff by 3.14closes, triviallyoff by 4.77the maps: a shear of 0.3, a stretch of 1.5 along one axis, and the matrix [1.3, 0.4; −0.2, 0.9]

Closing the loops is not folding

The twist construction propagates one equation along every edge of a tiling, and it can only work where the equations agree round every loop. Asked which irregular tilings pass, a linear map gives a clean answer: the square grid, the triangular grid and the honeycomb pass under every shear and stretch tried, because each edge has a half-turn symmetry that makes its equation exactly one at both ends, and a half-turn survives any linear map. The rhombille passes only as drawn. But passing is not folding. On every one of those images — including the ones whose loops close exactly — the construction produces a pattern that fails the angle condition at every turn tried. The loops were a necessary condition all along, and the construction needs something the tilings' images do not give it.

tessellation · Resch
does the construction fold, with one side distance a vertex and with one a sideat a turn of 0.42 radians; the second construction's pleats run at -0.5 radians from their own edgesas drawnshearedstretchedgeneralone a vertex / one a sidethe square gridfolds/foldsno/foldsno/foldsno/foldsthe triangular gridfolds/foldsno/foldsno/foldsno/foldsthe honeycombfolds/foldsno/foldsno/foldsno/foldsthe rhombille tilingfolds/foldsno/foldsno/foldsno/foldsthe elongated triangular tilingfolds/foldsno/foldsno/foldsno/foldsthe maps: a shear of 0.3, a stretch of 1.5 along one axis, and the matrix [1.3, 0.4; −0.2, 0.9]

One number where the corners wanted four

The twist construction gives a vertex a single side distance, and every account of these patterns does the same — it is what rotate-and-shrink means. The conditions never asked for it. Written out, the corner condition is one linear equation per pleat crease in the distances taken one per edge, so a degree-four vertex carries four unknowns against two independent equations. Given them back, the twelve sheared and stretched tilings that refused to fold all fold.

tessellation · Resch
each side of the twist, divided by the edge it facesone vertex of the the square grid under [1.3, 0.4, -0.2, 0.9]1.0520.3871.0520.387the weightsthe same edges, scaled by them, end to endthe 4 weighted edges close to 3e-16 of their own total length, and the two ends of every edge agree to 3e-15

Every twist writes an equilibrium

Divide each side of a twist polygon by the length of the edge it faces. The polygon closing says those numbers, weighted onto the edges, balance at the vertex; the pleat matching says the two ends of an edge agree on the number. Together they are a positive equilibrium stress — the thing a tiling has when it is the plan of a spider web — and the construction has been writing one at every vertex without being asked for it.

tessellation · Resch
how much more the folded sheet draws in one way than the otherthe ratio of the two principal factors of the collapse, fitted to the twists' positions before and after foldingas drawnshearedstretchedgeneralthe square grid1.00004.41391.00003.5417the triangular grid1.00001.00001.00001.0000the honeycomb1.00002.81795.38555.0597the rhombille tiling1.00002.81795.38555.0597the elongated triangular tiling1.00004.41391.00003.5417one is a similarity — the folded sheet is the flat one scaled and turned, with no direction preferred

The sheet draws in crooked

Every twist tessellation measured here has collapsed by a similarity: the folded sheet is the flat one scaled and turned, the same way in every direction. The patterns that exist on sheared and stretched tilings do not. Ten of the fifteen images fold by a map with two different principal factors, up to five and a third to one — and the prediction that said which ten, made from the weights the pattern writes on its edges, is wrong in both directions.

tessellation · Resch
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 cross factor of a leaf corrugation against its zigzag anglemeasured off the folded state's own extent, at every angle drawnno change0.600.680.760.840.921.00zigzag angle, radians0.981.001.02below one between 0.7 and 0.88 radians, at worst 0.98555 — and the areal factor never falls below 1.360

The direction that gets longer

A shrink factor below one is a direction in which the folded sheet is bigger than the flat one, and the leaf corrugation has one. The cause is not the taper and not the angle: a corrugation's folded extent across its own creases is a constant of the cell, the same number at two rows and at ten, so the cross factor is the sheet's height divided by a fixed length — a straight line through the origin that crosses one at a definite row count.

tessellation · Shrinkage

Named alongside it

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

PeriodicityAssignmentPanelTwistBoundaryInterior vertexUnit cellCrease patternLayer orderingTilingBoundary vertexConstraint

All concepts