Series

Typical instances — the series

9 essays on one idea, from the one that introduces it to the one that assumes the rest.
  1. populationpassfoldhave a gapbranchcut twice at random51 vertices, 13 kinds9.68.020%0%whole multiples of 45°60 vertices, 1 kinds30.019.3100%69%whole multiples of 30°60 vertices, 13 kinds19.713.177%26%a named vertex, jittered60 vertices, 4 kinds8.08.00%0%

    Which vertices are the random ones

    Every measurement on this site that begins 'over 373 random degree-four vertices' is a statement about a population nobody declared. There is no canonical way to pick a crease pattern at random, four defensible ways of doing it disagree about the same three questions by factors rather than by margins, and the disagreement reaches a sentence this site has published as though it were general.

    part 1 · complexity
  2. 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.

    part 2 · complexity
  3. the bar is the share of the population with a folded stateevery pattern in all four passes every condition at every interior vertexthe printed patterns4 of 80 cannot be placed · 0 cannot be ordered · 4 undecidedtwist tessellations2 of 125 cannot be placed · 2 cannot be ordered · 3 undecidedquadrilateral meshes2 of 60 cannot be placed · 4 cannot be ordered · 0 undecidedfold-and-cut patterns5 of 70 cannot be placed · 0 cannot be ordered · 2 undecidedundecided is a real answer here and is not rounded toward either side

    The patterns a checker is tested on

    This site keeps four populations of crease patterns and runs its checkers over them, which is what makes a claim about typical instances measurable rather than rhetorical. Asked whether the members actually fold, the populations answer: thirteen of thirty-three do, six place and cannot be ordered, five cannot be placed at all, and nine are past what the search will finish.

    part 3 · complexity
  4. the bar is the share of random drawings with at least one crossing in them2 segments23.1%0.23 crossings on average3 segments51.2%0.69 crossings on average4 segments73.5%1.36 crossings on average6 segments95.2%3.48 crossings on average8 segments99.4%6.53 crossings on average12 segments100.0%15.30 crossings on average20 segments100.0%43.76 crossings on averageevery crease pattern in this collection has none, and none of them was drawn at random

    Drawn by the same hand

    Two straight segments dropped on a square cross about 23% of the time; four of them cross 74% of the time; twelve cross with certainty, about fifteen times over. Every crease pattern in this collection's four test populations has none — not because the checkers were catching them, but because the same rules that drew the patterns were incapable of producing one, and nothing looked until a construction finally did.

    part 4 · complexity
  5. the bar is the mean share of redraws that agree with themselvesas the populations stand, every member is consistent and the refusal fires on none of themthe printed patterns96.7%8 of 8 could be asked · worst member 90%twist tessellations55.0%7 of 12 could be asked · worst member 7%quadrilateral meshes96.9%6 of 6 could be asked · worst member 82%fold-and-cut patterns100.0%7 of 7 could be asked · worst member 100%a member with no folded state has no letters to redraw and is counted as not asked rather than as passing

    A population that cannot fail

    Thirty-three crease patterns are kept here to run the checkers over, and every one of them has letters that agree with themselves. That is not a property of the patterns. It is a property of how they were made: each came from a construction that returns a lettering, so a test looking for letters that contradict themselves has nothing to fire on. Reletter the same thirty-three and the failure is available at once — on one member, four of sixty redraws.

    part 5 · complexity
  6. the bar is how many patterns the population holdseach one sampled forty times and then searched, to see whether the two methods ever disagreethe printed patterns80 never lettered by 40 draws · all 8 settled by search · worst 60 nodestwist tessellations70 never lettered by 40 draws · all 7 settled by search · worst 19 nodesquadrilateral meshes60 never lettered by 40 draws · all 6 settled by search · worst 6 nodesfold-and-cut patterns70 never lettered by 40 draws · all 7 settled by search · worst 14 nodesthey never do here — the patterns that separate them are not in any of these four

    Four populations with nothing to separate

    This collection keeps four standing populations of crease patterns to test its machinery against. Twenty-eight patterns, sampled forty times each for a lettering that agrees with itself and then searched for one — and on every single member the two methods return the same verdict in the same breath. The patterns that separate them are in none of the four, and the reason they are not is what the populations are for.

    part 6 · complexity
  7. 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.

    part 7 · complexity
  8. 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.

    part 8 · complexity
  9. the grid, 2×2 cellsone drawing, four sheetscutoutgluedacrossgluedalonggluedboth waysvertices4444free letters1210108panels9664V − 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

    One population, four sheets

    A population of patterns is a way of asking what is typical, and it has always been a population of drawings. Put the same drawings on four different sheets and the verdicts move — not because the drawings changed but because the sheet did, which means a population has two halves and only one of them was ever chosen.

    part 9 · complexity

All series