Origami & Folding
what one sheet can do
Concept

The taco-taco condition — where it appears

The condition forbidding two folds at the same place from interleaving their layers. It is one of the two local rules that constrain a layer ordering, and neither is visible to any vertex condition.

Named by 6 essays across 3 fields — each of them below, with the objects they name alongside it.

taco-tacoallowedforbiddentwo folds at the same place may nest or stand clearthey may not interleavetaco-tortillaallowedforbiddena flat layer may pass outside a foldit may not pass through onea crease pattern can satisfy every vertex condition and still break one of these

Which layer goes on top

The mountain-valley assignment says which way each crease turns. It says nothing at all about which sheet ends up above which, and that second question is a different object with its own rules — and all of the difficulty.

flat-folding · Flat-foldability state 0state 1V M M V — the same pattern in both2 valid stackings, found by enumerationwhat a junction would addthree wires meeting, with the layer orders forced to disagree —which is a clause, and which is where the reduction gets its powernot drawn and not verified: nothing here decides layer order in two dimensions

The gadgets that make it hard

Flat-foldability is NP-hard, and the proof is a construction rather than an obstruction: a machine for turning any satisfiability problem into a sheet of paper that folds exactly when the problem has an answer.

flat-folding · Flat-foldability the bar is the pairs of panels that lie over one anotherThe preliminary base288 panels · 12 rules · an ordering existsThe Miura fold22824 panels · 228 rules · not decidedThe square twist369 panels · 48 rules · an ordering existsThe hexagon twist6613 panels · 96 rules · an ordering existsThe Yoshimura pattern205565 panels · 1187 rules · not decidedFold and cut — the triangle217 panels · 15 rules · an ordering existsThe tapered corrugation28228 panels · 351 rules · not decidedThe waterbomb tessellation92652 panels · 654 rules · not decideda pattern with no bar has no two panels over one another, and its order is not a question

No height to swap

A folded strip is a permutation of segments, and the smallest change a hand can make to it is a swap of two heights: 672 stackings, 560 of them isolated. A folded sheet has no height. Its layers are ordered by statements about which panels share ground, and on every printed pattern the search can finish, the answer is one stacking and no way out of it.

flat-folding · Layer multiplicity the square twist, sieved three timesevery lettering4,0962 to the 12passes every vertex2566.3% of themletters are consistent2524 force a loop of panelshas a folded state80.20% of themthe bars are on one scale, so the last one is the size of the answer against the size of the question

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.

flat-folding · Flat-foldability the bar is the number of foldings, on a logarithmic scaleboth routes give the number printed; a disagreement anywhere would be a defect in one of them2 × 122 letterings · 1 creases3 × 164 letterings · 2 creases4 × 1168 letterings · 3 creases5 × 15016 letterings · 4 creases6 × 114432 letterings · 5 creases2 × 288 letterings · 4 creases3 × 26032 letterings · 7 creases4 × 2320128 letterings · 10 creases3 × 31,368256 letterings · 12 creasesa strip of stamps is the one-row case, and the classical sequence 2, 6, 16, 50, 144 is the top of the table

The map counted from the layers

The classical map-folding counts are computed from a rule that never places a panel: work out which edge of the folded square each fold wraps around, and refuse the orderings that interleave two folds at one edge. Place the panels instead and order them by the general non-crossing rules, and the same numbers come out — 2, 6, 16, 50, 144, 8, 60, 320, 1368 — on nine sizes, by machinery that shares no line of code with the first.

complexity · Map folding the bar is how many letterings of the mesh can have their panels stackedout of every labelling of its twelve creases, enumeratedmesh 3016 pass every vertex · 16 agree with themselves · arrived refusedmesh 5032 pass every vertex · 32 agree with themselves · arrived refusedmesh 8832 pass every vertex · 32 agree with themselves · arrived refusedmesh 11832 pass every vertex · 32 agree with themselves · arrived foldablemesh 141416 pass every vertex · 14 agree with themselves · arrived foldablemesh 19416 pass every vertex · 16 agree with themselves · arrived refusedtwo of the meshes have none at all, and two more were refused only at the lettering they came with

Refused at one lettering

Four of six quadrilateral meshes here have no arrangement of their nine panels — established by searching every ordering, at the labelling each mesh arrived with. Enumerate every labelling instead and two of the four fold perfectly well at a different one. What was reported as a fact about four meshes is a fact about two meshes and two labellings.

rigid · Self-contact

Named alongside it

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

Layer orderingNon-crossing conditionFolded stateAssignmentCrease assignmentLayer orderNP-hardSelf-intersectionThe taco-tortilla conditionThe Bern–Hayes reductionDecidabilityEnumeration

All concepts