What survives the local conditions
assignment-census is one function. Everything below came out of it during this
build, at arguments taken from the essays rather than invented for this page — so a figure
here is the same figure a reader meets in an essay, and when the generator changes, this
page changes with it.
At its defaults
cases: [degree-4 vertex, miura 3×2, miura 3×3, miura 4×3]
view: "entailed"
cases: [degree-4 vertex, preliminary base, miura 2×2, miura 3×2, miura 3×3]
What it checked while it drew
Collected by running this generator with a listener on the assertions, not written here. The count is how many separate times this build put that claim to the test.
- the census names 5 patterns, each of which exists ×3
- and leaves 1, 15, 25, 22 interior vertices still holding more than one labelling ×1
- and leaves 1, 15, 25, 22, 64, 104 interior vertices still holding more than one labelling ×1
- every pattern in the census rejects some assignment — none accepts everything, which would make the theorems vacuous there ×1
- fixing one crease and propagating the vertex conditions to a fixed point settles 1, 1, 1, 1 creases on patterns holding 8, 38, 76, 84 ×1
- fixing one crease and propagating the vertex conditions to a fixed point settles 1, 1, 1, 1, 3, 2 creases on patterns holding 8, 38, 76, 84, 144, 236 ×1
- the pattern has few enough free creases to enumerate every assignment, so its count is exhaustive ×1
- the share of assignments that fold falls as the patterns grow while the raw count rises — which is the thing the census exists to show ×1
Where it is called
Changing this generator changes every figure on this list, which is what makes the list worth publishing rather than keeping in a check script.
Hardness is about the worst one
Flat-foldability is NP-hard, and every crease pattern on this site is decided in under a second. Both are true, and holding them together is the difference between using the result and repeating it: hardness is a statement about the worst instance a family contains, and nobody folds the worst one.
How little the conditions decide
Local is not global is a statement about sufficiency: every vertex can pass and the sheet still fail. There is a sharper complaint available, and it is about strength. Fix one crease of a tessellation and propagate every condition the subject has to a fixed point: three creases out of a hundred and fifty-eight follow, and sixty-six vertices are still holding more than one answer.
How many assignments fold
The local conditions throw away most of the ways a pattern could be creased. They throw away a smaller and smaller fraction as the pattern grows, and what survives grows faster than what is discarded — which is why a strong filter is not a decision procedure.
The lettering that folds nowhere
The conditions at a vertex admit 256 letterings of the square twist. Eight of them have a folded state. The other 248 satisfy developability, Kawasaki, Maekawa and the big-little-big lemma at every vertex of the pattern and cannot be folded by anyone — and this site printed one of them for years, at true scale, with instructions to fold it first.
Every generator · The flat-folding field · The patterns a reader can fold