Tessellations

The ring is the loop

The square twist's central polygon is four creases enclosing one panel, and a lettering that gives all four the same letter has no folded state. That was established by enumerating the orderings of nine panels. It can now be read off the crease list in one pass, because the eight panels the letters send round in a circle are exactly the ring — the twist's own defining feature, contradicting itself.

Assumes A square that turns and The lettering that folds nowhere.

A square that turns is the simplest twist there is: a square panel in the middle, four pleats running out from its sides, and the whole thing rotating as the paper gathers. Nine panels, twelve creases, four interior vertices. It is the unit every twist tessellation in this collection is built from, and it is small enough that every one of its four thousand and ninety-six letterings can be written down.

Two hundred and fifty-six of them satisfy every condition at every vertex. Eight have a folded state. The lettering that folds nowhere is the account of the gap, and its sharpest finding was about a particular group: the thirty-two letterings whose central ring reads as one letter — all four creases of the middle square the same — have no folded state at all, and that is the group a designer draws.

Establishing it took an exhaustive search over the orderings of nine panels, seven and a half thousand nodes at a time, thirty-two times.

Four of those thirty-two can now be settled in one pass. And what settles them says where in the pattern the trouble is.

The circle is the ring

Each crease of a flat-folded pattern fixes which of the two panels it joins lies above the other — a valley brings the far panel over, a mountain takes it under, and turning the near panel over on the way swaps which a reader sees. A circle in those statements is a proof that no order of the panels satisfies all of them.

The letters send the panels round in a circleOne arrow per crease, drawn from the panel that must lie below to the panel that must lie above. The direction is decided by the letter and by whether the near panel has been turned over, so the whole picture is read off the crease list without placing a single layer.each arrow points from the lower panel to the higher one9 panels · 12 creases · 12 arcsa loop of 8 panels — no order existsthe arrows are the whole of the test — nothing here asks which panels lie over which
Fig. 1 The square twist with a uniform central ring, drawn as its panels with one arrow per crease pointing from the panel that must lie below to the one that must lie above. Eight of the nine panels are in a circle.

The circle is eight panels long. Trace it and it is the central square, then a pleat panel, then the next quarter of the surround, then the next pleat panel, all the way round and back — which is to say it is the ring: the closed chain of panels that the twist polygon’s own four creases and the four pleats between them make.

That is the twist’s defining feature contradicting itself. A twist is a polygon that rotates, and the panels that let it rotate are the ones that go round it. Give them letters that all point the same way and the paper is being asked to spiral without end.

The square twistA square twist: a square with a pleat running out from each of its 4 corners, drawn at 150 mm and carrying 6 mountain and 6 valley creases — 704 mm of folding on a sheet 150 mm across. As the sheet closes the square rotates, which is what gives the family its name. The sector angles are fixed by Kawasaki and the assignment is chosen for having a folded state rather than for reading well — and the unit is verified, while the tessellation it belongs to is not.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
square twist — sheet 150×150 mm — 6 mountain, 6 valley, 704.28 mm of crease
Fig. 2 The unit itself: the central polygon, its four pleats, and the sides that turn. The chain of panels the circle above runs through is the one going round the middle.

Reading the circle by hand

The chain is short enough to check with a pencil, and doing so once is worth more than the picture.

Number the central square’s four creases going round. Each joins the middle panel to one of the four quarter-panels of the surround; each quarter-panel is joined to the next by a pleat. So the ring alternates: middle, quarter, middle, quarter — except that the middle panel is only one panel, so the chain that goes all the way round is not through the centre but through the pleats, which is why it has eight panels rather than eight visits to five.

Now the orientations. The central panel is face up; every panel one crease away from it is face down; every panel two creases away is face up again. Round the eight-panel chain the orientation alternates, so an arrow points forward at each step only if the letter flips at each step too — and the ring’s four creases all carrying the same letter is exactly the flip pattern that produces agreement all the way round when combined with the pleats’ letters. Which pleat letters those are is what the other twenty-eight uniform-ring letterings differ in, and it is why only four of the thirty-two close.

Every contradiction has an even number of panels in itThe length of every circle found in the layer relation, over every population of crease patterns here. No odd length occurs, because the panels of a flat-foldable pattern two-colour; and no length of four occurs, because a circle of four goes round one vertex and the counting theorem closes it.the bar is how many circles of that many panels were found726 circles, from 6 panels to 32, over every pattern family measured here4 panels0round one vertex — Maekawa forbids it5 panels0odd — the two-colouring forbids it6 panels21129.1% of the circles measured7 panels0odd — the two-colouring forbids it8 panels21129.1% of the circles measured9 panels0odd — the two-colouring forbids it10 panels8211.3% of the circles measured11 panels0odd — the two-colouring forbids it12 panels9513.1% of the circles measured13 panels0odd — the two-colouring forbids it14 panels304.1% of the circles measured15 panels0odd — the two-colouring forbids it16 panels314.3% of the circles measured17 panels0odd — the two-colouring forbids it18 panels172.3% of the circles measured19 panels0odd — the two-colouring forbids it20 panels141.9% of the circles measured22 panels81.1% of the circles measured24 panels152.1% of the circles measured26 panels71.0% of the circles measured28 panels20.3% of the circles measured30 panels20.3% of the circles measured32 panels10.1% of the circles measuredthe empty rows are not rare cases — they are lengths that cannot occur, and each has its own reason
Fig. 3 Reading the circle by hand: the length of every contradiction found anywhere in this collection. A twist’s ring is one of these, and its length is the number of sides the central polygon has.

Why a designer draws it

The uniform ring is not an obscure choice. It is the natural one and there is a reason for it that survives the fact that it does not work.

The rule that suggests itself for a twist is that the polygon in the middle folds one way and the pleats alternate — every crease of the central ring a mountain, say, with the pleat creases taking valleys by turns. It is the rule anyone would state, it is symmetric under the rotation the twist is built on, and it satisfies Kawasaki and Maekawa at every vertex.

The refusal the letters can see, and the one only a search canSix developable quadrilateral meshes, each asked twice whether its panels can be stacked: once by reading the arcs its letters force, and once by searching every ordering. The letters agree with themselves on all six; the search refuses four of them.the bar is the nodes the ordering search visitedthe letters are consistent on every one of these, so the one-pass test says nothing about any of themmesh 37,4739 panels · 7,473 nodes · no order existsmesh 58,0079 panels · 8,007 nodes · no order existsmesh 89,3469 panels · 9,346 nodes · no order existsmesh 111,0159 panels · 1,015 nodes · an order existsmesh 141449 panels · 144 nodes · an order existsmesh 199,0629 panels · 9,062 nodes · no order existsa red bar is a pattern with no folded state, found only by visiting every ordering it might have had
Fig. 4 Why a designer draws it that way: the refusal the letters can see beside the one only a search can. Grouping the letterings by what happens round the ring is the cheap half, and it catches the ones a hand would have caught.

Both extremes are empty. A ring that reads as one letter has no folded state; a ring that alternates at every step has none either; the eight that work all change letter exactly twice going round. So the symmetric answers are the wrong ones on both sides, and the symmetry the letters cannot keep is the standing account of why a pattern with a rotational symmetry so often has no lettering that shares it.

The other polygons

The square is the smallest twist and the argument is not about squares. Every polygon that can twist has a ring, and the ring is the chain the letters can close.

Which polygons twist settled which shapes admit the construction at all: the polygon’s sides must be able to take pleats that meet the neighbours’ at the right angles, which is a condition on the tiling rather than on the polygon alone. Every one that passes it has a closed ring of creases round a central panel, so every one of them is exposed to this failure — and the larger the polygon, the longer the ring and the more letters have to conspire to close it.

That cuts both ways. A hexagon twist’s ring is six creases and a twelve-panel chain, and two hundred draws of it are consistent in all two hundred: the longer chain is harder to close, not easier. So a larger unit is safer and a patch of many small units is not, which is the opposite of what a designer worried about complexity would guess.

The bigger the patch, the rarer a lettering that agrees with itselfThe same twist construction over five tilings, ordered by how many panels the folded patch has, against the share of independently drawn letterings whose letters do not contradict themselves. The share falls to nothing well before the patch is large enough to be interesting.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
Fig. 5 The other polygons, measured rather than drawn: the share of drawn letterings that agree with themselves as the patch grows. The ring length differs between tilings, and what it decides is how much room a lettering has to be wrong in.

What the one-pass proof adds, and what it does not

Four of the thirty-two, not thirty-two of thirty-two. It is worth being exact about that, because the temptation is to say the cheap test has replaced the search and it has not.

Of the thirty-two uniform-ring letterings, four close a circle in their letters and twenty-eight do not. The twenty-eight have letters that agree with themselves perfectly and no folded state, and finding that out still costs the full search over orderings — refused by the rule that a panel may not lie between the two panels a crease joins, or by the rule that two folds in the same place may not interleave, both of which are statements about where the paper landed rather than about what the letters said.

So the improvement is in cost and in explanation rather than in coverage. Four letterings that used to be refused by an exhaustive computation are now refused by a sentence naming eight panels, and the sentence points at the ring. Twenty-eight are refused as before.

It is worth noticing what the middle group is. A ring changing letter exactly twice going round divides the four creases into two consecutive pairs — two mountains then two valleys — which is not a symmetric arrangement and cannot be described by any rule of the form the polygon folds this way. It is a choice of where to put the break, and there are four places to put it, times the pleat letters that go with each. Nothing about the twist suggests it, and it is the only thing that works.

Why this matters more on a patch than on a unit

On a nine-panel unit, none of this is needed. The search finishes in milliseconds and gives a complete answer.

On a tessellation patch it is the only answer available. A patch is many twist units sharing pleats, and every one of them carries a ring — so the failure the square twist can have once, a patch can have at every polygon, and the search cannot be run on it at all.

How often a redrawn lettering is consistent with itselfIndependent letterings drawn from each pattern, and how many of them the letters do not contradict. A pattern this site prints is nearly always consistent whatever letters it is given; a tessellation patch cut from the same construction almost never is.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
Fig. 6 Two hundred letterings drawn from each of seven patterns. The three tessellation patches at the bottom are stacks of the unit above them, and the shares are two orders of magnitude apart.

Twenty-six of two hundred draws are consistent on a square patch of nine polygons; a hundred and ninety-eight of two hundred on the single unit. Nine copies of a pattern that fails one time in a hundred fail together most of the time, because the rings interact: a pleat is shared between two polygons, and a letter that suits one ring is a letter the other has to live with.

The the square grid's twist tessellationThe crease pattern the offset construction produces, with its assignment found by propagating the two vertex conditions rather than drawn on. Every interior vertex has four creases and passes developability, Kawasaki, Maekawa and the big-little-big lemma.what the construction produced9 twists, 36 interior verticesturned 20.1° from the tiling's edgespleats 0.121 to 0.121 wide2.36× smaller once the pleats are taken upevery vertex passes all four conditionsmountainvalleyraw edge
square twist tessellation — sheet 165×165 mm — 43 mountain, 41 valley, 2132.61 mm of crease
Fig. 7 The patch. Every polygon has a ring; every pleat joins two rings; and a lettering has to keep all nine of them from closing at once.

A result that moved from a search to a sentence

There is a general point here about what it means for a finding to be superseded, and this is a clean instance of it.

The original result was obtained by running a complete decision procedure on a small enough case: enumerate the thirty-two uniform-ring letterings, place the nine panels for each, and search every ordering. That is unimpeachable and it is also opaque — it says no thirty-two times and never says why. Nothing in it generalises: the same computation on a pattern of twenty-four panels does not finish.

The new result covers four of the thirty-two and says something about all of them. It names the chain, it says the chain is the ring, and the naming transfers: any twist, at any polygon, on any tiling, has a ring, and the ring is where to look. It also predicts a thing the search could not — that a longer ring is harder to close, which is why the hexagon twist never fails this test and the square one occasionally does.

Neither result replaces the other, and the shape of the pair is worth carrying: an exhaustive answer on a small case, and a partial answer with a mechanism in it that survives the case being scaled up. The second is what makes the first mean something on a patch.

The trap this construction fell into

There is a piece of history here that is directly downstream of the ring being the failure, and it is worth recording because it went unnoticed for a long time.

The tessellation builder does not draw the letters on. It propagates the vertex conditions to a fixed point and branches where propagation stalls, which returns a solution — and a propagation returns whichever solution its branch order reaches first, not a good one. What it reached first on the square patch was a lettering that satisfied every condition at every vertex and forced a circle of twenty-eight panels.

So the patch that was drawn, printed and measured for several rounds of work had no flat folded state and could be proved to have none in one pass over its own crease list. Nothing noticed, because nothing was reading the crease list that way.

The builder now checks, and where it finds a circle it redraws the letters with the branch order randomised until it finds a lettering without one — seven of forty independent draws are clean on the square tiling, so it is cheap. A patch with no clean draw keeps the first solution and says so rather than pretending, which is the case the rhombille is in.

The loop is short and the tangle it lies in is half the sheetA tessellation patch with every panel that lies on some loop of the forced order shaded. The cycle a search reports is a dozen panels; the set of panels that could be on one is most of the patch, which is why removing a single crease never repairs it.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
Fig. 8 What the first solution looked like: the square patch at a contradictory lettering, with every panel that lies on some circle shaded. Thirty-five of forty-nine.

Why the rings pull together rather than apart

The coupling has a direction and it is worth asking why it runs the unhelpful way, since two constraints sharing a variable could in principle make each other easier.

A pleat is one crease with one letter, and it belongs to the rings of the two polygons either side of it. Each ring wants its four letters not to agree all the way round — that is what avoiding a circle means — so each ring is asking its four creases to break somewhere. A pleat is one of the four for two different rings at once, and a letter that provides the break one ring needs is, at the neighbouring ring, one more letter agreeing with its predecessor.

So a shared crease is a resource two rings compete for rather than one they share. Breaking one ring at a pleat spends the break, and the ring on the other side has to find its break elsewhere — among creases that are themselves shared. On a patch every pleat is shared, so every break a lettering makes is a break withheld from a neighbour, and the constraints tighten each other instead of relaxing.

That also says which patches should be worst, and the prediction is checkable. A tiling whose polygons have many neighbours puts more rings on each pleat’s competition, so the coupling should be stronger the higher the tiling’s degree — the rhombille, with its degree-six vertices, worse than the square grid at degree four. The rhombille is the patch on which no draw comes back clean, which is consistent and is not proof.

And it explains the essay’s own surprise about polygon size. A larger polygon has a longer ring, which needs one break among more creases and is therefore easier to satisfy — and it also has more neighbours, which is harder. On the twists measured the first effect wins, which is why a hexagon twist never fails and a square one occasionally does. Which of the two dominates on a tiling nobody has drawn is a question about the tiling’s degree against its polygon’s size, and it is exactly the trade a designer choosing a tessellation is making without knowing it.

What a folder would notice

None of this is visible in the drawing, and that is the part a reader with paper should be warned about.

A crease pattern for a square twist looks the same whichever of the two hundred and fifty-six admissible letterings it carries: the same lines in the same places, differing only in which are dashed and which are solid. Thirty-two of those printings cannot be folded by anyone, and there is nothing on the sheet to say so — the vertices all check out, the paper is the right shape, and a folder discovers the problem by running out of ways to put the layers.

That is the ordinary experience of trying to fold a twist from a pattern found somewhere, and it has usually been attributed to the folder. It is worth knowing that a third of the letterings that pass every published condition are impossible, that the natural one is among them, and that on four of them the impossibility is a chain of eight panels anybody can trace with a finger.

The unit and the tiling, once more

There is a pattern to the mistakes this family has produced, and this is the fourth of them.

A unit that folds is not a tessellation was the first: a waterbomb base folds, and a sheet of them need not. The tiling the unit could not promise was the second, where the side distances that make one polygon work do not propagate. Cutting a patch out of a plane was the third, where the way the patch was taken from the plane put creases across one another.

This is the fourth and it is the same shape: a property of the unit — that a good lettering exists — does not survive being repeated. The unit has eight good letterings out of two hundred and fifty-six. Nine units sharing pleats have twenty-six out of two hundred draws, and the same construction on a denser tiling has none.

How much room a pattern gives its letters to disagreeEvery pattern family here plotted by how many independent closed chains of panels it has against how often an independently drawn lettering agrees with itself. The count is Euler's relation on the panel graph and equals the number of interior vertices; it is read off the drawing before any letter is chosen.more chains is more chances for one of them to closethe printed shelftessellation patchesfold-and-cut outlinessheets folded at random00.2500.5000.7501255075100125independent closed chains of panelsshare of letterings that agree with themselvesa point at nought is nought of the draws taken, which is not a proof that no consistent lettering exists
Fig. 9 Every pattern family here by how many independent closed chains its panels form against how often a drawn lettering agrees with itself. A single twist unit sits at four chains; nine of them sharing pleats sit at thirty-six.

The count that separates them is the number of independent closed chains, which is four on the unit and thirty-six on the patch — and that number grows linearly, four per twist polygon, so nine units carry nine times as many chains and not two to the ninth.

What grows exponentially is the share that fails, because a lettering has to keep every chain from closing at once. If the chains were independent coins, the share consistent at nine units would be the unit’s share raised to the ninth: 198 in 200 becomes about 183 in 200, which is a mild decline.

The measured figure is twenty-six in two hundred, which is seven times worse than that. So the chains are not independent: they share pleats, a letter that suits one ring is a letter its neighbour has to live with, and the coupling is positive — nine rings sharing edges are considerably harder to satisfy together than nine rings that share nothing.

That is the sharper version of a unit is not a tessellation, and it has a number in it. Repetition does not merely multiply the opportunities to fail; it correlates them, and the correlation costs a factor of seven at nine units on this pattern. Whether that factor grows with the patch or settles is a measurement nobody has taken, and it is the one that would say whether a large tessellation is difficult or impossible.

What is different this time is that the failure is not in the drawing. The drawing is right; it has been right since the clipping repair. The letters are what is wrong, and the letters were never drawn by anybody — they were the first thing a propagation happened to return.

Named alongside this one

Essays reaching for the same objects. Nobody chose these; they are what the concept index makes visible.

What links here

Every essay whose body links to this one.

The objects this essay names

Each one links to every other essay that touches it.

EnumerationFolded stateLayer orderingNecessary conditionPleatSearch costTwistUnit cell