The letterings that fold, and what joins them
move-graph is one function. Everything below was drawn by it when the site was
last published, at settings 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.
With nothing specified
view: "pattern"
view: "graph", degree: 6, sampler: "generic", move: "pair"
view: "graph", degree: 6, sampler: "generic"
What it checked while it drew
Collected while it drew, not written by hand. The count is how many separate times that claim was put to the test.
- each population is asked the same two questions over 16 vertices, and how many vertices that was is reported with every row ×1
- every node of the straight skeleton is equidistant from each edge that defined it, so one fold serves them all — 1 checked ×1
- every pair of letterings is tested for the move rather than assumed, so an edge in the drawing is a pair the move actually joins ×1
- on every pattern small enough to enumerate a lettering at a time, the number of pieces is exactly two to the number of creases with an interior vertex at both ends ×1
- the strips are drawn at random crease positions rather than evenly, because an evenly creased strip is the one case where every lettering folds and nothing can come apart ×1
Where it is called
Every figure listed here is drawn by the same rule, so a mistake in the rule would be in all of them at once, and so would a correction.
The creases that cannot move
One vertex's foldings are always joined up. A pattern's are not, and the number of pieces they fall into is exactly two to the power of the number of creases with an interior vertex at each end — four on a square twist, six on a hexagon twist, none at all on a preliminary base. The creases a local change cannot reach are the creases that never reach the edge of the paper.
The pieces without the list
The letterings a pattern folds in fall into pieces no folder can cross, and the count was found by writing every lettering down — which stops at eighteen creases. The Miura has thirty-eight, the Yoshimura eighty-six, and the number of pieces can be read off the drawing without listing anything: four million and two hundred and eighty-one million million.
Walking between two foldings
The letterings a vertex folds in are always counted and never navigated. Counting says a generic degree-six vertex has eight of them; navigating says that changing any two creases turns any one into any other, and that changing two neighbouring creases does not — and that the vertices which come apart are the ones with no coincidences in them, which is the opposite of what every other measurement here would suggest.
All the figures · The flat-folding field · The patterns a reader can fold