Hiden senbazuru orikata — where it appears
Named by 8 essays across one field — each of them below, with the objects they name alongside it.
Nothing here is as old as it sounds
Paper folding is described everywhere as an ancient art. The oldest surviving book of it was printed in 1797, the oldest reference to folding for amusement is from 1680, and the median claim in this subject is dated two centuries before anything that attests it.
The oldest book cuts the paper
The Hiden Senbazuru Orikata of 1797 is the earliest surviving book of recreational paper folding, and its famous connected cranes are made by slitting one sheet into a grid. The founding rule of the modern subject is younger than the tradition it claims to describe.
Which cranes can stay joined
The 1797 book slits a square into a grid and leaves the cranes attached at the interior lattice points, each of which holds four of them at once. Of the sixteen ways to choose which of a three-by-three's four points to leave joined, exactly one leaves the piece in a single object — and it is the one that uses all four. The cutting is very nearly forced rather than chosen.
One lost source and the story changes
Five of the record's fifteen claims rest on exactly one surviving document. Take those away and the field's most-quoted statistic — how far ahead of its evidence a popular date runs — falls from three hundred and fifty-seven years to a hundred and ninety-three, while the median hardly moves at all. The effect is not a tendency spread through the record; it is two documents, and both of them are single-witness.
Nearly every cutting fails at one crane
Six by six connected cranes have twenty-five joins and thirty-three million ways to keep some of them, and an exhaustion over all of them takes a fifth of a second. Of the 33,412,811 that fail, 99.64 per cent fail at a single crane — one left holding none of the joins at its corners — which a maker can check by looking at each crane in turn. The arrangements that pass that check hold together less often as the grid grows: all of them at three by three, 54 per cent at six by six.
The prediction held at eight and broke at ten
A join in a slit grid of cranes merges at most four pieces, so n² cranes need at least ⌈(n² − 1)⁄3⌉ joins, and exhaustion found four and six by six meeting that floor in exactly one way. The guess was that eight by eight would too, with twenty-one joins. Counted a join at a time, it does — twenty-one, one way. Ten by ten does not: it needs thirty-four against a floor of thirty-three, and has 7,076 ways to spend them. The grids that meet the floor with no merge to spare are four and eight by eight among every size to fourteen, and sixteen by sixteen by construction, because a perfect tree of joins on a grid twice as wide is four perfect trees and one join in the middle. The even grids were never the pattern; the doublings are.
No odd grid holds a perfect tree
A perfect tree of joins holds a slit grid of cranes with every join merging four pieces that were separate. Two joins side by side share two cranes and close a loop, so a perfect tree never has two — and so all its joins lie on one colour of the checkerboard the lattice points make. The four corner cranes each touch one lattice point, which must be a join; on a grid with an odd side those four points are two colours. So no odd grid holds a perfect tree, and seventeen by seventeen, the size the count was pointing at, is settled without counting. On one colour the search is small enough to finish: sixteen by sixteen has exactly one perfect tree, the doubled one, and twenty by twenty has none.
A perfect tree is the joins it leaves out
On the colour a perfect tree lives on, the lattice points and the cranes they share form a graph full of loops, and a perfect tree is that graph with some points cut out. Euler's count fixes how many: every cut removes three loops' worth, and the loops always number exactly three times the cuts a perfect tree needs — so a set of that many cuts, no two sharing a crane, leaves a perfect tree exactly when what remains is one piece. Searched that way, ten by ten fails in seven cases that fit on one page, fourteen in 761, and sixteen's one tree is four copies of eight's diamond of cuts with a cross of cuts along the middle.
Named alongside it
The objects these essays reach for when they reach for this one.
SenbazuruThe counting problemConnectivityLattice identityAttestationDocumentary recordKirigamiOne sheet no cutsParityPrimary sourceIndependent discoveryLocality