The taco-tortilla condition — where it appears
Named by 4 essays across 3 fields — each of them below, with the objects they name alongside it.
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.
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.
Cutting a patch out of a plane
A tessellation is infinite and a sheet is not, so every picture of one is a decision about where the paper stops. Assembling whole twist units on a square and running the outstanding pleats to the rim puts 12, 18, 12 and 5 creases across other creases on four of five tilings; generating the pattern over a larger region and clipping it puts none. The panels then place exactly — and what is waiting behind the repair is a different refusal that could not be asked about before.
Two stacks shuffled in glued pairs
A Miura patch three columns wide and r rows high has a central binomial number of folded states — 2, 3, 6, 10, 20 and on to 252 at nine rows — and the count was measured without a reason. The reason is a shuffle. In every state the middle column lies at the bottom and the two end columns lie above it, interleaved like two halves of a deck. Some pairs of an end column's panels can never be parted, because the row crease joining them lies inside the other column's folded footprint, and the two columns take those welds in turn, one at every row crease. That leaves r + 1 unbreakable blocks, and the number of ways to interleave them is the binomial.
Named alongside it
The objects these essays reach for when they reach for this one.
Folded stateLayer orderingLayer orderThe taco-taco conditionBoundary vertexConstraint propagationCountingCrease patternCrossingLayer multiplicityMiuraNon-crossing condition